Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Constructing quantum many-body scar Hamiltonians from Floquet automata

Published

Author(s)

Michael Gullans, Pierre-Gabriel Rozon, Kartiek Agarwal

Abstract

We provide a systematic approach for constructing approximate quantum many-body scars (QMBS) starting from two-layer Floquet automaton circuits that exhibit trivial many-body re- vivals. We do so by applying successively more restrictions that force local gates of the automaton circuit to commute concomitantly more accurately when acting on select scar states. With these rules in place, an effective local, Floquet Hamiltonian is seen to capture dynamics of the automata over a long prethermal window, and neglected terms can be used to estimate the relaxation of re- vivals. We provide numerical evidence for such a picture and use our construction to derive several QMBS models, including the celebrated PXP model.
Citation
Physical Review B
Volume
106
Issue
18

Keywords

quantum information, quantum simulation, statistical mechanics

Citation

Gullans, M. , Rozon, P. and Agarwal, K. (2022), Constructing quantum many-body scar Hamiltonians from Floquet automata, Physical Review B, [online], https://doi.org/10.1103/PhysRevB.106.184304, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=933987 (Accessed October 8, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created November 22, 2022, Updated December 19, 2022
Was this page helpful?