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

Quantum Information Processing

Towards Scalable Linear-Optical Quantum Computers

Jonathan P. Dowling, J. D. Franson, Hugo Kyo Lee, Gerard J Milburn

Published Oct 1, 2004• 12 citations
Publisher
DOI
10.1007/s11128-004-9419-1

Related papers

Towards Scalable Linear-Optical Quantum Computers

Jonathan P. Dowling, J. D. Franson, Hanho Lee +1 more

Springer eBooks•Apr 2, 2007•2 citations

Linear optical quantum memory

Jonathan P. Dowling, Hwang Lee, Farrokh Vatan +2 more

In quantum computing a very important problem is that of building a quantum memory. We show that by using new techniques from scalable linear optical quantum computing (LOQC), it is possible to make an all linear-optical quantum memory capable of storing the computational qubit indefinitely. The same approach can be used to make a simple quantum repeater. Recent work by our group has shown how linear optical quantum computing ideas, recently proposed by Knill, Laflamme, and Milburn, and also by Franson and co-workers, can be used to make a scalable quantum repeater [1]. However, this repeater still requires a quantum memory to operate, which apparently requires resources other than those required for linear optical quantum computing. In this presentation, we will explicitly show how to construct a quantum memory using only LOQC resources and employing a simple error correction code for photon loss. The result is a simple, scalable, quantum memory. The device can also be operated as a quantum repeater that is far simpler than our original proposal to implement.

Frontiers in Optics•Jan 1, 2003•0 citations

Towards realistic architectures for linear optical quantum computing

Sam Morley-Short

•Jan 1, 2019•0 citations

Towards Linear Optical Quantum Computers

Jonathan P. Dowling, J. D. Franson, Hwang Lee +1 more

Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite its ease of implementation of one-qubit gates. Two-qubit gates necessarily need a nonlinear interaction between the two photons, and the efficiency of this nonlinear interaction is typically very tiny in bulk materials. However, we recently have shown that this barrier can be circumvented with effective nonlinearities produced by projective measurements, and with this work linear-optical quantum computing becomes a new possibility of scalable quantum computation. We review several issues concerning its principles and requirements.

arXiv:quant-ph/0402090•Feb 13, 2004•0 citations

Scalable and Programmable Linear Optical Quantum Circuit in the Frequency Domain

Kazuki Takahashi

OPTICS & PHOTONICS International Congress•Mar 6, 2020•0 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
In quantum computing a very important problem is that of building a quantum memory. We show that by using new techniques from scalable linear optical quantum computing (LOQC), it is possible to make an all linear-optical quantum memory capable of storing the computational qubit indefinitely. The same approach can be used to make a simple quantum repeater. Recent work by our group has shown how linear optical quantum computing ideas, recently proposed by Knill, Laflamme, and Milburn, and also by Franson and co-workers, can be used to make a scalable quantum repeater [1]. However, this repeater still requires a quantum memory to operate, which apparently requires resources other than those required for linear optical quantum computing. In this presentation, we will explicitly show how to construct a quantum memory using only LOQC resources and employing a simple error correction code for photon loss. The result is a simple, scalable, quantum memory. The device can also be operated as a quantum repeater that is far simpler than our original proposal to implement.
Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite its ease of implementation of one-qubit gates. Two-qubit gates necessarily need a nonlinear interaction between the two photons, and the efficiency of this nonlinear interaction is typically very tiny in bulk materials. However, we recently have shown that this barrier can be circumvented with effective nonlinearities produced by projective measurements, and with this work linear-optical quantum computing becomes a new possibility of scalable quantum computation. We review several issues concerning its principles and requirements.
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.