Computational complexity of uniform quantum circuit families and quantum Turing machines

Theoretical Computer Science

Volumn 276, Issue 1-2, 2002, Pages 147-181

  Nishimura, Harumichi ^a   Ozawa, Masanao ^a  

^a NAGOYA UNIVERSITY   (Japan)

Author keywords

Complexity theory; Quantum computation; Quantum Turing machines; Uniform quantum circuit families; Universal quantum Turing machines

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SIMULATION; CONSTRAINT THEORY; ERROR ANALYSIS; MONTE CARLO METHODS; QUANTUM THEORY; TURING MACHINES;

QUANTUM CIRCUIT FAMILIES (QCF);

COMPUTATIONAL COMPLEXITY;

EID: 0037029307     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00111-6     Document Type: Article

References (24)

1. Quantum computability
2. Primality testing and two dimensional Abelian varieties over finite fields
3. Elementary gates for quantum computation
4. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
5. Logical reversibility of computation
6. Strengths and weaknesses of quantum computing
7. Quantum complexity theory (preliminary abstract)
8. Quantum complexity theory
9. Oracle quantum computing
10. Quantum theory, the Church-Turing principle and the universal quantum computer
11. Quantum computational networks
12. Rapid solution of problems by quantum computation
13. Shor's quantum algorithm for factoring numbers
14. Simulating physics with computers
15. Quantum computations: Algorithms and error correction
16. Computational complexity of real functions
17. Local transition functions of quantum Turing machines
18. Algorithms for quantum computations: Discrete log and factoring
19. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
20. On the power of quantum computation
21. A fast Monte-Carlo test for primality
22. Quantum circuit complexity