Efficient quantum algorithms for stabilizer entropies
File(s)PhysRevLett.132.240602.pdf (307.59 KB)
Published version
Author(s)
Haug, Tobias
Lee, Soovin
Kim, MS
Type
Journal Article
Abstract
Stabilizer entropies (SEs) are measures of nonstabilizerness or “magic” that quantify the degree to which
a state is described by stabilizers. SEs are especially interesting due to their connections to scrambling,
localization and property testing. However, applications have been limited so far as previously known
measurement protocols for SEs scale exponentially with the number of qubits. Here, we efficiently measure
SEs for integer R´enyi index n > 1 via Bell measurements. The SE of N-qubit quantum states can be
measured with OðnÞ copies and OðnNÞ classical computational time, where for even n we additionally
require the complex conjugate of the state. We provide efficient bounds of various nonstabilizerness
monotones that are intractable to compute beyond a few qubits. Using the IonQ quantum computer, we
measure SEs of random Clifford circuits doped with non-Clifford gates and give bounds for the stabilizer
fidelity, stabilizer extent, and robustness of magic. We provide efficient algorithms to measure Clifford averaged 4n-point out-of-time-order correlators and multifractal flatness. With these measures we study the
scrambling time of doped Clifford circuits and random Hamiltonian evolution depending on nonstabilizer ness. Counterintuitively, random Hamiltonian evolution becomes less scrambled at long times, which we
reveal with the multifractal flatness. Our results open up the exploration of nonstabilizerness with quantum
computers.
a state is described by stabilizers. SEs are especially interesting due to their connections to scrambling,
localization and property testing. However, applications have been limited so far as previously known
measurement protocols for SEs scale exponentially with the number of qubits. Here, we efficiently measure
SEs for integer R´enyi index n > 1 via Bell measurements. The SE of N-qubit quantum states can be
measured with OðnÞ copies and OðnNÞ classical computational time, where for even n we additionally
require the complex conjugate of the state. We provide efficient bounds of various nonstabilizerness
monotones that are intractable to compute beyond a few qubits. Using the IonQ quantum computer, we
measure SEs of random Clifford circuits doped with non-Clifford gates and give bounds for the stabilizer
fidelity, stabilizer extent, and robustness of magic. We provide efficient algorithms to measure Clifford averaged 4n-point out-of-time-order correlators and multifractal flatness. With these measures we study the
scrambling time of doped Clifford circuits and random Hamiltonian evolution depending on nonstabilizer ness. Counterintuitively, random Hamiltonian evolution becomes less scrambled at long times, which we
reveal with the multifractal flatness. Our results open up the exploration of nonstabilizerness with quantum
computers.
Date Issued
2024-06-14
Date Acceptance
2024-05-10
Citation
Physical Review Letters, 2024, 132 (24)
ISSN
0031-9007
Publisher
American Physical Society (APS)
Journal / Book Title
Physical Review Letters
Volume
132
Issue
24
Copyright Statement
Published by the American Physical Society under the terms of
the Creative Commons Attribution 4.0 International license.
Further distribution of this work must maintain attribution to
the author(s) and the published article’s title, journal citation,
and DOI.
the Creative Commons Attribution 4.0 International license.
Further distribution of this work must maintain attribution to
the author(s) and the published article’s title, journal citation,
and DOI.
License URL
Identifier
http://dx.doi.org/10.1103/physrevlett.132.240602
Publication Status
Published
Article Number
240602
Date Publish Online
2024-06-13