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. A
method to quantify quantum resources is to use a class of functions called
magic monotones, which are, however, notoriously hard and impractical to
evaluate for large system sizes. In recent studies, a fundamental connection
between information scrambling and magic monotones was established. This
connection simplified magic monotone calculation, but this class of methods
still suffers from the exponential scaling with respect to the number of
qubits. In this work, we establish an efficient way to sample an
out-of-time-order correlators that approximate magic monotones. We numerically
show the relation of these sampled correllators to different non-stabilizerness
measures for both qubit and qutrit systems. Furthermore, we put forward and
simulate a protocol to measure the monotonic behaviour of magic for the time
evolution of local Hamiltonians.
| Search Query: ArXiv Query: search_query=au:”Eliska Greplova”&id_list=&start=0&max_results=3