A splitting-plus-linearization algorithm with random hardware-graph permutations matches large-neighborhood local search on QUBOs while avoiding minor embeddings, but its monotonicity guarantee only holds for damping values not used in experiments.
Synthesis Lectures on Quantum Computing5(2) (2014) 25
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Compensating connectivity restrictions in quantum annealers via splitting and linearization techniques
A splitting-plus-linearization algorithm with random hardware-graph permutations matches large-neighborhood local search on QUBOs while avoiding minor embeddings, but its monotonicity guarantee only holds for damping values not used in experiments.