Live data from Hacker News

An Argument Against Quantum Computers

quantamagazine.org

31–40 of 67 posts

Re: An Argument Against Quantum Computers

#31
post #11

Scott Aaronson still has his $100 000 wager available for an actual refutation of scalable QC. The impetus for the bet was actually from arguing with Gil Kalai in the comments on a blog. https://www.scottaaronson.com/blog/?p=902

Whether or not you can make a scalable quantum computer is beside the point, though. The question is, can you make a quantum computer that is competitive with a classical computer, speed and/or cost wise.

I suspect that any speedup imparted by clever uses of entanglement will be counteracted by the fundamental need for error correction and averaging over several runs. I look forward to being proven either right or wrong, and I suspect I will be in my lifetime.

Re: An Argument Against Quantum Computers

#32

Earlier quoted context omitted.

Imagine you have a classical bit string 0101, there are 2^4 possible different configurations of this string, and the classical computer will always exist in ONE of them. A quantum computer, with a qubit register 0101, can be put into a superposition state between all 4 qubits, where the state of the qubit register is ALL 2^4 different configurations simultaneously....now scale that up to 50-100-1000 qubits and you g…

That argument is patently wrong: it's the quantum bullshit fallacy. The point of the space argument I was making was that, if you need N bits of space to represent the input/output in classical computers, you should still need (I'm not sure if it's the case, but I don't see why it's not) Ω(N) qubits to do the same representation in a quantum computer. The quantum bullshit fallacy is that, since an entangled N-qubit i…

Honestly, I don't understand the point you are making. If you can explain to me how the Deutsch-Joza algorithm works without making reference to the fact that a function evaluation happens on a qubit in superposition(and thus an expanded state-space, as the simplest example), sure. I sincerely don't understand your points about classical simulation, or input/output in classical computers.

Re: An Argument Against Quantum Computers

#33

The flip side of this argument is that if a quantum computer can never show "quantum supremacy" over a classical computer, then perhaps there are much better ways of simulating quantum phenomenon with classical computers than we've yet discovered. It's important to remember that the motivation for quantum computing came from the realization that it's intractable to simulate quantum phenomenon on classical computers.…

I think the flipside is, if we can't do it, we discover interesting new physics.

I'm looking forward to it either way.

Re: An Argument Against Quantum Computers

#34

A note for the savvy: A quantum computer is not a magic bit-string that mysteriously flips to the correct answer. A n-qubit quantum computer is not like 2^n phantom computers running at the same time in some quantum superposition phantom-zone. That's the popular misconception, but it's effectively ignorant techno-woo. Here's what really happens. If you have a string of n-qubits, when you measure them, they might end…

I'm not sure it's useful anymore to point to quantum computers and say: 'Hey! You're not getting all your function evaluations back....so they're weak'. I feel this leads to misconceptions about quantum computing as well. You have to remember, the tensor product of N qubits is an exponentially expanding space...and the functions DO get evaluated in that space, the trick being you have to extract a JOINT property of t…

the trick being you have to extract a JOINT property of the function evaluations, rather than the result of each one individually.

This is an even more succinct way of saying it. This is the key point that people need to know, which separates someone from understanding the real potential of quantum computers from "quantum woo."

Let's be clear, even with this caveat, the potential of quantum computing is enormous.

No question. But to think clearly about it, one has to know this caveat. Likewise, to understand the potential of conventional computers, one needs to actually be able to think about computation within its realistic limits, not treat them as magic boxes.

Re: An Argument Against Quantum Computers

#36

A note for the savvy: A quantum computer is not a magic bit-string that mysteriously flips to the correct answer. A n-qubit quantum computer is not like 2^n phantom computers running at the same time in some quantum superposition phantom-zone. That's the popular misconception, but it's effectively ignorant techno-woo. Here's what really happens. If you have a string of n-qubits, when you measure them, they might end…

There was a nice morning paper last week that gave some good examples of this with interesting links.

https://blog.acolyer.org/2018/02/02/polynomial-time-algorith...

Re: An Argument Against Quantum Computers

#37

Gil Kalai can have his contrarian opinion on quantum computers. But we can have a much simpler argument against quantum computers. That they will remain infeasible for a long enough time for traditional computers to catch up to it. What I mean by traditional computers catching up with it is that we will see innovations in traditional algorithms that either make quantum computers extremely pricey for a very long time…

If conventional computers catch up, this might indicate that there exist conventional solutions to quantum problems. That could lead to new physics.

Re: An Argument Against Quantum Computers

#38
This illustrates the disconnect of mathematicians trying to do physics. Not only his error model is unrealistic (you essentially need a frequency dependent power spectral density function to represent fluctuations in control which decays according to a power law at high frequencies, sometimes called 1/f noise but the power doesn't have to be 1; also you don't get that kind of strong spatial correlations in real systems, cross-talk among spins more of a realistic problem but it is not what he's doing either), his argument is based on something that is just wrong:

> that the effort required to obtain a low enough error level for any implementation of universal quantum circuits increases exponentially with the number of qubits, and thus, quantum computers are not possible.

That's what dynamical decoupling (DD) or pulse sequences are for: you can get arbitrarily high quality quantum gates (typically, but not always, at the cost of increasing the gate times; removing the most significant first order error typically increases the gate time by less than an order magnitude, think 2x-4x) without increasing the number of physical qubits at all. People don't just rely on surface codes, anyone serious about implementing a quantum computer use surface codes after DD to reduce the infidelity to the threshold required for them. Which is why you don't need hundreds of physical qubits to have a single robust logical qubit.

For those who are not familiar, DD is like one of the oldest tricks in the bag, it's nothing like a new cutting edge type quantum error correction code. In fact, the oldest form of DD, spin echo, precedes any real discussion about quantum computers by a decade.

DD is possible essentially because quantum operations don't commute so errors don't simply add up as they do with classical errors; this makes it possible to obtain a better gate by carefully combining noisy gates such that (significant) errors cancel.

Re: An Argument Against Quantum Computers

#39

Gil Kalai can have his contrarian opinion on quantum computers. But we can have a much simpler argument against quantum computers. That they will remain infeasible for a long enough time for traditional computers to catch up to it. What I mean by traditional computers catching up with it is that we will see innovations in traditional algorithms that either make quantum computers extremely pricey for a very long time…

Why are topological quantum computers more resilient? Do they handle the problem of decoherence better?

Yes, they are the theoretically the most elegant way to deal with decoherence. They rely on an exotic state of matter, non-abelian anyons(many still working on verifying their existence), and winding discrete non-abelian anyons into a topological braid, which disperses the quantum state spatially, making it much more resilient against decoherence(obvious simplifications made). This is the specific type of quantum computation that Microsoft is pursuing ala Michael Freedman and co.

Re: An Argument Against Quantum Computers

#40

Gil Kalai can have his contrarian opinion on quantum computers. But we can have a much simpler argument against quantum computers. That they will remain infeasible for a long enough time for traditional computers to catch up to it. What I mean by traditional computers catching up with it is that we will see innovations in traditional algorithms that either make quantum computers extremely pricey for a very long time…

Why are topological quantum computers more resilient? Do they handle the problem of decoherence better?

Yes, they do handle decoherence better. Here is a video explaining the theory behind the particles that are used to perform topological quantum computation [0]. I emphasize that unlike superconducting, quantum dots, ion traps, photonic e.t.c; topological quantum computers have not been physically realized because non-abelian anyons have not been detected.

[0]: https://www.youtube.com/watch?v=hKFecm9NKbM

Post reply on HN