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.
In Section II C 2, we describe how we may approx- imately enforce this constraint using O(n2) Pauli strings and a population-balancing unitary
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
-
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.