Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
arXiv:2409.04477 · doi:10.1038/s42005-025-02270-3
Abstract
Combinatorial optimization plays a crucial role in many industrial applications. While classical computing often struggles with complex instances, quantum optimization emerges as a promising alternative. Here, we present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO). We apply BF-DCQO to a HUBO problem featuring three-local terms in the Ising spin-glass model, validated experimentally using 156 qubits on an IBM quantum processor. In the studied instances, our results outperform standard methods such as the quantum approximate optimization algorithm, quantum annealing, simulated annealing, and Tabu search. Furthermore, we provide numerical evidence of the feasibility of a similar HUBO problem on a 433-qubit Osprey-like quantum processor. Finally, we solve denser instances of the MAX 3-SAT problem in an IonQ emulator. Our results show that BF-DCQO offers an effective path for solving large-scale HUBO problems on current and near-term quantum processors.
Main text: 13 pages, 7 figures, 4 tables. Supplementary Information: 3 pages, 1 figure
References in corpus (61)
- The density-matrix renormalization group in the age of matrix product states
- Area laws for the entanglement entropy - a review
- Ising formulations of many NP problems
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Adiabatic Quantum Computing
- The ITensor Software Library for Tensor Network Calculations
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- Fast optimal frictionless atom cooling in harmonic traps
- Tensor networks for complex quantum systems
- Shortcuts to adiabaticity by counter-diabatic driving
- Digitized adiabatic quantum computing with a superconducting circuit
- Geometry and non-adiabatic response in quantum and classical systems
- Quantum advantage in the charging process of Sachdev-Ye-Kitaev batteries
- Warm-starting quantum optimization
- Minimizing irreversible losses in quantum systems by local counter-diabatic driving
- Quantum critical dynamics in a 5000-qubit programmable spin glass
- Improving Variational Quantum Optimization using CVaR
- Floquet-engineering counterdiabatic protocols in quantum many-body systems
- Real- and imaginary-time evolution with compressed quantum circuits
- Resource-Efficient Quantum Algorithm for Protein Folding
- Quantum Simulations of Classical Annealing Processes
- Lecture Notes of Tensor Network Contractions
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems
- Tensor Network Algorithms: a Route Map
- Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks
- Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
- Speed-up via Quantum Sampling
- Beyond-classical computation in quantum simulation
- Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
- Digitized-counterdiabatic quantum approximate optimization algorithm
- Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
- Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
- Efficient tensor network simulation of IBM's largest quantum processors
- Controlling and exploring quantum systems by algebraic expression of adiabatic gauge potential
- Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
- Quantum speedup of branch-and-bound algorithms
- Quantum annealing with longitudinal bias fields
- Digitized-Counterdiabatic Quantum Optimization
- Probing Entanglement in Adiabatic Quantum Optimization with Trapped Ions
- Rapid initial state preparation for the quantum simulation of strongly correlated molecules
- Warm-Starting and Quantum Computing: A Systematic Mapping Study
- Provable bounds for noise-free expectation values computed from noisy samples
- Calibrating the role of entanglement in variational quantum circuits
- Quantifying quantum coherence of multiple-charge states in tunable Josephson junctions
- A quantum-inspired tensor network method for constrained combinatorial optimization problems
- Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation
- Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization
- Low-depth simulations of fermionic systems on square-grid quantum hardware
- Optimizing edge state transfer in a Su-Schrieffer-Heeger chain via hybrid analog-digital strategies
- Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
- Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end
- Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
- Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling
- Bias-field digitized counterdiabatic quantum optimization
- Genuine Multipartite Entanglement in Quantum Optimization
- Introduction to quantum entanglement in many-body systems
- Projected Entangled Pair States with flexible geometry
- Quantum annealing sampling with a bias field
Cited by in corpus (8)
- Quantum Approximate Multi-Objective Optimization
- Fighting Exponentially Small Gaps by Counterdiabatic Driving
- Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization
- Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
- Improving Variational Counterdiabatic Driving with Weighted Actions and Computer Algebra
- Resource-Efficient Quantum Optimization via Higher-Order Encoding
- Recent quantum runtime (dis)advantages
- Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers