REVIEW 32 cited by
A Tutorial on Formulating and Using QUBO Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The Quadratic Unconstrained Binary Optimization (QUBO) model has gained prominence in recent years with the discovery that it unifies a rich variety of combinatorial optimization problems. By its association with the Ising problem in physics, the QUBO model has emerged as an underpinning of the quantum computing area known as quantum annealing and has become a subject of study in neuromorphic computing. Through these connections, QUBO models lie at the heart of experimentation carried out with quantum computers developed by D-Wave Systems and neuromorphic computers developed by IBM. Computational experience is being amassed by both the classical and the quantum computing communities that highlights not only the potential of the QUBO model but also its effectiveness as an alternative to traditional modeling and solution methodologies. This tutorial discloses the basic features of the QUBO model that give it the power and flexibility to encompass the range of applications that have thrust it onto center stage of the optimization field. We show how many different types of constraining relationships arising in practice can be embodied within the "unconstrained" QUBO formulation in a very natural manner using penalty functions, yielding exact model representations in contrast to the approximate representations produced by customary uses of penalty functions. Each step of generating such models is illustrated in detail by simple numerical examples, to highlight the convenience of using QUBO models in numerous settings. We also describe recent innovations for solving QUBO models that offer a fertile avenue for integrating classical and quantum computing and for applying these models in machine learning.
Forward citations
Cited by 32 Pith papers
-
Hamilton-Zero: A Neural Tensor-Network Foundation Model for Ground States of Arbitrary Quadratic Qubit Hamiltonians
A neural foundation model trained on hundreds of thousands of quadratic qubit Hamiltonians produces variational ground-state energy bounds that transfer across system sizes and topologies, though large-scale extrapola...
-
Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries
A QUBO preprocessing algorithm factors out partial coupling symmetries into ancilla qubits, reducing QAOA CNOT count and circuit depth while preserving the ground state energy.
-
Dynamical Lie Algebras Cannot Describe Shallow QAOA: Cragged Terrains, Barren Plateaus, and Empirical Hardness Models
For shallow QAOA on maximum independent set, loss landscape variance increases with system size instead of vanishing, contradicting dynamical Lie algebra predictions.
-
A Geometric Theory of Fermion-to-Qubit Encodings
The paper proposes that Bravyi–Kitaev and Xia–Bian–Kais encoded Hamiltonians carry geometric structure whose spectral and transport descriptors reflect interaction-driven reorganization, but the strongest "exact" clai...
-
Thermodynamic significance of QUBO encoding on quantum annealers
Penalty weights in a QUBO encoding act as thermodynamic control knobs, changing both solver success and irreversibility on a quantum annealer.
-
QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits
A transformer trained on ADAPT-QAOA solutions can generate valid QAOA circuits for unseen MaxCut instances, matching ADAPT-QAOA approximation ratios within about 0.005 while avoiding iterative parameter optimization.
-
Transfer of Knowledge through Reverse Annealing: A Preliminary Analysis of the Benefits and What to Share
Reverse annealing benefits from reusing solutions of similar knapsack instances, and Hamming distance to the target solution predicts success better than energy difference.
-
Quest for quantum advantage: Monte Carlo wave-function simulations of the Coherent Ising Machine
Simulations of small Coherent Ising Machines suggest non-classical initial states and time-varying couplings can improve ground-state search success, but the effect is not separated from a classical amplitude advantage.
-
Reducing QUBO Density by Factoring Out Semi-Symmetries
Semi-symmetries in QUBO matrices can be factored into ancilla qubits, reducing couplings and QAOA depth by up to 45% while preserving the ground state if the anchoring parameter is large enough.
-
Optimizing Sensor Redundancy in Sequential Decision-Making Problems
SensorOpt formulates backup sensor selection for RL policies as a budget-constrained QUBO using a second-order return approximation, and finds near-optimal configurations with Tabu Search.
-
Quantum Isomer Search
A quantum annealer enumerated all structural isomers of alkanes up to nine carbons by solving a QUBO problem, with a claimed linear scaling in sampling time.
-
COMET: Combinatorial Optimization for Multiplex Editing Targets Via Constraint-Preserving QAOA
On a three-gene CRISPR gRNA selection QUBO, XY-mixer QAOA reaches >95% optimum probability by depth 3 in simulation and keeps sim–hardware energy gap within |0.8| on ibm_kingston, while penalty variants stay below 6% ...
-
Principles of Quantum Optimization for Constrained Problems
Computational slowdown in constrained quantum optimization is attributed to the speed of entanglement restructuring, and the paper shows how constraints create (or avoid) the narrow spectral gaps where this restructur...
-
Enhancing Satellite Quantum Key Distribution with Dual Band Reconfigurable Intelligent Surfaces
The paper argues that a dual-band RIS can jointly reduce QBER and increase SNR in satellite QKD plus RF links, but the quantitative claims in the abstract conflict with the figures and tables.
-
Towards secondary structure prediction of longer mRNA sequences using a quantum-centric optimization scheme
Hybrid CVaR and IQP quantum workflows find CPLEX-verified optimal solutions for mRNA-folding QUBO instances up to 156 qubits, but simulated scaling shows steeply declining success rates.
-
QCaMP: A 4-Week Summer Camp Introducing High School Students to Quantum Information Science and Technology
A 4-week quantum summer camp for high school students is described with detailed curriculum, projects, and pre/post assessment results.
-
Feasibility-Preserving Quantum Search for Constrained Transportation Routing
A column-wise swap mixer for QAOA-based TSP and VRP is proposed, but its claimed feasibility guarantee is contradicted by the paper's own inter-vehicle swap equations.
-
A Distributed Quantum Approximate Optimization Algorithm For Unit Commitment
A 15-variable unit commitment case shows that brute-force enumeration, monolithic QAOA, and distributed QAOA inside ADMM all recover the same optimal commitment schedule and cost.
-
EPIC-CIM: Training Convolutional Neural Networks on a Coherent Ising Machine via Equilibrium Propagation
An energy-based CIM training scheme with equilibrium propagation reportedly reaches 92.3% MNIST test accuracy, but lacks a valid derivation and reproducible details.
-
Quantum Approximate and Quantum Walk Optimization Approaches to Set Balancing
QAOA and QWOA are applied to set balancing via an L2 QUBO formulation, and a scaled-exponential Pauli-string mixer decomposition is claimed to outperform conventional circuits, but the benchmark evidence is not reproducible.
-
Quantum-based QoE Optimization in Advanced Cellular Networks: Integration and Cloud Gaming Use Case
Quantum-inspired regressors match classical ML for cloud gaming KQI prediction on a controlled testbed, and a tensor-network optimizer matches brute-force with a modest speedup.
-
A comprehensive benchmark of an Ising machine on the Max-Cut problem
The Digital Annealer finds better Max-Cut solutions than selected classical heuristics on a majority of medium-to-large instances, but its advantage depends on instance size and numeric precision.
-
Beyond Ground States: Physics-Inspired Optimization of Excited States of Classical Hamiltonians
ExcLQA, a penalty-based extension of local quantum annealing, finds excited states of Ising models and solves small instances of the shortest vector problem up to rank 46.
-
Quantum-Assisted Space Logistics Mission Planning
A 7-node space logistics routing problem was encoded as a QUBO-style Hamiltonian and solved on QCi's Dirac-3 entropy quantum computer, producing a feasible but admitted-suboptimal plan.
-
Sphere Packing on a Quantum Computer for Chromatography Modeling
A proof-of-concept that maps circle packing for chromatography to a maximum independent set problem and runs QAOA on 18 qubits, with resource estimates for harder sphere packing variants.
-
Quantum Annealing based Hybrid Strategies for Real Time Route Optimization
H2S and H3S, two fuzzy-clustering plus quantum-annealing hybrids, achieve 8-19 percent optimality gaps on five small VRPLib instances, with H3S favored on corner-depot instances and H2S on center-depot instances.
-
A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation
A quantum graph-coloring framework with log-color encoding and a QFT-based mixer is presented; its chromatic-number term is flawed because label-sum minimization does not imply color-count minimization.
-
Feedback-Based Quantum Control for Safe and Synergistic Drug Combination Design
A quantum feedback algorithm finds ground-state drug combinations from Ising-encoded interaction data, but the problems are tiny and the interaction weights are hand-assigned.
-
Performance Analysis of Convolutional Neural Network By Applying Unconstrained Binary Quadratic Programming
A hybrid QUBO/quantum-annealing optimizer is claimed to improve CNN training on MNIST, but the supporting derivation and experiments are inconsistent.
-
Programming guide for solving constraint satisfaction problems with tensor networks
This guide demonstrates how to use the Julia packages GenericTensorNetworks.jl, OMEinsum.jl, and ProblemReductions.jl to represent constraint satisfaction problems as tensor networks, optimize contraction orders, and ...
-
QUBO Refinement: Achieving Superior Precision through Iterative Quantum Formulation with Limited Qubits
An iterative bit-slicing QUBO refinement method claims 16-decimal precision for linear systems but demonstrates only 1e-13 error and lacks a proven convergence guarantee.
-
Quantum Computing for Energy Management: A Semi Non-Technical Guide for Practitioners
A review-based guide concludes that quantum speedup for energy management is unproven and presents a practical framework for selecting quantum and quantum-inspired approaches.
Discussion (0). Continue with ORCID to comment.