Quantum computation and NP-complete problems
In this paper, we show that the Deutsch's universal quantum Turing machine can solve any NP-complete problem in polynomial time under a physical assumption that we can observe the existence of a specific physical state in a given superposition of physical states. This result establishes an interesting relationship between quantum physics and computational complexity theory.
Unable to display preview. Download preview PDF.
- Y. Aharonov, J. Anandan and L. Vaidman, “Meaning of the Wave Function”, Phys. Rev., A 47, pp. 4616–4626, 1993.Google Scholar
- C. H. Bennett, “Logical Reversibility of Computation”, IBM J. Res. Dev., 17, pp. 525–532, 1973.Google Scholar
- P. A. Benioff, “Quantum Mechanical Hamiltonian Models of Discrete Processes That Erase Their Own Histories: Application to Turing Machines”, Int. J. Theor. Phys., 21, pp. 177–201, 1982.Google Scholar
- E. Bernstein and U. Vazirani, “Quantum Complexity Theory”, Proc. of 25th ACM Symposium on Theory of Computing, pp. 11–20, 1993.Google Scholar
- A. Berthiaume and G. Brassard, “The Quantum Challenge to Structural Complexity Theory”, Proc. of 7th IEEE Conference on Structure in Complexity Theory, pp. 132–137, 1992.Google Scholar
- D. Deutsch, “Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer”, Proc. R. Soc. Lond., A 400, pp. 97–117, 1985.Google Scholar
- D. Deutsch and R. Jozsa “Rapid Solution of Problems by Quantum Computation”, Proc. R. Soc. Lond., A 439, pp. 553–558, 1992.Google Scholar
- R. Jozsa, “Characterizing Classes of Functions Computable by Quantum Parallelism”, Proc. R. Soc. Lond., A 435, pp. 563–574, 1991.Google Scholar
- S. Lloyd, “A Potentially Realizable Quantum Computer”, SCIENCE, 261, pp. 1569–1571, 1993.Google Scholar