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.
Synthesis Lectures on Quantum Computing
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
dataset 1
method 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Q-SFD, a QUBO formulation for simultaneous fragment docking with an added inter-fragment distance term, approximately doubles top-1 recovery of reconstruction-feasible pose pairs and places at least one feasible pair in the top-5 for over 90% of benchmark cases without losing pose accuracy.
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.
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.
-
Simultaneous Fragment Docking for Geometrically Linkable Pose Pairs
Q-SFD, a QUBO formulation for simultaneous fragment docking with an added inter-fragment distance term, approximately doubles top-1 recovery of reconstruction-feasible pose pairs and places at least one feasible pair in the top-5 for over 90% of benchmark cases without losing pose accuracy.
-
A Hybrid Classical-Quantum Annealing Algorithm for the TSP
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.