Fighting Exponentially Small Gaps by Counterdiabatic Driving

We investigate the efficiency of approximate counterdiabatic driving (CD) in accelerating adiabatic passage through exponentially small gaps. First, we analyze a minimal spin-glass bottleneck model that is analytically tractable and exhibits both an exponentially small gap at the transition point and a change in the ground state that involves a macroscopic rearrangement of spins. Using the variational Floquet-Krylov expansion to construct CD terms, we find that while the formation of excitations is significantly suppressed, achieving a fully adiabatic evolution remains challenging. Extending our investigation to realistic NP-hard spin-glass problems—specifically, the 3-regular and 3-—we find again that local CD expansions lead to negligible improvements in the final ground-state fidelity. These results highlight the limited impact of local CD methods in overcoming the bottlenecks associated with first-order quantum phase transitions. To address this limitation, we propose an alternative method, termed quantum brachistochrone counterdiabatic driving (QBCD), which employs the approximate full CD connecting the ground state and the first-excited state at a single-parameter value close to the critical point. In the minimal spin-glass model, QBCD enables exponentially faster adiabatic evolution than the local strategies. To alleviate the challenges of its experimental and classical implementation for realistic -hard problems, we exponentially reduce the nonlocality of the QBCD Hamiltonian by sparsifying its matrix elements to the density of the local expansions. Despite this drastic simplification, sparsified QBCD maintains finite ground-state fidelity at driving times exponentially shorter than in local strategies and counterdiabatic optimized local driving, demonstrating that even an exponentially reduced fraction of nonlocality near the critical point is sufficient to achieve significant speedup across spin-glass bottlenecks. At the same time, reduced nonlocality facilitates classical implementations via advanced numerical methods, while on quantum hardware its truncation serves as a resource-efficient approximation scheme for higher-order CD realizations.

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2025-11-19
DOI
https://doi.org/10.1103/tgzt-dy3h
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fighting Exponentially Small Gaps by Counterdiabatic Driving

Karl J. Friston
PRX Quantum
Quantum Computing Algorithms and Architecture
article

Fighting Exponentially Small Gaps by Counterdiabatic Driving

Karl J. Friston
article en

Abstract

We investigate the efficiency of approximate counterdiabatic driving (CD) in accelerating adiabatic passage through exponentially small gaps. First, we analyze a minimal spin-glass bottleneck model that is analytically tractable and exhibits both an exponentially small gap at the transition point and a change in the ground state that involves a macroscopic rearrangement of spins. Using the variational Floquet-Krylov expansion to construct CD terms, we find that while the formation of excitations is significantly suppressed, achieving a fully adiabatic evolution remains challenging. Extending our investigation to realistic NP-hard spin-glass problems—specifically, the 3-regular and 3-—we find again that local CD expansions lead to negligible improvements in the final ground-state fidelity. These results highlight the limited impact of local CD methods in overcoming the bottlenecks associated with first-order quantum phase transitions. To address this limitation, we propose an alternative method, termed quantum brachistochrone counterdiabatic driving (QBCD), which employs the approximate full CD connecting the ground state and the first-excited state at a single-parameter value close to the critical point. In the minimal spin-glass model, QBCD enables exponentially faster adiabatic evolution than the local strategies. To alleviate the challenges of its experimental and classical implementation for realistic -hard problems, we exponentially reduce the nonlocality of the QBCD Hamiltonian by sparsifying its matrix elements to the density of the local expansions. Despite this drastic simplification, sparsified QBCD maintains finite ground-state fidelity at driving times exponentially shorter than in local strategies and counterdiabatic optimized local driving, demonstrating that even an exponentially reduced fraction of nonlocality near the critical point is sufficient to achieve significant speedup across spin-glass bottlenecks. At the same time, reduced nonlocality facilitates classical implementations via advanced numerical methods, while on quantum hardware its truncation serves as a resource-efficient approximation scheme for higher-order CD realizations.

PRX QuantumVol. 7(1)
University of Luxembourg (LU), Max Planck Institute for the Physics of Complex Systems (DE), Donostia International Physics Center (ES)
Openalex Percentile: Top 79%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.