Live data from Hacker News

I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

news.ycombinator.com

281–290 of 373 posts

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#281

Hi Scott, Do you think we will see a Quantum Winter (or even several), similar to how we've had several AI Winters? We see tremendous amounts of funding in academia (and also industry) to build ambitious projects that still have significant issues to overcome (both theoretical and engineering) before being any close to being implemented. At the same time there (still) seems to be much misunderstanding, such as Vivek…

Yes, when you look at the history of AI, a "quantum winter" is an obvious worry---i.e., a situation where the hype about QC becomes so unmoored from the reality as finally to cause the popular narrative to switch its polarity. Picture a pointy-haired boss who's now pouring money into QC, for no better reason than that it's new and faster and it's the future and people are talking about it and it could speed up his company's data mining by trying all possible answers in parallel. If something spooked that boss, one could imagine him joining a stampede for the exits with no greater understanding, canceling good research along with bad. If it happened to AI, then why not to us?

The fear of a quantum winter is one reason---if any reasons were needed besides the truth!---why I've spent so much effort on my blog over the past decade trying to counter irresponsible QC hype. Like, if anyone ever comes to me and says "you lied to me! it turns out that scalable QCs are really hard to build, and a lot more basic science needs to be done, and even if you did manage to build them, as far as anyone knows they'd only give you exponential speedups for a few special problems, not for most of the stuff my company cares about," I'll have a pretty enormous record that I can point to when I reply, "I WAS SCREAMING THAT AT THE TOP OF MY LUNGS AND YOU DIDN'T WANT TO HEAR IT!" For all the good it will do. :-)

Then again, maybe the worry is overblown. Some people claim that we've now passed the point where there will never again be an AI winter, any more than there will be an "electricity winter." The train just has too much momentum. Likewise, so long as the pressure continues to get more and more computing power and stave off the end of Moore's Law, it could be that QC will continue to entice people, regardless of the naysayers and regardless of how hard the engineering problems turn out to be.

I honestly don't know. I feel like I have a hard enough time understanding and communicating the truth about where this field stands in the present---and sometimes, trying to advance it by a small increment---without also prognosticating its future. :-) The latter involves all sorts of questions of economics, politics, and psychology that I have no special expertise about.

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#282

Hi Scott, Of the two main possible applications of QC, i.e. computational chemistry and cryptography, it's often just cryptography that is mentioned in the media. The Wikipedia entry on QC, in its "Potential" section, discusses mostly cryptography, while only two sentences are dedicated to chemistry. Cryptography is also used as the toy-problem for QC prototypes, i.e. factoring integers. However, as I understand it,…

It has multiple PR problems, including the one you mentioned. :-)

Everyone who follows QC knows that simulating quantum chemistry could be commercially important, while breaking RSA is not. And as far as I can tell, no one cares anymore about doing tiny demonstrations of Shor's algorithm, to factor 21 into 3x7 or whatever. Over the past 5 years, the experimental interest has shifted to (1) demonstrating sampling-based quantum supremacy (which has nothing to do with Shor's algorithm), (2) demonstrating the building blocks of quantum error correction, and (3) the prospect of doing useful simulations.

(A central reason for this is that, until you have a full fault-tolerant QC with millions of physical qubits, you almost certainly can't run Shor's algorithm in a way that will outperform a classical computer, even if you wanted to. By contrast, people are excited right now that they might be able to learn something new for physics or chemistry with just a few hundred good physical qubits.)

So anyway, we all know all of this, but popular expositions still like to concentrate on breaking public-key crypto because of its wow-factor (and, of course, the undisputed theoretical importance of Shor's algorithm, and its possible eventual security importance). In addition, there's often a time-lag problem, where the people working in the field have one set of concerns, and then the broader discussion is still stuck in the world of 1997.

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#283
post #267

Hey there Scott! I just wanted to say I wrote a student-paper on quantum computational complexity last year and I felt like your papers made up almost 90% of my references. Thank you for making my learning about the subject possible! On to my question: I'm working on a capstone project right now that's using quantum computing to create a small video-game. I'm using the 5-qubit quantum experience from IBM and I was wo…

That's a tough one! So far, I've only seen ONE game meant to teach quantum mechanics that I thought actually worked, in terms of being (1) actually about QM rather than some vague analogy, and (2) fun to play. It's this one:

http://quantumgame.io/

Notably, this game doesn't even try to teach about entanglement (which, no surprise, is hard to keep track of in your head!). Tt deals only with a single photon passing through a network of beamsplitters and phaseshifters: a situation that has one foot in quantum physics and one foot in classical physics (the macroscopic state of a laser beam obeys exactly the same math). But the puzzles are really clever!

If you're just trying to create an educational game, why bother using the Quantum Experience? Won't it just introduce enormous errors and delays (~30 seconds per run when I tried it), complicating and obfuscating whatever you're trying to teach? Why not just make some puzzles that force people to reason about small, idealized quantum systems, along the lines of the successful example above?

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#284

Quantum information theorists such as Patrick Hayden and Leonard Susskind suggest that information can be neither created or destroyed. Do you ever think about such things? If so, how does it enter into your work?

Yes, a fundamental property of quantum information undergoing unitary evolution (meaning, no measurements, no discarding stuff into the environment, etc.) is that it can be neither created nor destroyed. This fact enters into my work, or the work of anyone else in quantum information, sort of like how the number '2' enters into our work---i.e., so thoroughly that it would be hard to pick it out as a separate ingredient!

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#285
post #125

Hi Scott, thank you for writing your blog all these years. Your Busy Beaver essay ignited my passion for computer science, especially in algorithm analysis, logic, undecidability, and probability theory. I used to be someone who only thought in code; thanks to you, I now also think in math.

Thanks; that made my day!!!

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#286

Is there a model of a computation that stands to quantum computation in the same way a universal Turing machine stands to classical computers, or is the UTM already enough?

Yes, you can define a universal quantum Turing machine, which is a single quantum Turing machine U able to simulate any other quantum Turing machine M (at least, to arbitrary precision) given a coded description of M on its tape. This is one of the main observations David Deutsch made in his famous paper from 1985.

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#287
post #66

Earlier quoted context omitted.

No, I hadn't heard of it before your comment! Please no one tell the physicist David Mermin about this, or he'll picket the group with his long-running campaign to change the spelling of qubit to "Qbit." :-)

