A new qubit-efficient HUBO encoding for graph partitioning problems like minimum coloring uses logarithmic bits and a lexicographic penalty to cut resources while providing provable optimality conditions.
Understanding domain-wall encoding theoretically and experimentally
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Truncated-binary encoding approximates high-cardinality CFN problems as low-degree HUBO Hamiltonians with an L^∞ error bound, conditions preserving the global minimum, and a smoothness-based criterion for choosing the cutoff.
The authors integrate quantum annealing and QAOA as subroutines for pricing and separation in a branch-price-and-cut algorithm for vehicle routing problems.
citing papers explorer
-
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization
A new qubit-efficient HUBO encoding for graph partitioning problems like minimum coloring uses logarithmic bits and a lexicographic penalty to cut resources while providing provable optimality conditions.
-
Truncated-Binary Encoding: Spectral Degree Reduction of Combinatorial Optimization Problems for Quantum Hardware
Truncated-binary encoding approximates high-cardinality CFN problems as low-degree HUBO Hamiltonians with an L^∞ error bound, conditions preserving the global minimum, and a smoothness-based criterion for choosing the cutoff.
-
Quantum Subroutines in Branch-Price-and-Cut for Vehicle Routing
The authors integrate quantum annealing and QAOA as subroutines for pricing and separation in a branch-price-and-cut algorithm for vehicle routing problems.