REVIEW
Exponential speedup in measuring out-of-time-ordered correlators with a single bit of quantum information
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Exponential speedup in measuring out-of-time-ordered correlators with a single bit of quantum information
read the original abstract
Out-of-time-ordered correlators (OTOC) are a quantifier of quantum information scrambling and quantum chaos. We propose an efficient quantum algorithm to measure OTOCs that provides an exponential speed-up over the best known classical algorithm provided the OTOC operator to be estimated admits an efficient gate decomposition. We also discuss a scheme to obtain information about the eigenvalue spectrum and the spectral density of OTOCs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.