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

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.

Revtex, 14 pages and 1 table, 4 EPS figures

References in corpus (1)

• An NMR Analog of the Quantum Disentanglement Eraser

Cited by in corpus (12)

• Experimental Implementation of the Quantum Random-Walk Algorithm
• Quantum Computing with NMR
• Experimental implementation of an adiabatic quantum optimization algorithm
• Nuclear Magnetic Resonance Implementation of a Quantum Clock Synchronization Algorithm
• Iterative quantum state transfer along a chain of nuclear spin qubits
• Mixed state Pauli channel parameter estimation
• Quantum information processing by NMR using a 5-qubit system formed by dipolar coupled spins in an oriented molecule
• Controlling NMR spin systems for quantum computation
• Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance
• Solution to Satisfiability problem by a complete Grover search with trapped ions
• Quantum Mechanical Search and Harmonic Perturbation
• Quantum Algorithms of Bio-molecular Solutions for the Clique Problem on a Quantum Computer