publication . Preprint . 1999

Non-Mechanism in Quantum Oracle Computing

Castagnoli, Giuseppe;
Open Access English
  • Published: 08 Feb 1999
A typical oracle problem is finding which software program is installed on a computer, by running the computer and testing its input-output behaviour. The program is randomly chosen from a set of programs known to the problem solver. As well known, some oracle problems are solved more efficiently by using quantum algorithms; this naturally implies changing the computer to quantum, while the choice of the software program remains sharp. In order to highlight the non-mechanistic origin of this higher efficiency, also the uncertainty about which program is installed must be represented in a quantum way.
arXiv: Computer Science::Programming Languages
free text keywords: Quantum Physics
Download from

[3] D. R. Finkelstein, Quantum Relativity, Springer, Berlin Heidelberg (1996).

[4] P. Shor, Algorithms for Quantum Computation, AT&T Bell Laboratories (1994).

[5] D. Deutsch, Proc. R. Soc. London A 400, 97 (1985).

[6] D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu, and A. Sampera, Phys. Rev. Lett. 77, 2818 (1996). [OpenAIRE]

[7] D. Deutsch and R. Jozsa, Proc. R. Soc. London. A 439, 553 (1992).

[8] L. Grover, Phys. Rev. Lett. 79, 325 (1997).

[9] G. Castagnoli, Int. J. Theor. Phys. 34, 1283 (1995).

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue