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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative 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.
A method is proposed to generate sum-of-squares decompositions for fermionic Hamiltonians containing large density-density terms by modifying the perturbative choice of cubic operators.
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.
-
Improving Perturbation Theory with the Sum-of-squares II: Large Density-Density Terms
A method is proposed to generate sum-of-squares decompositions for fermionic Hamiltonians containing large density-density terms by modifying the perturbative choice of cubic operators.