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.
[Has22] Matthew B Hastings
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2024 2verdicts
UNVERDICTED 2representative citing papers
Product-State Lifting (PSL) upgrades any basis-state vQSDP to k-degree polynomial optimization via product-register encoding, with linear resource scaling and k-independent constraints.
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.
-
Elevating Variational Quantum Semidefinite Programs for Polynomial Objectives
Product-State Lifting (PSL) upgrades any basis-state vQSDP to k-degree polynomial optimization via product-register encoding, with linear resource scaling and k-independent constraints.