Skip to main content
SpringerLink
Log in

Study on discrete adiabatic quantum computation in 3-SAT problems

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

The quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state with a slowly varying Hamiltonian to reach the required output state. This article proposes a new variation on the method for the phase functions of the adiabatic quantum algorithm, the quadric variation method. Experiments were carried out to solve the 3-SAT problem with the discrete adiabatic quantum algorithm to compare the performance of the proposed formulation of the quadric variation method with the previously proposed linear and cubic methods.

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

Access this article

Log in via an institution

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

References

  1. Shor P (1997) Polynomial-time algorithms for prime factorization on a quantum computer. SIAM J Comput 26

  2. Grover L (1996) Fast quantum mechanical algorithm for database search. ACM Symposium on Theory of Computing, ACM Press, New York, pp 212–219

    Google Scholar 

  3. Hogg T (2004) Adiabatic quantum computing for random satisfiability problems. quant-ph/0206059

  4. Farhi E, Goldstone J, Gutmann S, et al (2000) Quantum computation by adiabatic evolution. quant-ph/0001106

  5. Farhi E (2001) A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292:472–476

    Article  MathSciNet  Google Scholar 

  6. Smelyanskiy VN, Timucin DA (2002) Simulations of the adiabatic quantum optimization for the set partition problem. Los Alamos preprint quant-ph/0112143

  7. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. Freeman, San Francisco

    MATH  Google Scholar 

  8. Kirkpatrick S, Selman B (1994) Critical behavior in the satisfiability of random Boolean expressions. Science 264:1297–1301

    Article  MathSciNet  Google Scholar 

  9. Das S, Kobes R, Kunstatter G (2003) Energy and efficiency of adiabatic quantum search algorithms. quant-ph/0204044v4; Phys Rev A 57

  10. van Dam W, Mosca M, Vazirani U (2002) How powerful is adiabatic quantum computation? quant-ph/0206003 v1

Download references

Author information

Authors and Affiliations

  1. Department of Information Science and Biomedical Engineering, Faculty of Engineering, Kagoshima University, 1-21-40, Korimoto, Kagoshima, 890-0065, Japan

    Mohamed El-fiky, Satoshi Ono & Shigeru Nakayama

Authors
  1. Mohamed El-fiky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Satoshi Ono
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shigeru Nakayama
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shigeru Nakayama.

Additional information

This work was presented in part at the 16th International Symposium on Artificial Life and Robotics, Oita, Japan, January 27–29, 2011

About this article

Cite this article

El-fiky, M., Ono, S. & Nakayama, S. Study on discrete adiabatic quantum computation in 3-SAT problems. Artif Life Robotics 16, 107–111 (2011). https://doi.org/10.1007/s10015-011-0900-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-011-0900-5

Key words

Search

Navigation