Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Utilizing Encoding in Scalable Linear Optics Quantum Computing

Anthony Hayes, Alexei Gilchrist, Casey R. Myers, Timothy C. Ralph

Published Jan 1, 2004• 20 citations
OpenAlex

Abstract

We present a scheme which offers a significant reduction in the resources required to implement linear optics quantum computing. The scheme is a variation of the proposal of Knill, Laflamme, and Milburn, and makes use of an incremental approach to the error encoding to boost probability of success.

Related papers

Utilizing encoding in scalable linear optics quantum computing

Anthony Hayes, Alexei Gilchrist, Casey R. Myers +1 more

We present a scheme which offers a significant reduction in the resources required to implement linear optics quantum computing. The scheme is a variation of the proposal of Knill, Laflamme and Milburn, and makes use of an incremental approach to the error encoding to boost probability of success.

arXiv:quant-ph/0408098•Journal of Optics B Quantum and Semiclassical Optics•Oct 23, 2004•29 citations

Efficient parity-encoded optical quantum computing

Alexei Gilchrist, Anthony Hayes, Timothy C. Ralph

We present a linear optics quantum computation scheme with a greatly reduced cost in resources compared to that proposed by Knill, Laflamme, and Milburn (KLM). The scheme makes use of elements from cluster state computation but retains the circuit based approach of KLM.

arXiv:quant-ph/0505125•Physical Review A•May 22, 2007•26 citations

Deterministic Linear Optics Quantum Computation with Single Photon Qubits

Nadav Yoran, Benni Reznik

We suggest an efficient scheme for quantum computation with linear optical elements, where the qubits are encoded in single photon states. The scheme reduces the resources required per logical gate by several orders of magnitude, compared to an earlier proposal of Knill, Laflamme, and Milburn, while the resource overhead per gate is independent of the length of the computation. A central feature of the scheme, enabling these improvements, is the prior construction of a "linked" photon state designed according to the particular quantum circuit one wishes to process. Once this state has been successfully prepared, the computation is pursued deterministically by a sequence of teleportation steps.

arXiv:quant-ph/0303008•Physical Review Letters•Jul 17, 2003•138 citations

Efficient linear optical quantum computation

Geoff J. Pryde, Jeremy L. O’Brien, T. B. Bell +4 more

We consider realizing the efficient linear optical quantum computing scheme of Knill, Laflamme and Milburn [Nature 409, 46 (2001)]. A number of the issues in implementing a coincidence-basis version of a CNOT gate are addressed experimentally, including source brightness and mode quality.

•Jan 1, 2003•4 citations

Linear optical quantum computing with photonic qubits

Pieter Kok, William J. Munro, Kae Nemoto +3 more

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 efficient scalable quantum computing with single photons, linear optical elements, and projective measurements is possible. Subsequently, several improvements on this protocol have started to bridge the gap between theoretical scalability and practical implementation. The original theory and its improvements are reviewed, and a few examples of experimental two-qubit gates are given. The use of realistic components, the errors they induce in the computation, and how these errors can be corrected is discussed.

arXiv:quant-ph/0512071•Reviews of Modern Physics•Jan 24, 2007•2,840 citations

Linear optical quantum computation with parity encoding

Alexei Gilchrist, Anthony Hayes, Timothy C. Ralph

We present a linear optics quantum computation scheme that employs an incremental parity encoding approach. The scheme uses techniques from cluster state computation and achieves comparable resource usage with increased tolerance to photon loss.

Quantum Electronics and Laser Science Conference•Dec 10, 2005•0 citations
We suggest an efficient scheme for quantum computation with linear optical elements, where the qubits are encoded in single photon states. The scheme reduces the resources required per logical gate by several orders of magnitude, compared to an earlier proposal of Knill, Laflamme, and Milburn, while the resource overhead per gate is independent of the length of the computation. A central feature of the scheme, enabling these improvements, is the prior construction of a "linked" photon state designed according to the particular quantum circuit one wishes to process. Once this state has been successfully prepared, the computation is pursued deterministically by a sequence of teleportation steps.
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 efficient scalable quantum computing with single photons, linear optical elements, and projective measurements is possible. Subsequently, several improvements on this protocol have started to bridge the gap between theoretical scalability and practical implementation. The original theory and its improvements are reviewed, and a few examples of experimental two-qubit gates are given. The use of realistic components, the errors they induce in the computation, and how these errors can be corrected is discussed.