Papers
Topics
Authors
Recent
Search
2000 character limit reached

Geometrical scheduling of adiabatic control without information of energy spectra

Published 21 Jan 2025 in quant-ph | (2501.11846v1)

Abstract: Adiabatic control is a fundamental technique for manipulating quantum systems, guided by the quantum adiabatic theorem, which ensures suppressed nonadiabatic transitions under slow parameter variations. Quantum annealing, a heuristic algorithm leveraging adiabatic control, seeks the ground states of Ising spin glass models and has drawn attention for addressing combinatorial optimization problems. However, exponentially small energy gaps in such models often necessitate impractically long runtime to satisfy the adiabatic condition. Despite this limitation, improving the quality of approximate solutions remains crucial for practical applications. The quantum adiabatic brachistochrone provides a method to enhance adiabaticity by minimizing an action representing nonadiabaticity via the variational principle. While effective, its implementation requires detailed energy spectra, complicating its use in quantum annealing. Shortcuts to adiabaticity by counterdiabatic driving offer alternative approaches for accelerating adiabatic processes. However, the theory of shortcuts to adiabaticity often faces challenges such as nonlocal control requirements, high computational cost, and trade-offs between speed and energy efficiency. In this work, we propose a novel quantum adiabatic brachistochrone protocol tailored for quantum annealing that eliminates the need for energy spectrum information. Our approach builds on advancements in counterdiabatic driving to design efficient parameter schedules. We demonstrate the effectiveness of our method through numerical simulations on the transverse-field Ising chain and axial next-nearest neighbor Ising models.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.