Fast scrambling on sparse graphs Journal Article

• Best Open Access

Overview

abstract

• Significance; Are there bounds on quantum information processing and thermalization in many-body quantum systems? The fast-scrambling conjecture states that quantum information processing times must grow at least logarithmically with the number of degrees of freedom. We derive this result for generic systems. We discuss the nonuniversal relationship between scrambling and many-body quantum chaos, which is often used as a diagnostic for fast scrambling. We also find explicit examples of sparsely connected quantum systems which are fast scramblers, suggesting additional routes to experimentally testing the fast-scrambling conjecture in cold atomic gases. These results clarify for which information-processing tasks quantum black holes may be the fastest quantum systems.

CU Boulder Authors

• Lucas, Andrew James

publication date

• April 2, 2019

has restriction

• green

Date in CU Experts

• February 1, 2020 7:26 AM

Full Author List

• Bentsen G; Gu Y; Lucas A

author count

• 3

published in

• Proceedings of the National Academy of Sciences of USA  Journal

Other Profiles

International Standard Serial Number (ISSN)

• 0027-8424

Electronic International Standard Serial Number (EISSN)

• 1091-6490

Digital Object Identifier (DOI)

• https://doi.org/10.1073/pnas.1811033116

Additional Document Info

start page

• 6689

end page

• 6694

volume

• 116

issue

• 14