Computational complexity of uniform quantum circuit families and quantum Turing machines Communicated by O. Watanabe
Authors:
- 1 April 2002
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 276 (1-2) , 147-181
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- Quantum ComputabilitySIAM Journal on Computing, 1997
- Elementary gates for quantum computationPhysical Review A, 1995
- Oracle Quantum ComputingJournal of Modern Optics, 1994
- Primality Testing and Abelian Varieties Over Finite Fields1992
- Quantum computational networksProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1989
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985
- The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machinesJournal of Statistical Physics, 1980
- Logical Reversibility of ComputationIBM Journal of Research and Development, 1973