Defines bosonic analogs of BQP and QMA, proves Gaussian dynamics equivalent to BQL, places expectation values in PSPACE, and shows stellar-rank-dependent complexity for bosonic energy minimization from NP-complete to undecidable.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bosonic Quantum Computational Complexity
Defines bosonic analogs of BQP and QMA, proves Gaussian dynamics equivalent to BQL, places expectation values in PSPACE, and shows stellar-rank-dependent complexity for bosonic energy minimization from NP-complete to undecidable.