REVIEW 3 cited by
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Review article: Linear optical quantum computing
read the original abstract
Linear optics with photon counting is a prominent candidate for practical quantum computing. The protocol by Knill, Laflamme, and Milburn [Nature 409, 46 (2001)] 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. We review the original theory and its improvements, and we give a few examples of experimental two-qubit gates. We discuss the use of realistic components, the errors they induce in the computation, and how these errors can be corrected.
Forward citations
Cited by 3 Pith papers
-
Renormalization Treatment of IR and UV Cutoffs in Waveguide QED and Implications to Numerical Model Simulation
Derives explicit non-perturbative renormalization relations between bare parameters and physical observables in waveguide QED to handle IR and UV cutoffs in simulations.
-
The limits of erasure-based postselection for quantum error mitigation
Postselection on erasure qubits fully mitigates erasure noise in QFT for erasure-check error rates below 3% and enables dual-rail systems to exceed noise floors unreachable by single-rail at kiloquop scale.
-
Handbook of Error-Correcting Codes
The paper compiles a curated handbook reference of error-correcting codes, their symbol-based classifications, and interrelations with mathematical objects and physical phases.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.