A pre-computation method sets penalization weights for constrained QUBO problems with provable guarantees for Gibbs solvers and polynomial scaling for many problem classes.
Alleviating the quantum Big-M problem , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
PCE framework matches or exceeds QOPTLib benchmark solutions on tested optimization problems while analyzing compression, noise, and post-processing effects.
citing papers explorer
-
Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers
A pre-computation method sets penalization weights for constrained QUBO problems with provable guarantees for Gibbs solvers and polynomial scaling for many problem classes.
-
Benchmark of Pauli Correlation Encoding for different optimisation problems
PCE framework matches or exceeds QOPTLib benchmark solutions on tested optimization problems while analyzing compression, noise, and post-processing effects.