Repository | Book | Chapter
(2011) Mathematical foundations of quantum information and computation and its applications to nano- and bio-systems, Dordrecht, Springer.
In this chapter we will consider a new approach to quantum computations. We shall discuss an algorithm introduced by Ohya and Volovich which can solve the NP-complete satisfiability (SAT) problem in polynomial time. The algorithm goes beyond the quantum Turing machine paradigm.
Publication details
DOI: 10.1007/978-94-007-0171-7_14
Full citation:
Ohya, M. , Volovich, I. (2011). Quantum algorithm iii, in Mathematical foundations of quantum information and computation and its applications to nano- and bio-systems, Dordrecht, Springer, pp. 369-395.
This document is unfortunately not available for download at the moment.