Quantum Effects in Algorithms

We discuss some seemingly paradoxical yet valid effects of quantum physics in information processing. Firstly, we argue that the act of "doing nothing" on part of an entangled quantum system is a highly non-trivial operation and that it is the essential ingredient underlying the computational speedup in the known quantum algorithms. Secondly, we show that the watched pot effect of quantum measurement theory gives the following novel computational possibility: suppose that we have a quantum computer with an on/off switch, programmed ready to solve a decision problem. Then (in certain circumstances) the mere fact that the computer would have given the answer if it were run, is enough for us to learn the answer, even though the computer is in fact not run.

[1]  Herzog,et al.  Interaction-free measurement. , 1995, Physical review letters.

[2]  R. Cleve,et al.  Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[3]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[4]  Artur Ekert,et al.  Quantum algorithms: entanglement–enhanced information processing , 1998, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[5]  R. Jozsa.  Quantum algorithms and the Fourier transform , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[6]  R. Jozsa,et al.  Quantum Computation and Shor's Factoring Algorithm , 1996 .

[7]  A. Steane.  Multiple-particle interference and quantum error correction , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[8]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9]  R. Jozsa.  Entanglement and Quantum Computation , 1997, quant-ph/9707034.

[10]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[11]  Shor,et al.  Good quantum error-correcting codes exist. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[12]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[13]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[14]  R. Penrose,et al.  Shadows of the Mind , 1994 .

[15]  Gottesman.  Class of quantum error-correcting codes saturating the quantum Hamming bound. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[16]  David Deutsch,et al.  Stabilization of Quantum Computations by Symmetrization , 1997, SIAM J. Comput..

[17]  L. Vaidman,et al.  Quantum mechanical interaction-free measurements , 1993, hep-th/9305002.