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

Nature

A scheme for efficient quantum computation with linear optics

E. Knill, Raymond Laflamme, Gerard J Milburn

Published Jan 1, 2001• 5,927 citations
Publisher
DOI
10.1038/35051009

Related papers

Efficient linear optical quantum computation

AG White, TB Bell, NK Langford +4 more

•Jun 1, 2002•0 citations

Efficient linear optics quantum computation

Gerard J Milburn, Timothy C. Ralph, Alexei Gilchrist +3 more

•Jan 1, 2003•0 citations

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

Michael Varnava, Dan E. Browne, Terry Rudolph

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.

arXiv:quant-ph/0702044•Physical Review Letters•Feb 12, 2008•255 citations

Quantum Computation with Linear Optics

Christoph Adami, Nicolas J. Cerf

Lecture notes in computer science•Jan 1, 1999•30 citations

Quantum Computation Using Linear Optics

Nobuyuki Matsuda

電子情報通信学会誌•Mar 1, 2020•0 citations

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
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.