Jarek wrote:The difficulty of Hardy paradox is completely forbidding some possibilities, but you only work on averages - the base of your construction is equivalence between (61) and (91), which I see incorrect. I am leaving it unless explained.
Shor algorithm concerns quantum correlations of prepared and processed quantum state - fits your restriction.
In the Hardy paradox a certain average is zero. If Christian can reproduce the mean values predicted by the Hardy state and the Hardy measurements, then his model also says that something can never happen.
Jarek wrote:Quantum algorithms, especially Shor, are the ultimate test.
If you can effectively simulate them avoiding exponential cost of superposition, you will take all the spotlight from this currently huge field, immediately convince everybody, enforce rapid replacement of used cryptography ...
If you cannot, then your hidden variable is still missing something - might handle simple cases, but does not generalize.
The impact on quantum algorithms is a bit different from what you suggest.
1) if Christian's model can be transferred to an event-by-event simulation of a local hidden variables model which can also imitate (with no loss of speed) various standard unitary transformations, then we can factor large integers very fast on classical computers, and indeed, quantum computers are superfluous and standard cryptography used in internet banking etc needs to be replaced.
2) if Christian's model of the singlet correlations (and violation of Bell's inequality) can be transferred to an event-by-event simulation of a local hidden variables model then upcoming quantum cryptography and quantum key distribution is destroyed, because an insider can surreptitously replace the quantum components of such a system with classical computers; which of course are able to "clone" data without anyone noticing; so the users can be fooled into believing they have established quantum securely shared random strings for use as cryptographic keys, but the insider actually can reproduce those keys and hence also decode all future messages sent in classical channels, bu encrypted using the secret quantum generated keys.
Either way, if Christian's work is correct, the whole quantum computer hype collapses.
Now, it was published years ago, so everybody who could want to know Christian's methods, can just read his papers and copy the computer code written by Fred and others. I suspect that clandestine agencies are already working on implementing Christian's model as a trojan horse in order to infiltrate their enemy's supposedly quantum cryptographically secure communication system. They benefit by everyone believing that Christian's work is incorrect. So, it is not being suppressed by the establishment, in order to keep the quantum hype alive; it is being suppressed by the Illuminati, who are going to use it for world domination, and benefit from everyone else believing that Christian's work is discredited.
This can apply both to Shor's algorithm - a classical computer implementation of the algorithm with no loss of speed would be a splendid tool for the Illuminati - and to quantum key distribution. It's a win win situation for them. But everybody has to believe that Christian's work is not worth looking at. Otherwise they lose their fantastic opportunity for world domination.
