A variational quantum algorithm carries out r-local search on a neighborhood of size l using only ceil(log2 l) qubits, with numerical demonstrations on MaxCut-512 and a 191-vertex graph coloring problem.
Qubit-efficient encoding schemes for binary optimisation problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
contradiction 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
contradiction 1polarities
contest 1representative citing papers
citing papers explorer
-
Qubit-efficient quantum local search for combinatorial optimization
A variational quantum algorithm carries out r-local search on a neighborhood of size l using only ceil(log2 l) qubits, with numerical demonstrations on MaxCut-512 and a 191-vertex graph coloring problem.