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/0702044 · Physical Review Letters

How Good Must Single Photon Sources and Detectors Be for Efficient Linear Optical Quantum Computation?

Michael Varnava, Dan E. Browne, Terry Rudolph

Published Feb 12, 2008• 247 citations
arXivHTMLPDF

Abstract

We present a scheme for linear optical quantum computation that is highly robust to imperfect single photon sources and inefficient detectors. In particular we show that if the product of the detector efficiency with the source efficiency is greater than 2/3, then efficient linear optical quantum computation is possible. This high threshold is achieved within the cluster state paradigm for quantum computation.

DOI
10.1103/physrevlett.100.060502

Related papers

Linear optical quantum computation with imperfect entangled photon-pair sources and inefficient non–photon-number-resolving detectors

Yan-Xiao Gong, Xu‐Bo Zou, Timothy C. Ralph +2 more

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 detectors. The efficiency threshold for loss tolerance in our scheme requires the product of source and detector efficiencies should be $>1/2$, the best known figure. This figure applies to uncorrelated loss. We further find that the loss threshold is unaffected by correlated loss in the photon pair source. Our approach sheds new light on efficient linear optical quantum computation with imperfect experimental conditions.

arXiv:1005.1126•Physical Review A•May 6, 2010•14 citations

Optical Quantum Computing

Jeremy L. O’Brien

In 2001, all-optical quantum computing became feasible with the discovery that scalable quantum computing is possible using only single-photon sources, linear optical elements, and single-photon detectors. Although it was in principle scalable, the massive resource overhead made the scheme practically daunting. However, several simplifications were followed by proof-of-principle demonstrations, and recent approaches based on cluster states or error encoding have dramatically reduced this worrying resource overhead, making an all-optical architecture a serious contender for the ultimate goal of a large-scale quantum computer. Key challenges will be the realization of high-efficiency sources of indistinguishable single photons, low-loss, scalable optical circuits, high-efficiency single-photon detectors, and low-loss interfacing of these components.

arXiv:0803.1554•Science•Dec 6, 2007•1,217 citations

Efficient Linear Optics Quantum Computation

Emanuel H. Knill, Raymond Laflamme, Gerard J Milburn

We investigate the computational power of passive and active linear optical elements and photo-detectors. We show that single photon sources, passive linear optics and photo-detectors are sufficient for implementing reliable quantum algorithms. Feedback from the detectors to the optical elements is required for this implementation. Without feedback, non-deterministic quantum computation is possible. A single photon source sufficient for quantum computation can be built with an active linear optical element (squeezer) and a photo-detector. The overheads associated with using only linear optics appear to be sufficiently low to make quantum computation based on our proposal a viable alternative.

arXiv:quant-ph/0006088•Jun 20, 2000•28 citations

Quantum computation using linear optics

Gerard J Milburn

Summary form only given. Quantum computers are expected to increase the efficiency of solving problems such as factoring large integers. However an experimental implementation of even relatively simple quantum information processing with a few to a dozen qubits presents an enormous technological challenge. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing due to the ease with which photon interference can be observed. However these early proposals required huge single photon optical nonlinearities. Unfortunately currently available optical nonlinearities are too weak and too noisy to be useful. Recently however we have discovered that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photodetectors. Our methods exploit feed forward from photo-detectors and are robust against errors from photon loss and detector inefficiency. In this tutorial I will outline this scheme, highlighting the technical challenges required to implement it. The tutorial will be relatively self contained with a brief introduction to quantum optics and quantum computation.

Quantum Electronics and Laser Science Conference•Jun 25, 2003•0 citations

A Single Photon Source With Linear Optics and Squeezed States

Casey R. Myers, Marie Ericsson, Raymond Laflamme

Quantum information processing using photons has recently been stimulated by the suggestion to use linear optics, single photon sources and detectors. The recent work by Knill has also shown that errors in photon detectors leads to a high error rate threshold (around 29%). An important missing element are good single photon sources. In this paper we show how to make a single photon source using squeezed states, linear optics and conditional measurement. We use degenerate squeezed vacuum states, in contrast to the normal non-degenerate squeezed vacuum states used for single photon production. We show that we can get a photon with certainty when detectors click appropriately, the last event happening up to around 25% of the time. We also show the robustness of this method with respect to a variety of potential imperfections.

