Dresden 2026 – wissenschaftliches Programm
Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe
QI: Fachverband Quanteninformation
QI 1: Quantum Computing and Algorithms I
QI 1.2: Vortrag
Montag, 9. März 2026, 09:45–10:00, BEY/0137
The Complexity of Simulating Inertially Coupled Bosonic Hamiltonians — •Refik Mansuroglu1, Lilith Zschetzsche1, and Norbert Schuch1,2 — 1University of Vienna, Faculty of Physics, Boltzmanngasse 5, 1090 Vienna, Austria — 2University of Vienna, Faculty of Mathematics, Oskar-Morgenstern-Platz 1, 1090 Vienna, Austria
The computational complexity of simulating physically natural quantum systems is a central question at the interface of quantum physics and computer science. While recent work has established the BQP-completeness of simulating an exponential number of coupled classical oscillators [Babbush et al.], the complexity of more general bosonic dynamics has remained unresolved. Here we prove that simulating inertially coupled bosonic systems, a broad class that includes quantum harmonic oscillators as a special case, is BQP-complete. In the Hamiltonian framework, we consider the problem of deciding whether the expectation value of an R-local observable is polynomially separated from zero, given only polynomially many nonzero initial amplitudes qj(0) and pj(0). We show that the Hamiltonians governing continuous-time quantum walks can be expressed as inertially coupled bosonic systems, thereby unifying two paradigms of quantum dynamics within a single complexity-theoretic classification.
Keywords: Quantum Simulation; Bosonic Systems; Complexity Theory; Quantum Computing; Hamiltonian Simulation