Classical Algorithms for Function Computation in Gaussian Boson Sampling

arXiv:2609.38882 · quant-ph · Submitted 2026-09-30 · Read on arXiv

quant-ph

Submitted: 2026-09-30

Updated: 2026-09-30

Terminology

• Accuracy — 9× in this paper · explained in 1 episode
• Benchmarking — 5× in this paper · explained in 3 episodes
• Anticoncentration — 3× in this paper · explained in 1 episode
• Entanglement — 2× in this paper · explained in 3 episodes
• Hilbert Space — 2× in this paper · explained in 2 episodes
• Angular Error — 1× in this paper · explained in 1 episode
• Core — 1× in this paper · explained in 2 episodes
• Homogeneity — 1× in this paper · explained in 2 episodes
• Non-Gaussianity — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes

Sources

• Proof of hiding conjecture in Gaussian boson sampling
• Boson sampling beyond the dilute regime: second moments and anti-concentration
• Classical simulation and model concentration in passive linear optics
• General framework for anticoncentration and linear cross-entropy benchmarking in photonic quantum advantage experiments
• Permanents in linear optical networks

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