Polynomial time quantum computation with advice

Information Processing Letters

Volumn 90, Issue 4, 2004, Pages 195-204

  Nishimura, Harumichi ^a,b   Yamakami, Tomoyuki ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

^b TRENT UNIVERSITY   (Canada)

Author keywords

Advice function; Computational complexity; Quantum circuit

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; QUANTUM THEORY;

ADVICE FUNCTIONS; QUANTUM CIRCUIT;

DATA PROCESSING;

EID: 1842736923     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.02.005     Document Type: Article

References (25)

1. Adleman L. Two theorems on random polynomial time. Proc. 19th Symposium on Foundations of Computer Science. 1978;75-83.
2. Adleman L.M., DeMarrais J., Huang M.A. Quantum computability. SIAM J. Comput. 26:1997;1524-1540.
3. Ambainis A., Nayak A., Ta-shma A., Vazirani U. Dense quantum coding and quantum finite automata. J. ACM. 49:2002;496-511.
4. Balcázar J.L., Hermo M. The structure of logarithmic advice complexity classes. Theoret. Comput. Sci. 207:1998;217-244.
5. Balcázar J.L., Hermo M., Mayordomo E. Characterizations of logarithmic advice complexity classes. Proc. 12th IFIP World Computer Congress, vol. 1. 1992;315-321 North-Holland, Amsterdam.
6. Barenco A., Bennett C.H., Cleve R., DiVincenzo D.P., Margolus N., Shor P., Sleator T., Smolin J., Weinfurter H. Elementary gates for quantum computation. Phys. Rev. A. 52:1995;3457-3467.
7. Berman L., Hartmanis J. On isomorphisms and density of NP and other complexity classes. SIAM J. Comput. 6:1977;305-322.
8. Bernstein E., Vazirani U. Quantum complexity theory. SIAM J. Comput. 26:1997;1411-1473.
9. Buhrman H., Cleve R., Watrous J., de Wolf R. Quantum fingerprinting. Phys. Rev. Lett. 87:(16):2001;167902.
10. Deutsch D. Quantum theory, the Church-Turing principle, and the universal quantum computer. Proc. R. Soc. London Ser. A. 400:1985;97-117.
11. Deutsch D. Quantum computational networks. Proc. R. Soc. London Ser. A. 425:1989;73-90.
12. Du D., Ko K. Theory of Computational Complexity. 2000;Wiley, New York.
13. Even S., Yacobi Y. Cryptocomplexity and NP-completeness. Proc. 7th Colloquium on Automata, Languages, and Programming. Lecture Notes in Comput. Sci. vol. 85:1980;195-207.
14. Kannan R. Circuit-size lower bounds and non-reducibility to sparse sets. Inform. Control. 55:1982;40-56.
15. Karp R.M., Lipton R. Turing machines that take advice. Enseig. Math. 28:1982;191-209.
16. Kitaev A. Quantum computations: algorithms and error correction. Russian Math. Surveys. 52:1997;1191-1249.
17. Ko K. On helping by robust oracle machines. Theoret. Comput. Sci. 52:1987;15-36.
18. Nielsen M.A., Chuang I.L. Quantum Computation and Quantum Information. 2000;Cambridge Univ. Press, Cambridge.
19. Nishimura H., Ozawa M. Computational complexity of uniform quantum circuit families and quantum Turing machines. Theoret. Comput. Sci. 276:2002;147-187.
20. Ozawa M., Nishimura H. Local transition functions of quantum Turing machines. RAIRO Theor. Inform. Appl. 34:2000;379-402.
21. Savage S.E. Computational work and time on finite machines. J. ACM. 19:1972;660-674.
22. R. de Wolf, Quantum computing and communication complexity, PhD dissertation, University of Amsterdam, 2001.
23. Yamakami T. A foundation of programming a multi-tape quantum Turing machine. Proc. 24th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Comput. Sci. vol. 1672:1999;430-441 Springer, Berlin.
24. =P . Inform. Process. Lett. 71:1999;63-69.
25. Yao A.C. Quantum circuit complexity. Proc. 34th Annual IEEE Symposium on Foundations of Computer Science. 1993;352-361.