Quantum information processing with fiber optics: Quantum Fourier transform of 1024 qubits

Among a number of candidates, photons have advantages for implementing qubits: very weak coupling to the environment, the existing single photon measurement technique, and so on. Moreover, commercially available fiber-optic devices enable us to construct quantum circuits that consist of one-qubit operations (including classically controlled gates). Fiber optics resolves the mode matching problems in conventional optics and provides mechanically stable optical circuits. A quantum Fourier transform (QFT) followed by measurement was demonstrated with a simple circuit based on fiber optics. The circuit was shown to be robust against imperfections in the rotation gate. The error probability was estimated to be 0.01 per qubit, which corresponded to error-free operation for 100 qubits. The error probability can be further reduced to achieve successful QFT of 1024 qubits by taking the majority of the accumulated results. As is well known, QFT is a key function in quantum computations such as the final part of Shor’s factorization algorithm. The present QFT circuit, in combination with controlled unitary gates, would make possible practical quantum computers. Possible schemes of realizing quantum computers in this line are explored.

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

[2]  E. Knill,et al.  A scheme for efficient quantum computation with linear optics , 2001, Nature.

[3]  Kiyoshi Ishikawa,et al.  Quantum nondemolition measurement of spin via the paramagnetic Faraday rotation , 1999 .

[4]  Akihisa Tomita,et al.  Balanced, gated-mode photon detector for quantum-bit discrimination at 1550 nm. , 2002, Optics letters.

[5]  M B Plenio,et al.  Efficient factorization with a single pure qubit and logN mixed qubits. , 2000, Physical review letters.

[6]  Chuang Quantum algorithm for distributed clock synchronization , 2000, Physical review letters.

[7]  Lov K. Grover Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[8]  John Preskill,et al.  Quantum information and precision measurement , 1999, quant-ph/9904021.

[9]  N. P. Bigelow,et al.  Atomic quantum non-demolition measurements and squeezing , 1998 .

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

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

[12]  M. Lukin,et al.  Storage of light in atomic vapor. , 2000, Physical Review Letters.

[13]  S. Lloyd,et al.  Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors , 1998, quant-ph/9807070.

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

[15]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[16]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[17]  Stéphane Beauregard Circuit for Shor's algorithm using 2n+3 qubits , 2003, Quantum Inf. Comput..