A quantum polynomial time algorithm in worst case for Simon's problem (Extended Abstract)

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

Volumn 1533 LNCS, Issue , 1998, Pages 229-236

  Mihara, Takashi ^a   Sung, Shao Chin ^b  

^a TOKAI UNIVERSITY   (Japan)

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

Author keywords

[No Author keywords available]

Indexed keywords

EXPECTED TIME; EXTENDED ABSTRACTS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; QUANTUM ALGORITHMS; QUANTUM TURING MACHINE; SIMON'S PROBLEM;

ALGORITHMS; MACHINERY; QUANTUM THEORY; TURING MACHINES;

POLYNOMIAL APPROXIMATION;

EID: 84867478914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. Bernstein, E., Vazirani, U. V.: Quantum complexity theory (Extended Abstract). In Proc. of the 25th ACM Symp. on Theory of Computing (1993) 11-20
2. Bernstein, E., Vazirani, U. V.: Quantum complexity theory. SIAM J. Comput. 26 (1997) 1411-1473
3. Brassard, G., Høyer, P.: On the power of exact quantum polynomial time. Manuscript (available as quant-ph/9612017 at http://xxx.lanl.gov) (1996)
4. Brassard, G., Høyer, P.: An exact quantum polynomial-time algorithm for Simon's problem. In Proc. Fifth Israeli Symposium on Theory of Computing and Systems (June 1997) 12-23
5. Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. In Proc. R. Soc. Lond. A400 (1985) 97-117
6. Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. In Proc. R. Soc. Lond. A 439 (1992) 553-558
7. Feynman, R. P.: Simulating Physics with Computers. Int. J. Theor. Phys. 21 (1982) 467-488
8. Grover, L. K.: A fast quantum mechanical algorithm for database search. In Proc. of the 28th ACM Symp. on Theory of Computing (1996) 212-219
9. van Lint, J.H.: Introduction to Coding Theory (Second Edition). Springer-Verlag (1991)
10. Shor, P. W.: Algorithms for quantum computation: discrete logarithms and factoring. In Proc. of the 35th Ann. Symp. on Foundations of Computer Science (1994) 124-134
11. Shor, P. W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26 (1997) 1484-1509
12. Simon, D. R.: On the power of quantum computation. In Proc. of the 35th Ann. Symp. on Foundations of Computer Science (1994) 116-123
13. Simon, D. R.: On the power of quantum computation. SIAM J. Comput. 26 (1997) 1474-1483