A logarithmic HUBO encoding with a lexicographic penalty solves minimum graph coloring and related partition-count problems using exponentially fewer qubits per vertex than one-hot encoding.
Qubit-efficient encoding schemes for binary optimisation problems
2 Pith papers cite this work, alongside 43 external citations. Polarity classification is still indexing.
2
Pith papers citing it
43
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2roles
background 1polarities
background 1representative citing papers
Pauli Correlation Encoding framework achieves competitive or superior solutions on QOPTLib benchmark instances for combinatorial optimization.
citing papers explorer
-
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization
A logarithmic HUBO encoding with a lexicographic penalty solves minimum graph coloring and related partition-count problems using exponentially fewer qubits per vertex than one-hot encoding.
-
Benchmark of Pauli Correlation Encoding for different optimisation problems
Pauli Correlation Encoding framework achieves competitive or superior solutions on QOPTLib benchmark instances for combinatorial optimization.