Skip to main content

Advertisement

Springer Nature Link
Log in

Optimality of partial adiabatic search and its circuit model

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In this paper, we first uncover a fact that a partial adiabatic quantum search with \(O(\sqrt{N/M})\) time complexity is in fact optimal, in which \(N\) is the total number of elements in an unstructured database, and \(M\)(\(M\ge 1\)) of them are the marked ones(one) \((N\gg M)\). We then discuss how to implement a partial adiabatic search algorithm on the quantum circuit model. From the implementing procedure on the circuit model, we can find out that the approximating steps needed are always in the same order of the time complexity of the adiabatic algorithm.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., Preda, D.: A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292, 472–475 (2001)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  2. Reichardt B.W.: The quantum adiabatic optimization algorithm and local minima. Proceedings of the 36th Annual ACM Symposium on Theory of Computing(STOC’04), pp. 502–510. (2004)

  3. Altshuler B., Krovi H., Roland J.: Adiabatic quantum optimization fails for random instances of NP-complete problems. arXiv:quant-ph/0908.2782. (2009)

  4. Dickson, N.G., Amin, M.H.S.: Does adiabatic quantum optimization fail for NP-complete problems? Phys. Rev. Lett. 106, 050502 (2009)

    Article  Google Scholar 

  5. Choi, V.: Different adiabatic quantum optimization algorithms for the NP-complete exact cover problem. Proc. Natl. Acad. Sci. USA 108, E19–E20 (2011)

    Article  ADS  Google Scholar 

  6. Das, S., Kobes, R., Kunstatter, G.: Adiabatic quantum computation and Deutsch’s algorithm. Phys. Rev. A 65, 062310 (2002)

    Article  MathSciNet  ADS  Google Scholar 

  7. Rao, M.V.P.: Solving a hidden subgroup problem using the adiabatic quantum-computing paradigm. Phys. Rev. A 67, 052306 (2003)

    Article  ADS  Google Scholar 

  8. Peng, X., Liao, Z., Xu, N., Qin, G., Zhou, X., Suter, D., Du, J.: Quantum adiabatic algorithm for factorization and its experimental implementation. Phys. Rev. Lett. 101, 220405 (2008)

    Article  ADS  Google Scholar 

  9. Aharonov, D., Dam, W.V., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM J. Comput. 37(1), 166–194 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mizel, A., Lidar, D.A., Mitchell, M.: Simple proof of equivalence between adiabatic quantum computation and the circuit model. Phys. Rev. Lett. 99, 070502 (2007)

    Article  ADS  Google Scholar 

  11. Childs, A.M., Farhi, E., Preskill, J.: Robustness of adiabatic quantum computation. Phys. Rev. A 63, 012322 (2001)

    Article  Google Scholar 

  12. Sarandy, M.S., Lidar, D.A.: Adiabatic quantum computation in open systems. Phys. Rev. Lett. 95, 250503 (2005)

    Article  ADS  Google Scholar 

  13. Amin, M.H.S., Love, P.J., Truncik, C.J.S.: Thermally assisted adiabatic quantum computation. Phys. Rev. Lett. 100, 060503 (2008)

    Article  ADS  Google Scholar 

  14. Lidar, D.A.: Towards fault tolerant adiabatic quantum computation. Phys. Rev. Lett. 100, 160506 (2008)

    Article  ADS  Google Scholar 

  15. Messiah, A.: Quantum Mechanics. Chap. XVII. Dover, New York (1999)

    Google Scholar 

  16. Roland, J., Cerf, N.J.: Quantum search by local adiabatic evolution. Phys. Rev. A 65, 042308 (2002)

    Article  ADS  Google Scholar 

  17. Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett 79, 325–328 (1997)

    Article  ADS  Google Scholar 

  18. Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106. (2000)

  19. Tulsi, A.: Adiabatic quantum computation with a one-dimensional projector Hamiltonian. Phys. Rev. A 80, 052328 (2009)

    Article  ADS  Google Scholar 

  20. Jonckheere, E.A., Rezakhani, A.T., Ahmad, F.: Differential topology of adiabatically controlled quantum processes. Quantum Inf. Process. 12, 1515–1538 (2013)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  21. Jonckheere, E.A., Ahmad, F., Gutkin, E.: Differential topology of numerical range. Linear Algebra Appl. 279, 227–254 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  22. Sun, J., Lu, S., Liu, F.: Partial adiabatic quantum search algorithm and its extensions. Quantum Inf. Process. 12(8), 2689–2699 (2013)

    Article  MathSciNet  ADS  MATH  Google Scholar 

  23. Sun, J., Lu, S., Liu, F., Yang, L.: Partial evolution based local adiabatic quantum search. Chin. Phys. B 21, 010306 (2012)

    Article  ADS  Google Scholar 

  24. Zhang, Y., Hu, H., Lu, S.: A quantum search algorithm based on partial adiabatic evolution. Chin. Phys. B 20, 040309 (2011)

    Article  ADS  Google Scholar 

  25. Dam, W.V., Mosca, M., Vazirani, U.: How powerful is adiabatic quantum computation? Proceedings of the 42th Annual Symposium Foundations of Computer Science(FOCS’01), pp. 279–287. (2001)

  26. Roland, J., Cerf, N.J.: Quantum-circuit model of Hamiltonian search algorithms. Phys. Rev. A 68, 062311 (2003)

    Article  ADS  Google Scholar 

  27. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

Download references

Acknowledgments

We gratefully acknowledge the support of the National Natural Science Foundation of China under Grant No. 61173050. The second author also gratefully acknowledge the support of the China Postdoctoral Science Foundation under Grant No 2014M552041.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan , 430074, China

    Ying Mei, Jie Sun & Songfeng Lu

  2. Department of Information Technology, Vaasa University of Applied Sciences, Wolffintie 30, 65200 , Vaasa, Finland

    Chao Gao

Authors
  1. Ying Mei
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jie Sun
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Songfeng Lu
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Chao Gao
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Songfeng Lu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mei, Y., Sun, J., Lu, S. et al. Optimality of partial adiabatic search and its circuit model. Quantum Inf Process 13, 1751–1763 (2014). https://doi.org/10.1007/s11128-014-0770-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-014-0770-6

Keywords