Papers › Ultrafast critical ground state preparation via bang-bang protocols
Ultrafast critical ground state preparation via bang-bang protocols
Luca Innocenti, Gabriele De Chiara, Mauro Paternostro, Ricardo Puebla
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The fast and faithful preparation of the ground state of quantum systems is a challenging task but crucial for several applications in the realm of quantum-based technologies. Decoherence poses a limit to the maximum time-window allowed to an experiment to faithfully achieve such desired states. This is of particular significance in critical systems, where the vanishing energy gap challenges an adiabatic ground state preparation. We show that a bang-bang protocol, consisting of a time evolution under two different values of an externally tunable parameter, allows for a high-fidelity ground state preparation in evolution times no longer than those required by the application of standard optimal control techniques, such as the chopped-random basis quantum optimization. In addition, owing to their reduced number of variables, such bang-bang protocols are very well suited to optimization purposes, reducing the increasing computational cost of other optimal control protocols. We benchmark the performance of such approach through two paradigmatic models, namely the Landau-Zener and the Lipkin-Meshkov-Glick model. Remarkably, the critical ground state of the latter model can be prepared with a high fidelity in a total evolution time that scales slower than the inverse of the vanishing energy gap.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections