Analysis of quantum functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1738, Issue , 1999, Pages 407-419

  Yamakami, Tomoyuki ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM COMPUTERS; QUANTUM THEORY; SOFTWARE ENGINEERING;

COMPUTABLE FUNCTIONS; HEIDELBERG; QUANTUM FUNCTIONS; QUANTUM GAP; QUANTUM MECHANICAL COMPUTATIONS; QUANTUM PROBABILITIES; REJECTION PROBABILITY;

PROBABILITY;

EID: 84944252775     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46691-6_33     Document Type: Conference Paper

References (16)

1. L. M. Adleman, J. DeMarrais, and M. A. Huang, Quantum computability, SIAM J. Comput., 26 (1997), 1524-1540.
2. P. Benioff, The computer as a Physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, J. Stat. Phys., 22 (1980), 563-591.
3. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput., 26 (1997), 1510-1523.
4. E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM J. Comput., 26 (1997), 1411-1473.
5. G. Brassard, P. Høyer, and A. Tapp, Quantum counting, Proc. 25th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 1443, pp. 820-831, 1998.
6. D. Deutsch, Quantum theory, the Church-Turing principle, and the universal quantum computer, Proc. Roy. Soc. London, A, 400 (1985), 97-117.
7. S. Fenner, L. Fortnow, S. Kurtz, and L. Li, An oracle builder’s toolkit, Proc. 8th IEEE Conference on Structure in Complexity Theory, pp. 120-131, 1993.
8. S. Fenner, L. Fortnow, and S. Kurtz, Gap-definable counting classes, J. Comput. and System Sci., 48 (1994), 116-148.
9. S. Fenner, F. Green, S. Homer, and R. Pruim, Determining acceptance possibility for a quantum computation is hard for PH, Proc. 6th Italian Conference on Theoretical Computer Science, World-Scientific, Singapore, 1 pp. 241-252, 1998.
10. R. Feynman, Simulating Physics with computers, Intern. J. Theoret. Phys., 21 (1982), 467-488.
11. L. Fortnow and J. Rogers, Complexity limitations on quantum computation, Proc. 13th IEEE Conference on Computational Complexity, pp. 202-209, 1998.
12. L. Grover, A fast quantum mechanical algorithm for database search, Proc. 28th ACM Symposium on Theory of Computing, pp. 212-219, 1996.
13. L. G. Valiant, The complexity of computing the permanent, Theor. Comput. Sci., 8 (1979), 410-421.
14. T. Yamakami, A foundation of programming a multi-tape quantum Turing machine, Proc. 24th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 1672, pp. 430-441, 1999. See also LANL quant-ph/9906084.
15. T. Yamakami and A. C. Yao, NQPc=co-C= P, to appear in Inform. Process. Lett. See also LANL quant-ph/9812032, 1998.
16. A. C. Yao, Quantum circuit complexity, Proc. 34th IEEE Symposium on Foundation of Computer Science, pp. 352-361, 1993.