Efficient implementations of the Quantum Fourier Transform: an experimental perspective

Abstract

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.

References in corpus (6)

• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• An all silicon quantum computer
• Sub-Riemannian Geometry and Time Optimal Control of Three Spin Systems: Quantum Gates and Coherence Transfer
• Design of Strongly Modulating Pulses to Implement Precise Effective Hamiltonians for Quantum Information Processing
• Analysis of Density Matrix reconstruction in NMR Quantum Computing
• Modified Grover's algorithm for an expectation value quantum computer

Cited by in corpus (3)

• Impact of qubit connectivity on quantum algorithm performance
• Versatile microwave-driven trapped ion spin system for quantum information processing
• Simultaneous Dense Coding