On quantum computation with some restricted amplitudes

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

Volumn 2285, Issue , 2002, Pages 311-322

  Nishimura, Harumichi ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; MACHINERY; POLYNOMIAL APPROXIMATION; QUANTUM COMPUTERS;

BOUNDED ERRORS; EXACT ALGORITHMS; FACTORING PROBLEM; POLYNOMIAL-TIME; QUANTUM TURING MACHINE; ZERO ERROR ALGORITHM;

TURING MACHINES;

EID: 84892723515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_25     Document Type: Conference Paper

References (29)

1. L. M. Adleman, J. DeMarrais, and M. A. Huang: Quantum computability. SIAM J. Comput. 26 (1997) 1524–1540.
2. L. Adleman and M. Huang: Recognizing primes in random polynomial time. in Proc. of 19th ACM Symposium on Theory of Computing, ACM (1987) 462–470.
3. A. Berthiaume and G. Brassard: Oracle quantum computing. J. Modern Opt. 41 (1994) 2521–2535.
4. A. Barenco, C. H. Bennett, R. Cleve, D. DiVicenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin and H. Weinfurter: Elementary gates for quantum computation. Phys. Rev. A, 52 (1995) 3457–3467.
5. E. Bernstein and U. Vazirani: Quantum complexity theory (Preliminary abstract). in Proc. of 25th ACM Symposium on Theory of Computing, ACM (1993) 11–20.
6. E. Bernstein and U. Vazirani: Quantum complexity theory. SIAM J. Comput. 26 (1997) 1411–1473.
7. G. Brassard and P. Høyer: An exact quantum polynomial-time algorithm for Simon’s problem. in Proc. of 5th Israeli Symposium on Theory of Computing and Systems, IEEE (1997) 12–23.
8. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26 (1997) 1510–1523.
9. D. Deutsch: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London Ser. A, 400 (1985) 96–117.
10. 10. D. Deutsch: Quantum computational networks. Proc. Roy. Soc. London Ser. A, 425 (1989) 73–90.
11. D. Deutsch and R. Jozsa: Rapid solution of problems by quantum computation. Proc. Roy. Soc. London Ser. A, 439 (1992) 553–558.
12. S. Fenner, F. Green, S. Homer and R. Pruim: Determining acceptance probability for a quantum computation is hard for PH. in Proc. 6th Italian Conference on Theoretical Computer Science, World-Scientific (1998) 241–252
13. L. Fortnow and J. Rogers: Complexity limitations on quantum computation. in Proc. 13th Conference on Computational Complexity, IEEE (1998) 202–209.
14. Ker-I. Ko and H. Friedman: Computational complexity of real functions. Theoret. Comput. Sci. 20 (1982) 323–352.
15. A. Kitaev: Quantum computations: algorithms and error correction. Russian Math. Surveys 52 (1997) 1191-1249.
16. M. A. Nielsen and I. L. Chuang: Quantum Computation and Quantum Information, Cambridge (2000).
17. H. Nishimura and M. Ozawa: Computational complexity of uniform quantum circuit families and quantum Turing machines. Theoret. Comput. Sci. (to appear). Also quant-ph/9906095
18. M. Ozawa: Quantum nondemolition monitoring of universal quantum computers. Phys. Rev. Lett. 80 (1998) 631–634.
19. M. Ozawa and H. Nishimura: Local transition functions of quantum Turing machines. RAIRO Theoret. Informatics Appl. 34 (2000) 379-402.
20. C. H. Papadimitriou: Computational Complexity, Addison-Wesley (1994).
21. J. Preskill: Reliable quantum computers. Proc. Roy. Soc. London ser A, 454 (1998) 385–410.
22. D. Simon: On the power of quantum computation. in Proc. 35th IEEE Symposium on Foundations of Computer Science, IEEE (1994) 116–123; SIAM J. Comput. 26 (1997) 1474–1483.
23. P. W. Shor: Algorithms for quantum computations: Discrete log and factoring. in Proc. 35th IEEE Symposium on Foundations of Computer Science, IEEE (1994) 124–134.; Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26 (1997) 1484-1509.
24. P. W. Shor: Fault-tolerant quantum computation. in Proc. 37th IEEE Symposium on Foundations of Computer Science, IEEE (1996) 56–65.
25. U. V. Vazirani and V. V. Vazirani: Random polynomial time equals semi-random polynomial time. in Proc. 26th IEEE Symposium on Foundations of Computer Science, IEEE (1985) 417–428.
26. K. Wagner: The complexity of combinatorial problems with succinct input representation. Acta Inf. 23 (1986) 325–361.
27. T. Yamakami: A foundation of programming a multi-tape quantum Turing machine. in Proc. 24th International Symposium on Mathmatical Foundations of Computer Science, Lecture Notes in Comput. Sci. 1672 (1999) 430–441.
28. T. Yamakami and A. Yao: NQPC = co-C=P. Inform. Process. Lett. 71 (1999) 63–69.
29. A. Yao: Quantum circuit complexity. in Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, IEEE (1993) 352–361.