Optical quantum computing with photons of arbitrarily low fidelity and purity

Linear optics quantum computing (LOQC) is a leading candidate for the implementation of large scale quantum computers. Here quantum information is encoded into the quantum states of light and computation proceeds via a linear optics network. It is well known that in such schemes there are stringent requirements on the spatio-temporal structure of photons -- they must be completely indistinguishable and of very high purity. We show that in the Boson-sampling model for LOQC these conditions may be significantly relaxed. We present evidence that by increasing the size of the system we can implement a computationally hard algorithm even if our photons have arbitrarily low fidelity and purity. These relaxed conditions make Boson-sampling LOQC within reach of present-day technology.

[1]  A. Politi,et al.  Quantum Walks of Correlated Photons , 2010, Science.

[2]  Salvador Elías Venegas-Andraca,et al.  Quantum walks: a comprehensive review , 2012, Quantum Information Processing.

[3]  Christine Silberhorn,et al.  Spectral structure and decompositions of optical states, and their applications , 2006, quant-ph/0609004.

[4]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[5]  Akira Furusawa,et al.  Introduction to Optical Quantum Information Processing , 2011 .

[6]  H. Briegel,et al.  Measurement-based quantum computation on cluster states , 2003, quant-ph/0301052.

[7]  Timothy C. Ralph,et al.  Frequency and temporal effects in linear optical quantum computing , 2004, Physical Review A.

[8]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[9]  Timothy C. Ralph,et al.  Error models for mode mismatch in linear optics quantum computing , 2006 .

[10]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[11]  A. Schreiber,et al.  A 2D Quantum Walk Simulation of Two-Particle Dynamics , 2012, Science.

[12]  A Schreiber,et al.  Decoherence and disorder in quantum walks: from ballistic spread to localization. , 2011, Physical review letters.

[13]  Aharonov,et al.  Quantum random walks. , 1993, Physical review. A, Atomic, molecular, and optical physics.

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

[15]  Timothy C. Ralph,et al.  Error tolerance of the boson-sampling model for linear optics quantum computing , 2011, 1111.2426.

[16]  T.C. Ralph,et al.  Quantum gate characterization in an extended Hilbert space , 2005, 2005 Quantum Electronics and Laser Science Conference.

[17]  Timothy C. Ralph,et al.  Modelling photo-detectors in quantum optics , 2005, quant-ph/0511099.

[18]  Kae Nemoto,et al.  Efficient classical simulation of continuous variable quantum information processes. , 2002, Physical review letters.

[19]  Julia Kempe,et al.  Quantum random walks: An introductory overview , 2003, quant-ph/0303081.

[20]  Barry C Sanders,et al.  Efficient classical simulation of optical quantum information circuits. , 2002, Physical review letters.

[21]  A Schreiber,et al.  Photons walking the line: a quantum walk with adjustable coin operations. , 2009, Physical review letters.

[22]  Optimal photons for quantum-information processing , 2005, quant-ph/0505139.

[23]  A Aspuru-Guzik,et al.  Discrete single-photon quantum walks with tunable decoherence. , 2010, Physical review letters.