Kavli Affiliate: Eliska Greplova
| First 5 Authors: Arash Ahmadi, Eliska Greplova, , ,
| Summary:
The advent of quantum technologies brought forward much attention to the
theoretical characterization of the computational resources they provide. One
outstanding challenge to such characterization is the mathematical complexity
that their evaluation possesses. A method to quantify quantum computational
complexity is to use a class of functions called magic monotones, which are,
however, notoriously hard and impractical to evaluate. In this work, we provide
a new perspective on calculating magic monotones by connecting them to the
concept of information scrambling. Specifically, we establish a connection
between information scrambling in random quantum circuits and the magic these
circuits generate. This connection allows us to establish a novel,
experimentally scalable way to approximate magic monotones in an arbitrary
Hilbert space dimension and therefore evaluate the amount of quantum resources
using out-of-time-order correlator measurements. Furthermore, we exploit our
result connecting scrambling and magic to formulate a simple criterion to
determine chaoticity of a given Hamiltonian.
| Search Query: ArXiv Query: search_query=au:”Eliska Greplova”&id_list=&start=0&max_results=10