Bias-field digitized counterdiabatic quantum optimization

Abstract

We introduce a method for solving combinatorial optimization problems on digital quantum computers, where we incorporate auxiliary counterdiabatic (CD) terms into the adiabatic Hamiltonian, while integrating bias terms derived from an iterative digitized counterdiabatic quantum algorithm. We call this protocol bias-field digitized counterdiabatic quantum optimization (BF-DCQO). Designed to effectively tackle large-scale combinatorial optimization problems, BF-DCQO demonstrates resilience against the limitations posed by the restricted coherence times of current quantum processors and shows clear enhancement even in the presence of noise. Additionally, our purely quantum approach eliminates the dependency on classical optimization required in hybrid classical-quantum schemes, thereby circumventing the trainability issues often associated with variational quantum algorithms. Through the analysis of an all-to-all connected general Ising spin-glass problem, we exhibit a polynomial scaling enhancement in ground state success probability compared to traditional DCQO and finite-time adiabatic quantum optimization methods. Furthermore, it achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude, and offers an average 1.3x better approximation ratio than the quantum approximate optimization algorithm for the problem sizes studied. We validate these findings through experimental implementations on both trapped-ion quantum computers and superconducting processors, tackling a maximum weighted independent set problem with 36 qubits and a spin-glass on a heavy-hex lattice with 100 qubits, respectively. These results mark a significant advancement in gate-based quantum computing, employing a fully quantum algorithmic approach.

Main text: 5 pages, 3 figures. Supplementary: 11 pages, 12 figures

References in corpus (21)

• Ising formulations of many NP problems
• Adiabatic Quantum Computing
• Shortcuts to adiabaticity by counter-diabatic driving
• Digitized adiabatic quantum computing with a superconducting circuit
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
• Geometry and non-adiabatic response in quantum and classical systems
• Warm-starting quantum optimization
• Minimizing irreversible losses in quantum systems by local counter-diabatic driving
• Floquet-engineering counterdiabatic protocols in quantum many-body systems
• Quantum annealing initialization of the quantum approximate optimization algorithm
• Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
• Digitized-counterdiabatic quantum approximate optimization algorithm
• Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
• Towards adiabatic quantum computing using compressed quantum circuits
• Controlling and exploring quantum systems by algebraic expression of adiabatic gauge potential
• Shortcuts to Adiabaticity in Krylov Space
• Digitized-Counterdiabatic Quantum Optimization
• Quantum annealing with longitudinal bias fields
• Warm-Starting and Quantum Computing: A Systematic Mapping Study
• Variational counterdiabatic driving of the Hubbard model for ground-state preparation
• Quantum annealing sampling with a bias field

Cited by in corpus (6)

• Benchmarking the performance of quantum computing software
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Higher-Order Portfolio Optimization with Quantum Approximate Optimization Algorithm
• Fighting Exponentially Small Gaps by Counterdiabatic Driving
• Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem
• Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers