Pith. sign in

REVIEW 1 cited by

Minimal Model for Fast Scrambling

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

arxiv 2005.05362 v3 pith:TSPV76JV submitted 2020-05-11 quant-ph cond-mat.stat-mechcond-mat.str-el

classification quant-phcond-mat.stat-mechcond-mat.str-el
keywords quantumscramblingfastglobalinformationinteractionlocalmodel
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We study quantum information scrambling in spin models with both long-range all-to-all and short-range interactions. We argue that a simple global, spatially homogeneous interaction together with local chaotic dynamics is sufficient to give rise to fast scrambling, which describes the spread of quantum information over the entire system in a time that is logarithmic in the system size. This is illustrated in two tractable models: (1) a random circuit with Haar random local unitaries and a global interaction and (2) a classical model of globally coupled non-linear oscillators. We use exact numerics to provide further evidence by studying the time evolution of an out-of-time-order correlator and entanglement entropy in spin chains of intermediate sizes. Our results pave the way towards experimental investigations of fast scrambling and aspects of quantum gravity with quantum simulators.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Fast quantum computation with all-to-all Hamiltonians

    quant-ph 2025-09 conditional novelty 8.0 of 10

    All-to-all Hamiltonians can simulate any two-qubit gate in about 1/N time and any depth-D circuit in about D/√N time, with polynomially small error.

Pith tools