Depth dependence of entanglement and circuit complexity in random linear optical networks

arXiv:2604.14277 · quant-ph, math-ph, math.MP, math.PR · Submitted 2026-04-15 · Read on arXiv

quant-ph, math-ph, math.MP, math.PR

Submitted: 2026-04-15

Updated: 2026-10-20

Terminology

• Entanglement — 5× in this paper · explained in 4 episodes
• Circuit Depth — 2× in this paper · explained in 2 episodes
• Fidelity — 1× in this paper · explained in 2 episodes
• Wasserstein Distance — 1× in this paper · explained in 5 episodes

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
• Incoherent Imaging with Spatially Structured Quantum Probes
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources