Year: 1999
Type: article
Abstract: In 1985, D. Deutsch introduced quantum Turing machines (QTMs for short) as Turing machines which can perform so called quantum parallel computations. Then, in 1994, P. Shor showed that QTM can factor integers with arbitrary small error probability in polynomial time. The quantum complexity theory is the computational complexity theory based on QTMs. In this paper, we first review the definitions of the QTM and major quantum complexity classes EQP, BQP, ZQP, etc. Then, we present the known results and major open questions in this field.
Author: Tetsuro Nishino
Language: Chinese
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1491538598