Take the 2-minute tour ×
Physics Stack Exchange is a question and answer site for active researchers, academics and students of physics. It's 100% free, no registration required.

Victor Stenger argues that the apparent randomness in quantum mechanics is a result of the randomness in the macroscopic detectors (similar to the randomness in the laws of thermodynamics) and is not something that is inherent to quantum mechanics (this is my interpretation of Stenger). This would imply that QM is ultimately deterministic. See http://www.colorado.edu/philosophy/vstenger/Timeless/08-timeless.pdf

If this is true, then would Shor's factorization algorithm still work for large integers? More generally, how would scalable quantum computing be affected?

share|improve this question
    
I don't think so. Shor himself provided the argument in another thread that determinism implies $2^n$ states are necessary for a system of order $n$. –  Nick Sep 2 '12 at 19:45
    
Can you point to the thread? –  Craig Feinstein Sep 2 '12 at 20:23
    
physics.stackexchange.com/a/34402/960 –  Nick Sep 2 '12 at 20:24
    
Thank you Nick. That's good, but I'd like to see more detail in an answer. Hopefully, someone will provide more detail. –  Craig Feinstein Sep 2 '12 at 20:37
    
Related: physics.stackexchange.com/q/34308/2451 –  Qmechanic Dec 30 '12 at 19:21
add comment

1 Answer

up vote 2 down vote accepted

Victor Stenger's stuff is vague unquantitative musings with no significant value, about back and forth in time particle paths and such things. It isn't important to this question, and it isn't important for anything at all.

If quantum mechanics is deterministic underneath, and the number of variables is reasonably bounded, for example a number of bits less than the area of the cosmological horizon in Planck units, about $10^{138}$, then the the exponentially growing search ability of a quantum computer will crap out. The point at which factoring necessarily fails can be easily estimated from the number of independent multiplications performed in Shor's algorithm. To do $10^N$ multiplications in superposition at once, you need $10^N$ classical states (it's actually NlogN in the exponent, but same difference), so when N is larger than around 130, so around 130 digit numbers, you exceed this bound.

Since the entire universe can't be expending all it's effort on your dinky quantum computer, the actual bound will be closer to 100 digits, on the same the order of the numbers used for cryptography today.

To be on the absolute safe side, perhaps nature realizes something about the multiplications and reduces the operations accordingly, you should have N to some power less than 1 in the exponent, because of redundancies, and you should have N to some power less than 1 in the exponent. This power cannot be as small as 1/2, because the best classical algorithm scales exponentially in a higher exponent than this, and nature isn't as clever as mathematicians trying hard to do factoring. So you get a firm bound at around 10,000 digits, and a quantum computer factoring larger numbers than this is definite evidence that quantum mechanics is exponentially large.

If you don't say there is a limit to the amount of classical computation in the deterministic model, if you allow exponentially large deterministic descriptions, you can mimic quantum mechanics exactly using Bohmian mechanics. You make a lattice description of some field theory, you make a wavefunction for the fields, and you have definite field values that wander around according to the Bohmian quantum force law. This type of thing can't be ruled out experimentally, but the description is not unique, it is different depending on which fields you choose to make Bohmian, and in which time-slicing you define the quantum-force dynamics, so it is certainly not the right description. Bohmian mechanics might as well be quantum mechanics, which is why Bohm's theory is more often called an interpretation of quantum mechanics rather than a new theory.

There is no point in asking whether it's deterministic underneath if Shor's algorithm works, the determinism in this case would be the universe simulating quantum mechanics and fooling us into thinking it's correct. In this case, you might as well believe quantum mechanics is exact with no substructure.

So the only options, modulo philosophy, are that quantum mechanics fails to factor 10,000 digit numbers, or that it succeeds and is exact. This a wonderful experimental distillation of the hidden-variable question, and for those that have full confidence that quantum computers will work, this definitively excludes hidden variable theories. This is Shor's answer to this question: Why do people categorically dismiss some simple quantum models? .

share|improve this answer
    
from where does it come the estimation of $10^{130}$ classical bits for what is encoded by our cosmological horizon? –  lurscher Sep 2 '12 at 21:45
    
@lurscher: That's the age of the universe in Planck times squared. –  Ron Maimon Sep 2 '12 at 22:21
    
what is the relationship between area of cosmological horizon and age of the universe? –  user56771 Sep 3 '12 at 3:52
    
@user56771: The radius of the universe and it's age are the same up to factors of order unity, calculable from the r-form of the FRW metric. I don't extrapolate as cosmologists often misleadingly do, but whether you do or don't, all these considerations would only change the order-unity factor, not the order of magnitude. –  Ron Maimon Sep 3 '12 at 5:51
1  
@CraigFeinstein: It is not "well written" because the number of ideas per sentence is too low to waste time reading it, and it is not important because the new ideas, which are hardly there, are all wrong. –  Ron Maimon Sep 3 '12 at 17:42
show 3 more comments

protected by Qmechanic Feb 16 '13 at 0:42

Thank you for your interest in this question. Because it has attracted low-quality answers, posting an answer now requires 10 reputation on this site.

Would you like to answer one of these unanswered questions instead?

Not the answer you're looking for? Browse other questions tagged or ask your own question.