Solution to Satisfiability problem by a complete Grover search with trapped ions
Quantum Physics
2015-05-13 v1
Abstract
The main idea in the original Grover search (Phys. Rev. Lett. 79, 325 (1997)) is to single out a target state containing the solution to a search problem by amplifying the amplitude of the state, following the Oracle's job, i.e., a black box giving us information about the target state. We design quantum circuits to accomplish a complete Grover search involving both the Oracle's job and the amplification of the target state, which are employed to solve Satisfiability (SAT) problems. We explore how to carry out the quantum circuits by currently available ion-trap quantum computing technology.
Keywords
Cite
@article{arxiv.0811.2905,
title = {Solution to Satisfiability problem by a complete Grover search with trapped ions},
author = {W. L. Yang and H. Wei and F. Zhou and W. L. Chang and M. Feng},
journal= {arXiv preprint arXiv:0811.2905},
year = {2015}
}
Comments
14 pages, 6 figures