Skip to main content
SpringerLink
Log in

A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem

(Extended Abstract)

  • Conference paper
  • First Online:
Book cover Algorithms and Computation (ISAAC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1533))

Included in the following conference series:

Abstract

Simon showed a problem that can be solved in polynomial time on a quantum Turing machine but cannot be solved in polynomial time on any probabilistic Turing machine. However, his quantum algorithm is evaluated in expected time. In this paper, we show a polynomial time quantum algorithm in worst case for Simon’s problem. Brassard and Høyer also construct a polynomial time quantum algorithm in worst case for it. However, our algorithm is much simpler than their algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

    Google Scholar 

  2. Bernstein, E., Vazirani, U. V.: Quantum complexity theory. SIAM J. Comput. 26 (1997) 1411–1473

    Article  MATH  MathSciNet  Google Scholar 

  3. Brassard, G., Høyer, P.: On the power of exact quantum polynomial time. Manuscript (available as quant-ph/9612017 at http://www.xxx.lanl.gov

  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

    Google Scholar 

  5. Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. In Proc. R. Soc. Lond. A400 (1985) 97–117

    MathSciNet  Google Scholar 

  6. Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. In Proc. R. Soc. Lond. A 439 (1992) 553–558

    MathSciNet  Google Scholar 

  7. Feynman, R.P.: Simulating Physics with Computers. Int. J. Theor. Phys. 21 (1982) 467–488

    Article  MathSciNet  Google Scholar 

  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

    Google Scholar 

  9. van Lint, J. H.: Introduction to Coding Theory (Second Edition). Springer-Verlag (1991)

    Google Scholar 

  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

    Google Scholar 

  11. Shor, P. W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26 (1997) 1484–1509

    Article  MATH  MathSciNet  Google Scholar 

  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

    Google Scholar 

  13. Simon, D. R.: On the power of quantum computation. SIAM J. Comput. 26 (1997) 1474–1483

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Information Technology, Kyushu Tokai University, 9-1-1, Toroku, Kumamoto, 862-8652, Japan

    Takashi Mihara

  2. School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahidai Tatsunokuchi Nomi Ishikawa, 923-1292, Japan

    Shao Chin Sung

Authors
  1. Takashi Mihara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shao Chin Sung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusong-dong, Yusong-gu, Taejon, 305-701, Korea

    Kyung-Yong Chwa

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mihara, T., Sung, S.C. (1998). A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-49381-6_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65385-1

  • Online ISBN: 978-3-540-49381-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation