Measured Quantum Fourier Transform of 1024 Qubits on Fiber Optics

Abstract

Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation gate. Error probability was estimated to be 0.01 per qubit, which corresponded to error-free operation on 100 qubits. The error probability can be further reduced by taking the majority of the accumulated results. The reduction of error probability resulted in a successful QFT demonstration on 1024 qubits.

15 pages, 6 figures, submitted to EQIS 2003 Special issue, Int. J. Quantum Information

References in corpus (11)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Storage of light in atomic vapor
• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Quantum Algorithms Revisited
• Reliable Quantum Computers
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Semiclassical Fourier Transform for Quantum Computation
• Approximate Quantum Fourier Transform and Decoherence
• Quantum algorithm for distributed clock synchronization
• Efficient factorization with a single pure qubit and $logN$ mixed qubits
• A balanced gated-mode photon detector for qubit discrimination in 1550 nm

Cited by in corpus (2)

• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Quantum measurement of a mesoscopic spin ensemble