QUBO Sampling for Mixed Binary Quadratic Programming without Continuous Variable Binarization

arXiv:2607.21286 · quant-ph · Submitted 2026-07-23 · Read on arXiv

quant-ph

Submitted: 2026-07-23

Updated: 2026-09-26

Comments: 13 pages, 5 figures

DOI: 10.1038/s41598-026-73188-1

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Benchmark — 3× in this paper · explained in 2 episodes
• Combinatorial Optimization — 3× in this paper · explained in 2 episodes
• QUBO Formulation — 3× in this paper · explained in 3 episodes
• Effective Hamiltonian — 2× in this paper · explained in 2 episodes
• Calibration — 1× in this paper · explained in 7 episodes
• Robustness — 1× in this paper · explained in 5 episodes

Sources

• A Quantum Approximate Optimization Algorithm
• Quantum Annealing Implementation of Job-Shop Scheduling
• Micro-mobility dispatch optimization via quantum annealing incorporating historical data
• Demonstration of a Compatibility-Based Childcare Support Service using Quantum Annealing
• Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment
• Hybrid Quantum Benders' Decomposition For Mixed-integer Linear Programming
• Optuna: A Next-generation Hyperparameter Optimization Framework
• Training Energy-Based Models with Non-MCMC Samplers and Efficient Temperature Estimation

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians