Analysis of quantum functions

International Journal of Foundations of Computer Science

Volumn 14, Issue 5, 2003, Pages 815-852

  Yamakami, Tomoyuki ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

nonadaptive query; oracle separation; Quantum function; quantum Turing machine

Indexed keywords

EID: 35048815027     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103002047     Document Type: Article

References (50)

1. L. M. Adleman, J. DeMarrais, and M. A. Huang, "Quantum computability, " SIAMJ. Comput. 26 (1997) 1524-1540
2. J. L. Balcazar, J. Diaz, and J. Gabarro, Structural Complexity I&II (Springer, 1988(I) and 1990 (II))
3. P. Benioff, "The computer as a Physical system: A microscopic quantum mechanicalHamiltonian model of computers as represented by Turing machines, " J. Stat. Phys.22 (1980) 563-591
4. C. H. Bennett, "Logical reversibility of computation, " IBM J. Res. Develop. 17(1973) 525-532
5. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, "Strengths and weaknessesof quantum computing, " SIAM J. Comput. 26 (1997) 1510-1523
6. E. Bernstein and U. Vazirani, "Quantum complexity theory, " SIAM J. Comput. 26(1997) 1411-1473
7. A. Berthiaume and G. Brassard, "Oracle quantum computing, " J. Modern Optics41 (1994) 2521-2535
8. R. V. Book, T. J. Long, and A. L. Selman, "Quantitative relativizations of complexityclasses, " SIAM J. Comput. 13 (1984) 461-487
9. G. Brassard, P. H0yer, and A. Tapp, "Quantum counting" in Proc. 25th InternationalColloquium on Automata, Languages, and Programming, Lecture Notes inComputer Science, Vol.1443, 1998, pp.820-831
10. H. Buhrman and W. van Dam, "Quantum bounded query complexity, " in Proc.Hth Annual Conference on Computational Complexity, 1999, pp.149-157
11. D. Deutsch, "Quantum theory, the Church-Turing principle, and the universal quantumcomputer, " Proc. Roy. Soc. London Ser. A 400 (1985) 97-117
12. D. Deutsch, "Quantum computational networks, " Proc. R. Soc. London Ser. A425 (1989) 73-90
13. D. Deutsch and R. Jozsa, "Rapid solution of problems by quantum computation, "Proc. R. Soc. London Ser. A 439 (1992) 553-558
14. D. Du and K. Ko, Theory of Computational Complexity (John Wiley &Sons, Inc., 2000)
15. S. Fenner, L. Fortnow, S. Kurtz, and L. Li, "An oracle builder's toolkit, " in Proc.8th IEEE Conference on Structure in Complexity Theory, 1993, pp.120-131
16. S. Fenner, L. Fortnow, and S. Kurtz, "Gap-definable counting classes, " J. Comput.and System Sci. 48 (1994) 116-148
17. S. Fenner, F. Green, S. Homer, and R. Pruim, "Determining acceptance probabilityfor a quantum computation is hard for the polynomial hierarchy, Proc. R. Soc.London Ser.A 455 (1999) 3953-3966
18. R. Feynman, "Simulating Physics with computers, " Intern. J. Theoret. Phys. 21(1982) 467-488
19. L. Fortnow, "Counting Complexity, " in Complexity Theory Retrospective II, eds. L.Hemaspaandra and A. Selman (Springer, 1997)
20. L. Fortnow and J. Rogers, "Complexity limitations on quantum computation, " J.Comput. System Sci. 59 (1999) 240-252
21. M. H. Freedman, A. Kitaev, M. J. Larsen, and Z. Wang, "Topological quantumcomputation, " arXive quant-ph/0101025, 2001
22. F. Green and R. Pruim, "Relativized separation of EQP and PNP, " Inform. Process.Lett. 80 (2001) 257-260
23. L. Grover, "A fast quantum mechanical algorithm for database search, " in Proc.28th Annual Symposium on Theory of Computing, 1996, pp.212-219
24. L. A. Hemaspaandra and M. Ogihara, The Complexity Theory Companion, Springer, 2002
25. B. Jenner and J. Toran, "Computing functions with parallel queries to NP, " Theoret.Comput. Sci. 141 (1995) 175-193
26. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, "Random generation of combinatorialstructures from a uniform distribution, " Theoret. Comput. Sci. 43 (1986)169-188
27. A. Kitaev, "Quantum computations: algorithms and error correction, " RussianMath. Surveys 52 (1997) 1191-1249
28. A. Kitaev, "Quantum NP, " public talk at the 2nd Workshop on Algorithms in QuantumInformation Processing, DePaul University, 1999
29. A. Kitaev and J. Watrous, "Parallelization, amplification, and exponential timesimulation of quantum interactive proof system, " in Proc. 32nd Annual Symposiumon Theory of Computing, 2000, pp.608-617
30. E. Knill, "Quantum randomness and nondeterminism, " Technical Report LAUR-96-2186, Los Alamos National Laboratory, 1996. See arXive quant-ph/9610012
31. M. Krentel, "The complexity of optimization problems, " J. Comput. System Sci.36 (1988) 490-509
32. J. Kobler, U. Schoning, and J. Toran, "On counting and approximation, " Acta Inf.26 (1989) 363-379
33. H. Nishimura, "On quantum computation with some restricted amplitudes, " in Proc.19th Annual Symposium on Theoretical Aspect of Computer Science, Lecture Notesin Computer Science, Vol.2285, 2002, pp.311-322
34. H. Nishimura and M. Ozawa, "Computational complexity of uniform quantum circuitfamilies and quantum Turing machines, " Theoret. Comput. Sci. 276 (2002)147-181
35. M. Ogiwara and L. Hemachandra, "A complexity theory for feasible closure properties, "J. Comput. System Sci. 46 (1993) 295-325
36. M. Ozawa and H. Nishimura, "Local transition functions of quantum Turing machines, "RAIRO Theor. Inform. Appl. 34 (2000) 379-402
37. M. Ozawa, "Halting of quantum Turing machines, " in Proc. 3rd International Conferenceon Unconventional Models of Computation, Lecture Notes in Computer Science, Vol.2509, 2002, pp.58-65
38. A. L. Selman, X. Mei-Rui, and R. V. Book, "Positive relativizations of complexityclasses, " SIAM J. Comput. 12 (1983) 565-579
39. P. W. Shor, "Fault-tolerant quantum computation, " in Proc. 37th Annual Symposiumon Foundations of Computer Science, 1996, pp.56-65
40. P. W. Shor, "Polynomial-time algorithms for factorization and discrete logarithmson a quantum computer, " SIAM J. Comput. 26 (1997) 1484-1509
41. D. Simon, "On the power of quantum computation, " SIAM J. Comput. 26 (1997)1474-1483
42. L. Stockmeyer, "On approximation algorithms for # P , " SIAM J. Comput. 14(1985)849-861
43. K. B. Stolarsky, Algebraic numbers and Diophantine Approximations (MarcelDekker, 1974)
44. L. G. Valiant, "The complexity of computing the permanent, " Theoret. Comput.Sci. 8 (1979) 410-421
45. K. W. Wagner, "Bounded query classes, " SIAM J. Comput. 19 (1990) 833-846
46. J. Watrous, "PSPACE has constant-round quantum interactive proof systems, " inProc. 40th Annual Symposium on Foundations of Computer Science, 1999, pp.112-119
47. J. Watrous, "Succinct quantum proofs for properties of finite groups, " in Proc. 41stAnnual Symposium on Foundations of Computer Science, 2000, pp.537-546
48. T. Yamakami, "A foundation of programming a multi-tape quantum Turing machine, "in Proc. 24th International Symposium on Mathematical Foundations ofComputer Science, Lecture Notes in Computer Science, Vol.1672, 1999, pp.430-441
49. T. Yamakami and A. C. Yao, "NQPc=co-C=P, " Inform. Process. Lett. 71 (1999)63-69
50. A. C. Yao, "Quantum circuit complexity, " in Proc. 34th Annual Symposium onFoundation of Computer Science, 1993, pp.352-361.