Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0811.2905 v1 pith:HZJHJPTG submitted 2008-11-18 quant-ph

W. L. Yang , H. Wei , F. Zhou , W. L. Chang , M. Feng This is my paper · ORCID
classification quant-ph
keywords searchstategroverquantumtargetcircuitscompleteoracle
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools