Mitigating photon loss in linear optical quantum circuits
quant-ph
Submitted: 2024-05-03
Updated: 2026-03-11
Comments: 31 + 30 pages
Journal ref: Quantum 10, 2030 (2026)
DOI: 10.22331/q-2026-03-16-2030
Code: https://github.com/Quandela/Perceval
License: http://creativecommons.org/licenses/by/4.0/
The gist: Photon loss rates set an effective upper limit on the size of computations that can be run on current linear optical quantum devices.
Terminology
Abstract
Photon loss rates set an effective upper limit on the size of computations that can be run on current linear optical quantum devices. We present a family of techniques designed to mitigate the effects of photon loss on both output probabilities and expectation values derived from noisy linear optical circuits composed of an input of n photons, an m-mode interferometer, and m single photon detectors. Central to these techniques is the construction recycled probabilities. Recycled probabilities are constructed from output statistics affected by loss, and are designed to amplify the signal of the ideal (lossless) probabilities. Classical postprocessing techniques then take recycled probabilities as input and output a set of loss-mitigated probabilities, or expectation values. Our postprocessing methods result in biased estimators of the lossless probabilities. Nevertheless, we provide both analytical and numerical evidence that these methods can be applied, up to large sample sizes, to produce output probabilities with lower combined bias and statistical errors than the statistical errors of the output probabilities obtained from postselection. Therefore, these methods can outperform postselection - currently the standard method of coping with photon loss when sampling from discrete variable linear optical quantum circuits. In contrast, we provide evidence that the popular zero-noise extrapolation technique cannot improve on the performance of postselection for any photon loss rate.
Sources
- Classical simulability of noisy boson sampling
- Leveraging hardware-control imperfections for error mitigation via generalized quantum subspace
- Development and Demonstration of an Efficient Readout Error Mitigation Technique for use in NISQ Algorithms
- Simplifying errors by symmetry and randomisation
- Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
- Permanent of random matrices from representation theory: moments, numerics, concentration, and comments on hardness of boson-sampling
- Generalizing and Derandomizing Gurvits's Approximation Algorithm for the Permanent
- A central limit theorem for m-dependent variables
- Efficient approximation of experimental Gaussian boson sampling
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians