Thresholds for Linear Optics Quantum Computing with Photon Loss at the Detectors
arXiv:quant-ph/0502101 · doi:10.1103/PhysRevA.72.032307
Abstract
We calculate the error threshold for the linear optics quantum computing proposal by Knill, Laflamme and Milburn [Nature 409, pp. 46--52 (2001)] under an error model where photon detectors have efficiency <100% but all other components -- such as single photon sources, beam splitters and phase shifters -- are perfect and introduce no errors. We make use of the fact that the error model induced by the lossy hardware is that of an erasure channel, i.e., the error locations are always known. Using a method based on a Markov chain description of the error correction procedure, our calculations show that, with the 7 qubit CSS quantum code, the gate error threshold for fault tolerant quantum computation is bounded below by a value between 1.78% and 11.5% depending on the construction of the entangling gates.
7 pages, 6 figures
Cited by in corpus (10)
- Review article: Linear optical quantum computing
- Photonic quantum information processing: a concise review
- How good must single photon sources and detectors be for efficient linear optical quantum computation?
- Loss tolerance in one-way quantum computation via counterfactual error correction
- Error Analysis For Encoding A Qubit In An Oscillator
- Experimental quantum coding against photon loss error
- Optical Quantum Computation
- Linear optical quantum computation with imperfect entangled photon-pair sources and inefficient non-photon-number-resolving detectors
- Optimizing quantum error correction protocols with erasure qubits
- Proposed Experiment in Two-Qubit Linear Optical Photonic Gates for Maximal Success Rates