pith. sign in

arxiv: quant-ph/0108068 · v1 · submitted 2001-08-14 · 🪐 quant-ph

Experimental Implementation of Hogg's Algorithm on a Three-Quantum-bit NMR Quantum Computer

classification 🪐 quant-ph
keywords algorithmhoggproblemquantumthree-qubitaveragingbestclassical
0
0 comments X
read the original abstract

Using nuclear magnetic resonance (NMR) techniques with three-qubit sample, we have experimentally implemented the highly structured algorithm for the 1-SAT problem proposed by Hogg. A simplified temporal averaging procedure was employed to the three-qubit spin pseudo-pure state. The algorithm was completed with only a single evaluation of structure of the problem and the solutions were found with probability 100%, which outperform both unstructured quantum and the best classical search algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.