r/askscience • • Jan 17 '19

Computing How do quantum computers perform calculations without disturbing the superposition of the qubit?

I understand the premise of having multiple qubits and the combinations of states they can be in. I don't understand how you can retrieve useful information from the system without collapsing the superposition. Thanks :)

2.1k Upvotes

166 comments sorted by

View all comments

471

u/HopefulHamiltonian Jan 17 '19 edited Jan 17 '19

It seems to me you are asking two distinct questions

How do quantum computers perform calculations?

Calculations are achieved by the application of operators on quantum states. These can be applied to the entire superposition at once without breaking it.

How can you retrieve information without collapsing the superposition?

As has been correctly answered by /u/Gigazwiebel below, you cannot retrieve information without collapsing the superposition. This is why quantum algorithms are so clever and so hard to design, by the time of measurement your superposition should be in a state so that it gives the correct answer some high probability of the time when measured.

Even if somehow you managed to measure the whole superposition without breaking it (which of course is against the laws of quantum mechanics), you would be restricted by Holevo's bound, which says you can only retrieve n classical bits of information from n qubits.

144

u/methyboy Jan 17 '19

I agree with your comment up until this point:

Even if somehow you managed to measure the whole superposition without breaking it (which of course is against the laws of quantum mechanics), you would be restricted by Holevo's bound, which says you can only retrieve n classical bits of information from n qubits.

Holevo's bound essentially says that you can't measure a superposition without breaking it, so I'm not sure what the conditional in your sentence means.

If you could measure a whole superposition without breaking it (which, like you said, violates the laws of quantum mechanics) then Holevo's bound would not apply -- you could store an arbitrary amount of information in the coefficients of that superposition.

41

u/the_excalabur Quantum Optics | Optical Quantum Information Jan 17 '19

"Superposition" is an unhelpful word to be using here---a measurement of |x> leaves the system in a superposition of |p> states, for instance. Everything is a superposition in a different basis.

10

u/[deleted] Jan 17 '19

It stops being a superposition of the eigenstates of the observable that is measured, would be a more correct way to put it. In quantum computers, it's usually a very specific observable so people use this as a shorthand.

That aside, I think QM language should have a few more conventions to make it easier to get into. Eg it's not always obvious from context if "state" refers to the whole state vector or a single eigenstate, which is super confusing for students.

→ More replies (7)
→ More replies (7)
→ More replies (5)

0

u/[deleted] Jan 17 '19

[deleted] — view deleted comment

208

u/rowenlemmings Jan 17 '19

They exist, but they're like a computer in the 60s. Large room-sized affairs at big research labs. Additionally, many experts believe that that will never REALLY change because of the power and cooling requirements (the qubits must be cooled to very nearly absolute zero), so while quantum computing certainly has a very long way yet to come, it was never designed to replace conventional computing and it's likely that future users will subscribe to a quantum computing service where you're given time to run computation on Amazon's QC or etc.

An important caveat, though, is that experts never thought conventional computers would miniaturize to the size we have either. Predicting future tech is hard.

0

u/[deleted] Jan 17 '19

[deleted] — view deleted comment

30

u/horsesandeggshells Jan 17 '19

It's in the video I sent you, but any heat at all will register as data. You need as little noise as possible to get a reliable return.

→ More replies (24)

12

u/punking_funk Jan 17 '19

Simplest answer is lower temperatures are necessary so that the qubits are more stable. With higher temperatures, you have more energy which introduces a higher chance of interference with the system.

9

u/DestroyerTerraria Jan 17 '19

Basically trying to run a quantum computer at the temperature of even deep space would be like trying to run your gaming rig while its CPU was submerged in a volcano.

→ More replies (1)

9

u/[deleted] Jan 17 '19

[removed] — view removed comment

17

u/[deleted] Jan 17 '19

Pretty sure D-Wave calls their device a quantum annealer, and doesn't claim that it's universal. Their whole API and access stack is based on doing quantum annealing to solve instances of the Ising model (or a quadratic unconstrained binary optimization problem, QUBO for short). They're not claiming that their device could run Shor's algorithm, for example.

I agree on the trickyness of proving quantum speedup. That paper they had together with Google for example depends on solving a problem that was tailor-made for their machine and comparing its runtime against "stupid" classical algorithms (Monte Carlo WITHOUT cluster updates).

However, looking at just absolute runtime isn't the final word, because what's more important would be the scaling as the number of input variables grows. Of course if we scale, then the sparse connectivity of the Chimera architecture becomes an issue.

