The Argument Against Quantum Computers

Patrick Coles, Scott Pakin

Vasil Dinev Penchev

Natural argument is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary natural arguments in any data.That ability of natural argument is interpreted as an intellect featuring any quantum computer.The property is valid only within a quantum computer: To utilize it, the observer should be sitedinside it. Being outside it, the observer would obtain quite different result depending on thedegree of the entanglement of the quantum computer and observer. All extraordinary propertiesof a quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three typesof quantum computation can be distinguished according to whether the series is a finite one, aninfinite rational or irrational number

Eric Kincanon

Abstract This paper considers the possibility that the world is a quantum computer. Accepting the argument that the world is a quantum computer leads to contradictions with the metaphysics of time that deny the reality of time. Further, metaphysicians who argue for the unreality of time based on physical arguments make assumptions in their models that contradict the quantum computational nature of the world and are not necessary.

Scott Aaronson

Jörn Müller‐Quade

Long-term security is achieved by protocols which use computational assumptions only during the execution of the protocol and become information theoretically secure afterwards. Coin flipping protocols and zero knowledge arguments are examples for protocols achieving long-term security. In this work we consider this regime between computational security and information theoretic security. A security model for long-term security is sketched and the class K of all two argument functions which can be computed with long-term security is characterised. Furthermore it is shown that the class Q of all two argument functions which can be computed using quantum cryptography is strictly contained in K. The characterisation of K is a generalisation of a result of Kushilevitz (1992), where he characterises the two argument functions which can securely be computed in presence of an unbounded passive adversary. The result in the quantum case additionally relies on the impossibility results of (D. Mayers, 1997) , (H.-K. Lo and H. R Chau, 1996) and the impossibility of quantum coin flipping result of Kitaev which is published in (A. Ambainis et al., 2004)

Scott Aaronson