Study on discrete adiabatic quantum computation in 3-SAT problems

Authors:
Mohamed El-Fiky;Satoshi Ono;Shigeru Nakayama
Affiliations:
Department of Information Science and Biomedical Engineering, Faculty of Engineering, Kagoshima University, Kagoshima, Japan 890-0065;Department of Information Science and Biomedical Engineering, Faculty of Engineering, Kagoshima University, Kagoshima, Japan 890-0065;Department of Information Science and Biomedical Engineering, Faculty of Engineering, Kagoshima University, Kagoshima, Japan 890-0065
Venue:
Artificial Life and Robotics
Year:
2011

Citing 3
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

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.