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

arXiv:quant-ph/0610025 · Physical Review Letters

Knill-Laflamme-Milburn Linear Optics Quantum Computation as a Measurement-Based Computation

Sandu Popescu

Published Dec 17, 2007• 16 citations
arXivHTMLPDF

Abstract

We show that the Knill Lafllame Milburn method of quantum computation with linear optics gates can be interpreted as a one-way, measurement-based quantum computation of the type introduced by Briegel and Raussendorf. We also show that the permanent state of n n-dimensional systems is a universal state for quantum computation.
DOI
10.1103/physrevlett.99.250501

Related papers

A simple gate for linear optics quantum computing

Terry Rudolph, Jian-Wei Pan

We describe a simple scheme for implementing the non-linear sign gate of Knill, Laflamme and Milburn (Nature, {\bf 409}, 46-52, Jan. 4 (2001)) which forms the basis of an experiment underway at the University of Vienna.

arXiv:quant-ph/0108056•Aug 11, 2001•5 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

Experimental Implementation of Efficient Linear Optics Quantum Computation

Gerard J Milburn, Timothy C. Ralph, Andrew G. White

One of the earliest proposals for implementing quantum computation was based on encoding each qubit in two optical modes, each containing exactly one photon. However, it is extremely difficult to unitarily couple two optical modes containing few photons. In 2001, Knill, Laflamme, and Milburn (KLM) found a way to circumvent this restriction and implement efficient quantum computation using only passive linear optics, photodetectors, and single photon sources. This efficient linear optical quantum computing (LOQC) is distinct from other linear optical schemes that are not efficiently scalable. The technological requirements for even the simplest gates in the KLM proposal initially seemed out of reach. However, Ralph, White, Munro and Milburn soon showed that, in principle, demonstrations of key gates and techniques could be achieved with current technology. The objective of the research undertaken in this project was to produce, in three years, a prototype two-qubit gate for photons using the KLM linear optics quantum computation approach, and to develop a blue-print for a multiple qubit device that might be implemented over a longer time scale. A non-deterministic two-qubit gate was demonstrated that operates with high fidelity. A number of key tasks were demonstrated using this gate, and several theoretical investigations of short, medium, and longer term issues for the LOQC approach were successfully completed.

•Nov 25, 2004•0 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 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
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.
One of the earliest proposals for implementing quantum computation was based on encoding each qubit in two optical modes, each containing exactly one photon. However, it is extremely difficult to unitarily couple two optical modes containing few photons. In 2001, Knill, Laflamme, and Milburn (KLM) found a way to circumvent this restriction and implement efficient quantum computation using only passive linear optics, photodetectors, and single photon sources. This efficient linear optical quantum computing (LOQC) is distinct from other linear optical schemes that are not efficiently scalable. The technological requirements for even the simplest gates in the KLM proposal initially seemed out of reach. However, Ralph, White, Munro and Milburn soon showed that, in principle, demonstrations of key gates and techniques could be achieved with current technology. The objective of the research undertaken in this project was to produce, in three years, a prototype two-qubit gate for photons using the KLM linear optics quantum computation approach, and to develop a blue-print for a multiple qubit device that might be implemented over a longer time scale. A non-deterministic two-qubit gate was demonstrated that operates with high fidelity. A number of key tasks were demonstrated using this gate, and several theoretical investigations of short, medium, and longer term issues for the LOQC approach were successfully completed.
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.