The simulability frontiers of photonic quantum computing
quant-ph
Submitted: 2026-11-09
Updated: 2026-11-09
Code: https://github.com/Quandela/photonic-engines
Terminology
Sources
- The Classical Complexity of Boson Sampling
- Faster classical Boson Sampling
- No imminent quantum supremacy by boson sampling
- How many qubits are needed for quantum computational supremacy?
- Classical simulation of linear optics subject to nonuniform losses
- Simulability of Imperfect Gaussian and Superposition Boson Sampling
- Marginal probabilities in boson samplers with arbitrary input states
- Simulating boson sampling in lossy architectures
- Quantum machine learning with adaptive linear optics
- Classical algorithms for measurement-adaptive Gaussian circuits
- Classical algorithms for estimating expectation values in linear-optical circuits
- Towards quantum advantage with photonic state injection
- Photonic Quantum Convolutional Neural Networks with Adaptive State Injection
- Non-linear Boson Sampling
- Quadratic speedup for simulating Gaussian boson sampling
- Exact simulation of Gaussian Boson Sampling in polynomial space and exponential time
- A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
- The Boundary for Quantum Advantage in Gaussian Boson Sampling
- On the sampling complexity of coherent superpositions
- How to simulate quantum measurement without computing marginals
Related papers
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements
- Barriers to dequantization of near-term molecular electronic structure methods
- BRIDGE: Lazy-Move Compilation for Dual-Species Neutral-Atom Quantum Computers