Logarithmic-depth quantum simulation of boson sampling
quant-ph
Submitted: 2026-09-16
Updated: 2026-09-16
Terminology
Sources
- The Computational Complexity of Linear Optics
- Gaussian Boson Sampling
- Quantum computational advantage using photons
- The Classical Complexity of Boson Sampling
- Faster classical Boson Sampling
- No imminent quantum supremacy by boson sampling
- On classical simulation algorithms for noisy Boson Sampling
- Classical algorithm for simulating experimental Gaussian boson sampling
- Classical simulation of boson sampling based on graph structure
- Efficient Linear Optics Quantum Computation
- Resource-efficient digital quantum simulation of $d$-level systems for photonic, vibrational, and spin-$s$ Hamiltonians
- Provably accurate simulation of gauge theories and bosonic systems
- Some Notes on Parallel Quantum Computation
- Parallel Quantum Computation and Quantum Codes
- Quantum Circuits with Unbounded Fan-out
- Quantum Carry-Save Arithmetic
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Optimal ancilla-free Clifford+T approximation of z-rotations
- Computational Complexity of Uniform Quantum Circuit Families and Quantum Turing Machines
- A new quantum ripple-carry addition circuit
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
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity