Solution to Satisfiability problem by a complete Grover search with trapped ions

TL;DR

This paper presents a quantum circuit design for solving SAT problems using a complete Grover search implemented with trapped ion technology, combining amplitude amplification and Oracle functions.

Contribution

It introduces a novel quantum circuit approach for SAT solving that integrates the full Grover search process with trapped ion quantum computers.

Findings

Design of quantum circuits for complete Grover search

Feasibility of implementing the circuits with ion-trap technology

Potential for solving SAT problems using quantum search

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.