Deterministic polynomial-time quantum algorithms for Simon's problem

Computational Complexity

Volumn 12, Issue 3-4, 2003, Pages 162-175

  Mihara, Takashi ^a   Sung, Shao Chin ^b  

^a TOKAI UNIVERSITY   (Japan)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Deterministic quantum algorithm; Extended Simon's problem; Quantum computer; Simon's problem

Indexed keywords

EID: 4744346465     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-003-0181-z     Document Type: Article

References (12)

1. A. BARENCO, C. H. BENNETT, R. CLEVE, D. P. DIVINCENZO, N. MARGOLUS, P. SHOR, T. SLEATOR, J. SMOLIN & H. WEINFURTER (1995). Elementary gates for quantum computation. Phys. Rev. A 52, 3457-3467.
2. E. BERNSTEIN & U. V. VAZIRANI (1997). Quantum complexity theory. SIAM J. Comput. 26, 1411-1473.
3. G. BRASSARD & P. HØYER (1996). On the power of exact quantum polynomial time, e-print quant-ph/9612017. (Available from http://xxx.lanl.gov).
4. G. BRASSARD & P. HØYER (1997). An exact quantum polynomial-time algorithm for Simon's problem. In Proc. 5th Israeli Symposium on Theory of Computing and Systems, 12-23.
5. D. DEUTSCH (1985). Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London Ser. A 400, 97-117.
6. D. DEUTSCH & R. JOZSA (1992). Rapid solution of problems by quantum computation. Proc. Roy. Soc. London Ser. A 439, 553-558.
7. R. P. FEYNMAN (1982). Simulating physics with computers. Internat. J. Theoret. Physics 21, 467-488.
8. L. K. GROVER (1996). A fast quantum mechanical algorithm for database search. In Proc. 28th Annual Symposium on the Theory of Computing (Philadelphia, PA), 212-219.
9. J. H. VAN LINT (1991). Introduction to Coding Theory. 2nd ed., Springer, Berlin.
10. T. MIHARA & S. C. SUNG (1998). A quantum polynomial time algorithm in worst case for Simon's problem. In Proc. 9th Annual International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 1533, Springer, 229-236.
11. P.W. SHOR (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484-1509.
12. D. R. SIMON (1997). On the power of quantum computation. SIAM J. Comput. 26, 1474-1483.