Noise thresholds for optical quantum computers.

@article{Dawson2006NoiseTF,
  title={Noise thresholds for optical quantum computers.},
  author={Christopher M. Dawson and Henry L. Haselgrove and Michael A. Nielsen},
  journal={Physical review letters},
  year={2006},
  volume={96 2},
  pages={
          020501
        }
}
In this Letter we numerically investigate the fault-tolerant threshold for optical cluster-state quantum computing. We allow both photon loss noise and depolarizing noise (as a general proxy for all local noise), and obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible for photon loss probabilities <3 x 10(-3), and for depolarization probabilities <10(-4). 

Figures from this paper

Quantum optical systems for the implementation of quantum information processing
We review the field of quantum optical information from elementary considerations to quantum computation schemes. We illustrate our discussion with descriptions of experimental demonstrations of key
Loss Tolerance in Topological Quantum Codes
TLDR
This work shows that topological FTQC schemes, which are known to have high error thresholds, are also extremely robust against losses, and demonstrates that these schemes tolerate loss rates up to 24.9%, determined by bond percolation on a cubic lattice.
One-way quantum computing in the optical frequency comb.
TLDR
This work proposes a scalable method that uses a single, multimode optical parametric oscillator (OPO) and generates a continuous-variable cluster state, universal for quantum computation, with quantum information encoded in the quadratures of the optical frequency comb of the OPO.
Loss tolerant linear optical quantum memory by measurement-based quantum computing
We give a scheme for loss tolerantly building a linear optical quantum memory which itself is tolerant to qubit loss. We use the encoding recently introduced in Varnava et al 2006 Phys. Rev. Lett. 97
Linear optical quantum computation with imperfect entangled photon-pair sources and inefficient non-photon-number-resolving detectors
We propose a scheme for efficient cluster state quantum computation by using imperfect polarization-entangled photon-pair sources, linear optical elements, and inefficient non-photon-number-resolving
Linear optical quantum computing with photonic qubits
Linear optics with photon counting is a prominent candidate for practical quantum computing. The protocol by Knill, Laflamme, and Milburn [2001, Nature (London) 409, 46] explicitly demonstrates that
Using Graph States for Quantum Computation and Communication
TLDR
A method to achieve fault tolerant measurement based quantum computation in two and three dimensions and a family of entanglement purification protocols that provide a flexible trade-off between overhead, threshold and output quality are described and analyzed.
Photons as qubits
We review the physical principles behind measurement-based quantum information processing with optical fields. The original Knill–Laflamme–Milburn (KLM) scheme, based on single-photon states, is
Optical zeno gate: bounds for fault tolerant operation
In principle the Zeno effect controlled-sign gate of Franson et al (2004 Phys. Rev. A 70 062302) is a deterministic two-qubit optical gate. However, when realistic values of photon loss are
Universal quantum computation with continuous-variable cluster states.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear
...
...

References

SHOWING 1-10 OF 15 REFERENCES
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Nature (London) 409
  • 46
  • 2001
Phys
  • Rev. A 68, 042322
  • 2003
Phys
  • Rev. Lett. 95, 010501
  • 2005
Phys
  • Rev. A 68, 032316
  • 2003
Phys
  • Rev. Lett. 92, 017902
  • 2004
Phys
  • Rev. Lett. 91, 037903
  • 2003
Phys
  • Rev. A 72, 012319
  • 2005
Phys
  • Rev. A 71, 042323
  • 2005
Phys
  • Rev. Lett. 93, 040503
  • 2004
...
...