arXiv:quant-ph/0408194•Aug 31, 2004•2 citations

Resource-Efficient Linear Optical Quantum Computation

Dan E. Browne, Terry Rudolph

We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a simpler implementation than previous proposals. We follow the "cluster state" measurement based quantum computational approach, and show how cluster states may be efficiently generated from pairs of maximally polarization entangled photons using linear optical elements. We demonstrate the universality and usefulness of generic parity measurements, as well as introducing the use of redundant encoding of qubits to enable utilization of destructive measurements--both features of use in a more general context.

arXiv:quant-ph/0405157•Physical Review Letters•Jun 27, 2005•790 citations
We present a scheme for linear optical quantum computation that is highly robust to imperfect single photon sources and inefficient detectors. In particular we show that if the product of the detector efficiency with the source efficiency is greater than 2/3, then efficient linear optical quantum computation is possible. This high threshold is achieved within the cluster state paradigm for quantum computation.
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 detectors. The efficiency threshold for loss tolerance in our scheme requires the product of source and detector efficiencies should be >1/2>1/2>1/2, the best known figure. This figure applies to uncorrelated loss. We further find that the loss threshold is unaffected by correlated loss in the photon pair source. Our approach sheds new light on efficient linear optical quantum computation with imperfect experimental conditions.
In 2001, all-optical quantum computing became feasible with the discovery that scalable quantum computing is possible using only single-photon sources, linear optical elements, and single-photon detectors. Although it was in principle scalable, the massive resource overhead made the scheme practically daunting. However, several simplifications were followed by proof-of-principle demonstrations, and recent approaches based on cluster states or error encoding have dramatically reduced this worrying resource overhead, making an all-optical architecture a serious contender for the ultimate goal of a large-scale quantum computer. Key challenges will be the realization of high-efficiency sources of indistinguishable single photons, low-loss, scalable optical circuits, high-efficiency single-photon detectors, and low-loss interfacing of these components.
We investigate the computational power of passive and active linear optical elements and photo-detectors. We show that single photon sources, passive linear optics and photo-detectors are sufficient for implementing reliable quantum algorithms. Feedback from the detectors to the optical elements is required for this implementation. Without feedback, non-deterministic quantum computation is possible. A single photon source sufficient for quantum computation can be built with an active linear optical element (squeezer) and a photo-detector. The overheads associated with using only linear optics appear to be sufficiently low to make quantum computation based on our proposal a viable alternative.
Summary form only given. Quantum computers are expected to increase the efficiency of solving problems such as factoring large integers. However an experimental implementation of even relatively simple quantum information processing with a few to a dozen qubits presents an enormous technological challenge. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing due to the ease with which photon interference can be observed. However these early proposals required huge single photon optical nonlinearities. Unfortunately currently available optical nonlinearities are too weak and too noisy to be useful. Recently however we have discovered that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photodetectors. Our methods exploit feed forward from photo-detectors and are robust against errors from photon loss and detector inefficiency. In this tutorial I will outline this scheme, highlighting the technical challenges required to implement it. The tutorial will be relatively self contained with a brief introduction to quantum optics and quantum computation.
Quantum information processing using photons has recently been stimulated by the suggestion to use linear optics, single photon sources and detectors. The recent work by Knill has also shown that errors in photon detectors leads to a high error rate threshold (around 29%). An important missing element are good single photon sources. In this paper we show how to make a single photon source using squeezed states, linear optics and conditional measurement. We use degenerate squeezed vacuum states, in contrast to the normal non-degenerate squeezed vacuum states used for single photon production. We show that we can get a photon with certainty when detectors click appropriately, the last event happening up to around 25% of the time. We also show the robustness of this method with respect to a variety of potential imperfections.
We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a simpler implementation than previous proposals. We follow the "cluster state" measurement based quantum computational approach, and show how cluster states may be efficiently generated from pairs of maximally polarization entangled photons using linear optical elements. We demonstrate the universality and usefulness of generic parity measurements, as well as introducing the use of redundant encoding of qubits to enable utilization of destructive measurements--both features of use in a more general context.