Efficient implementations of the Quantum Fourier Transform: an experimental perspective

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits $n$. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.

[1]  R. Jozsa.  Quantum algorithms and the Fourier transform , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[2]  Timothy F. Havel,et al.  Generalized methods for the development of quantum logic gates for an NMR quantum information processor , 1999 .

[3]  Griffiths,et al.  Semiclassical Fourier transform for quantum computation. , 1995, Physical review letters.

[4]  M. S. Zubairy,et al.  Cavity QED implementation of the discrete quantum Fourier transform , 2002 .

[5]  N. B. Freeman.  An implementation of the Deutsch-Jozsa algorithm on a three-qubit NMR quantum computer , 1998, quant-ph/9808039.

[6]  E Knill,et al.  Efficient refocusing of one-spin and two-spin interactions for NMR quantum computation. , 1999, Journal of magnetic resonance.

[7]  Timothy F. Havel,et al.  NMR Based Quantum Information Processing: Achievements and Prospects , 2000, quant-ph/0004104.

[8]  L M Vandersypen,et al.  Experimental realization of an order-finding algorithm with an NMR quantum computer. , 2000, Physical review letters.

[9]  Barenco,et al.  Approximate quantum Fourier transform and decoherence. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[10]  E. Knill,et al.  EFFECTIVE PURE STATES FOR BULK QUANTUM COMPUTATION , 1997, quant-ph/9706053.

[11]  G. Long,et al.  Analysis of density matrix reconstruction in NMR quantum computing , 2000, quant-ph/0012047.

[12]  I. Chuang,et al.  Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance , 2001, Nature.

[13]  John M. Myers,et al.  Rapid solution of problems by nuclear-magnetic-resonance quantum computation , 2001 .

[14]  J. A. Jones,et al.  NMR Quantum Computation: A Critical Evaluation , 2000, quant-ph/0002085.

[15]  Y Yamamoto,et al.  All-silicon quantum computer. , 2002, Physical review letters.

[16]  Timothy F. Havel,et al.  Ensemble quantum computing by NMR spectroscopy , 1997, Proc. Natl. Acad. Sci. USA.

[17]  B. E. Kane.  Silicon‐Based Quantum Computation , 2000, quant-ph/0003031.

[18]  N. Gershenfeld,et al.  Bulk Spin-Resonance Quantum Computation , 1997, Science.

[19]  Timothy F. Havel,et al.  Design of strongly modulating pulses to implement precise effective Hamiltonians for quantum information processing , 2002, quant-ph/0202065.

[20]  D. Leung,et al.  Bulk quantum computation with nuclear magnetic resonance: theory and experiment , 1998, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[21]  Daniel R. Simon.  On the Power of Quantum Computation , 1997, SIAM J. Comput..

[22]  Dieter Suter,et al.  Scalable architecture for spin-based quantum computers with a single type of gate , 2002 .

[23]  David C. Collins.  Modified Grover's algorithm for an expectation-value quantum computer , 2001, quant-ph/0111108.

[24]  Rebing Wu,et al.  Explicitly solvable extremals of time optimal control for 2-level quantum systems , 2002 .

[25]  R. Cleve,et al.  Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[26]  J. H. Wu,et al.  Implementing universal multiqubit quantum logic gates in three- and four-spin systems at room temperature , 2001 .

[27]  E M Fortunato,et al.  Implementation of the quantum Fourier transform. , 2001, Physical review letters.

[28]  Navin Khaneja,et al.  Sub-Riemannian geometry and time optimal control of three spin systems: Quantum gates and coherence transfer , 2002 .

[29]  Experimental realization of discrete fourier transformation on NMR quantum computers , 1999, quant-ph/9905083.