Exploring quench dynamics as a shortcut to adiabaticity in programmable atoms arrays

ORAL

Abstract

The ability to prepare ground states of quantum Hamiltonians via an adiabatic protocol is typically determined by the smallest energy gap during quantum evolution. This poses a challenge for large quantum systems, in particular in instances where the minimum gap scales super-exponentially with system size. We experimentally investigate the breakdown of the quantum adiabatic algorithms for such hard instances of the maximum independent set problem and demonstrate a method to circumvent this limitation. Using QuEra's Aquila programmable quantum simulator based on Rydberg atom arrays, we experimentally realize a hybrid adiabatic-quench-adiabatic protocol as a remedy to the diverging adiabatic timescale and find that it significantly outperforms adiabatic algorithms. We observe quantum-scar-like dynamics for different quench durations, demonstrating that a sweep-quench-sweep approach quantum algorithm can provide a shortcut to adiabaticity for a certain class of problems where adiabatic algorithms fail.

Presenters

  • Alexander Lukin

    • Harvard University
    • QuEra Computing Inc.

Authors

  • Alexander Lukin

    • Harvard University
    • QuEra Computing Inc.
  • Alexei Bylinskii

    • QuEra Computing Inc.
  • Jesse Amato-Grill

    • QuEra Computing Inc
  • Florian Huber

    • QuEra Computing Inc
  • Sergio Cantu

    • QuEra Computing Inc
  • Boris Braverman

    • QuEra Computing Inc
  • Benjamin Schiffer

    • Max Planck Institute of Quantum Optics
  • Dominik Wild

    • Max Planck Institute of Quantum Optics
  • Rhine Samajdar

    • Princeton University
  • Maskara Nishad

    • Harvard University
  • Cain Maddie

    • Harvard University
  • Donggyu Kim

    • Kaist
  • Nathan Gemelke

    • QuEra Computing Inc
  • Mikhail D Lukin

    • Harvard University