Complexity of Quadratic Bosonic Hamiltonian Simulation: BQP-Completeness and PostBQP-Hardness

arXiv:2603.26561 · quant-ph, cs.CC · Submitted 2026-03-27 · Read on arXiv

quant-ph, cs.CC

Submitted: 2026-03-27

Updated: 2026-09-24

Terminology

• BQP — 30× in this paper · explained in 2 episodes
• BQP-complete — 14× in this paper · explained in 2 episodes
• BQP-Completeness — 7× in this paper · explained in 2 episodes
• Hilbert Space — 3× in this paper · explained in 2 episodes
• Unitary Dynamics — 3× in this paper · explained in 2 episodes
• Quantum Circuits — 2× in this paper · explained in 2 episodes
• Quantum Physics — 2× in this paper · explained in 10 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Adjacency Matrix — 1× in this paper · explained in 1 episode
• Effective Hamiltonian — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Post-Selection — 1× in this paper · explained in 2 episodes
• Quantization — 1× in this paper · explained in 12 episodes
• Redundancy — 1× in this paper · explained in 2 episodes

Sources

• Shadow Hamiltonian Simulation
• A simple quantum algorithm to efficiently prepare sparse states
• Direct Equivalence between Dynamics of Quantum Walks and Coupled Classical Oscillators
• Quantum Computing, Postselection, and Probabilistic Polynomial-Time

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