Experimental Realization of Brüschweiler's exponentially fast search algorithm in a homo-nuclear system

Abstract

Compared with classical search algorithms, Grover quantum algorithm [ Phys. Rev. Lett., 79, 325(1997)] achieves quadratic speedup and Bruschweiler hybrid quantum algorithm [Phys. Rev. Lett., 85, 4815(2000)] achieves an exponential speedup. In this paper, we report the experimental realization of the Bruschweiler$ algorithm in a 3-qubit NMR ensemble system. The pulse sequences are used for the algorithms and the measurement method used here is improved on that used by Bruschweiler, namely, instead of quantitatively measuring the spin projection of the ancilla bit, we utilize the shape of the ancilla bit spectrum. By simply judging the downwardness or upwardness of the corresponding peaks in an ancilla bit spectrum, the bit value of the marked state can be read out, especially, the geometric nature of this read-out can make the results more robust against errors.

10 pages and 3 figures

Cited by in corpus (7)

• Quantum Computing with NMR
• Parallel Quantum Computing in a Single Ensemble Quantum Computer
• Experimental realization of a fetching algorithm in a 7 qubit NMR quantum computer
• Controlling NMR spin systems for quantum computation
• Experimentally obtaining the Likeness of Two Unknown Quantum States on an NMR Quantum Information Processor
• Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm
• Ensemble Algorithm for the Selection Problem by NMR Ensemble Quantum Computers