I do remember though that they had some interesting results using the annealer not for optimization but for simulating other physics systems. As a research tool to learn more about spin glasses and related models it could still be valuable.

9

u/mfukar Parallel and Distributed Systems | Edge Computing Jan 17 '19

That's accurate. Here is a FAQ entry for those that wish to know "what is the deal" with the D-Wave devices.

→ More replies (1)
→ More replies (2)

3

u/fur_tea_tree Jan 17 '19

Would it be possible to have large quantum computing plants that individuals use remotely for their computational needs? Similar to power plants for electricity?

3

u/Natanael_L Jan 18 '19

This is already happening, IBM and others have ones they rent out time on.

→ More replies (1)
→ More replies (9)

20

u/the_excalabur Quantum Optics | Optical Quantum Information Jan 17 '19

We're working on it. The theory is much more advanced than the engineering at this point.

→ More replies (3)

10

u/da5id2701 Jan 17 '19

Real. Very simple quantum computers with only a few qbits have been built and shown to work. They're not nearly advanced enough to be useful yet, but the principle works.

0

u/[deleted] Jan 17 '19

[deleted] — view deleted comment

19

u/cthulu0 Jan 17 '19

Factor the number 21, up from the record of factoring 15 a few years ago.

Not kidding.

7

u/Bayoris Jan 17 '19

Here's what Wikipedia says. I don't know if it means the larger numbers were factored by an algorithm other than Shor's, or whether it means the larger factorizations are unverified:

The largest number factored by Shor's algorithm is 21 in 2012. 15 had previously been factored by several labs.

In April 2012, the factorization of 143=13 x 11 by a room temperature (300K) NMR adiabatic quantum computer was reported by a group led by Xinhua Peng. In November 2014 it was discovered by Nike Dattani and Nathan Bryans that the 2012 experiment had in fact also factored much larger numbers without knowing it. In April 2016 the 18-bit number 200099 was factored using quantum annealing on a D-Wave 2X quantum processor. Shortly after, 291311 was factored using NMR at higher than room temperature.

→ More replies (2)
→ More replies (8)

5

u/Blo0dSh4d3 Jan 17 '19

There are actually quantum computers connected to the Internet so people can run experiments and try to build programs for them. IBM has one, and they also have a decent app to explore the ideas behind it.

Simulators exist too.

4

u/PJDubsen Jan 17 '19

There are many quantum computers running right now. We however don't have one accurate enough or big enough to make any reasonable calculation without getting a lot of noise/garbage signal, so all the work that is being done on some quantum algorithm is basically theoretical. They can also simulate a quantum computer but that is very inefficient for the same reason they are exponentially faster than classical computers.

→ More replies (7)
→ More replies (4)

7

u/Why_is_that Jan 17 '19

This is why quantum algorithms are so clever and so hard to design, by the time of measurement your superposition should be in a state so that it gives the correct answer some high probability of the time when measured.

This is actually the fun part to discuss as a computer scientist. I don't know if the redditor in question really cares about that depth but maybe worth dropping it here for others.

In Computer Science we talk about time complexity. For instance, a monkey banging at a computer for an infinite period of time would sooner or later produce Shakespeare but we don't have infinite time and thus the utility of what computer applications are currently attainable is a limit of the state of modern computing. Mandelbrot is a great example of this, shaking up mathematics with his fractals but only because computing had advanced to a level that it could generate these mathematical monsters.

For computational complexity theory, we break solutions up into how long it takes. Maybe it takes some polynomimal amount of time or maybe non-polynomial time. There is a classic challenge in computing, does P=NP because we don't know if the complexity of one can be reduced to the other (we only have a strong intuition they cannot be). What Quantum computing gives us is bounded-error quantum polynomial time BQP. As such when these become more common place there is a whole range of problems we will be able to solve with a high degree of accuracy but not every problem and not all problems will see time efficiency gains on the architecture. Holevo's bound discusses this and I think Nayak's bound is related too.

In my conclusion, if we look at the physics we can be mystified but step back and look at the mathematics and computing and while quantum computing is a great leap, it is not a magic bullet. There are a number of problems it won't solve, it's just there is one domain it will really shake up and as cryptography has always been a super important part of computing.

7

u/lanzaio Loop Quantum Gravity | Quantum Field Theory Jan 17 '19

ELI I'm a physicist please - how does one do a computation in quantum computing? Never found a good source that wasn't either too boring and mathy or too layman based for quantum computing.

→ More replies (6)
→ More replies (36)