pith. sign in

arxiv: 2505.18367 · v4 · pith:RS3SRGWUnew · submitted 2025-05-23 · 🪐 quant-ph · cond-mat.stat-mech

Improving Variational Counterdiabatic Driving with Weighted Actions and Computer Algebra

classification 🪐 quant-ph cond-mat.stat-mech
keywords drivingvariationalmethodadiabaticalgebracomputerconventionalcounterdiabatic
0
0 comments X
read the original abstract

Variational counterdiabatic (CD) driving is a disciplined and widely used method to robustly control quantum many-body systems by mimicking adiabatic processes with high fidelity and reduced duration. Central to this technique is a universal structure of the adiabatic gauge potential (AGP) over a parameterized Hamiltonian. Here, we reveal that introducing a new degree of freedom into the theory of the AGP can significantly improve variational CD driving. Specifically, we find that the algebraic characterization of the AGP is not unique, and we exploit this nonuniqueness to develop the weighted variational method for deriving a refined driving protocol. This approach extends the conventional method in two aspects: it assigns customized weights to matrix elements relevant to specific problems, and it effectively incorporates nonlocal information into local driving coefficients. We also develop an efficient numerical algorithm to compute the refined driving protocol using computer algebra. Our framework is broadly applicable and, in principle, it can replace any previous use of variational CD driving. We demonstrate its practicality by applying it to adiabatic evolution along the ground state of a parameterized Hamiltonian. This proposal outperforms the conventional method in terms of fidelity, as confirmed by extensive numerical simulations on quantum Ising models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. (Non-)Traversable Quantum Phase Transitions

    quant-ph 2026-05 unverdicted novelty 6.0

    Proposes classifying quantum phase transitions by whether they are traversable via finite counterdiabatic driving protocols or nontraversable due to infinite geometric distance in the ground-state manifold.

  2. Feedback-based quantum optimization and its classical counterpart: quantum advantage and the power of classical algorithms

    quant-ph 2026-05 unverdicted novelty 6.0

    Classical feedback-based optimization matches or exceeds quantum performance in speed and scalability while quantum retains an edge in final solution quality on tested instances.