Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call