Is it pronounced kew-bit or kuh-bit or kwu-bit?

"cue-bit." I.e., the name of the letter Q, followed by "bit."

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#288
post #166

What are the prime factors of this number? 1847699703211741474306835620200164403018549 3386634101714717857749106516967111612498593 3768430543574458561606154457179405222971773 2524660960646946071249623720442022269756756 6873784275623895087646784409332851574965788 4341508847552829818672645133986336493190808 4671990431874381283363502795470282653297802 9349161558118810498449083195450098483937752 2725705257859194499387007…

This number is prime.

I doubt it.

  >>> gmpy.is_prime(1847699703211741474306835620200164403018549338663410171471785774910651696711161249859337684305435744585616061544571794052229717732524660960646946071249623720442022269756756687378427562389508764678440933285157496578843415088475528298186726451339863364931908084671990431874381283363502795470282653297802934916155811881049844908319545009848393775227257052578591944993870073695755688436933812779613089230392569695253261620823676490316036551371447913932347169566988069)
  0

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#289
post #82

I have so many questions for you, but lets just go with one. Can you explain to me the concept of "logical qubit", and the whole debacle about qubit quality? I'm still getting confused again and again over this.

Qubits lose their quantum superposition states as they interact with their environment---effectively getting "measured" by their surroundings. This is called decoherence, and is the central engineering obstacle to building useful QCs.

The longer a qubit lasts while maintaining its quantum coherence, and (especially) the more operations you can do on it while keeping it coherent, the better that qubit's quality.

In practice, we will never be able to build qubits of perfect quality (i.e., ones that maintain their coherence forever except when we deliberately measure them). In the 1990s, some people thought this would be a fatal obstacle to scaling up QCs. But then two closely-related discoveries, called quantum error-correction and quantum fault-tolerance, dramatically changed the picture. These discoveries showed that, even if your physical qubits fall short of perfection, as long as they have a high enough quality, you can glom a bunch of them together into a single "logical qubit"---that is, a qubit that lives in the collective state of multiple physical qubits, and that can still be recovered even if any small number of those physical qubits lose their coherence. Furthermore, one can do an arbitrarily long quantum computation on these encoded (logical) qubits, continuously monitoring to see which of the physical qubits have suffered errors and correcting those errors (but not monitoring in a way that would collapse the logical qubits!). In this way, one can in principle build a reliable quantum computer out of unreliable parts---a generalization of John von Neumann's famous discovery from the 1950s, which showed that the same was true of classical computation.

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#290

Hi Scott, Is there any chance advances in quantum computing will affect crypto currencies. I.e. it might be possible to shortcut mining or mess with the quorum of the distributed ledger? I'm curious as crypto currency is so hyped, it would dismay me that advances in quantum computing might disrupt the current landscape, or even better improve it in some way. Entanglement is already deployed and in use for data transi…

See this recent survey article: https://arxiv.org/abs/1710.10377

Briefly, a fully fault-tolerant quantum computer could give a square-root speedup for Bitcoin's proof-of-work, and could completely break its elliptic-curve-based signature scheme. Both issues could in principle be fixed by migrating Bitcoin to quantumly harder problems, though in practice doing so could open up security holes of its own. This hasn't been done, but I think maybe there are other cryptocurrencies trying to use quantum-secure crypto from the outset? Googling just now, I found something called "Quantum Resistant Ledger" (https://theqrl.org/) -- does anyone here know more about what's out there?

Let me stress that none of this is a concern with the QCs of the near future, which will have at most a few hundred decent qubits and no error correction, and which will not be able to threaten Bitcoin or any other cryptography.

Post reply on HN