REVIEW 3 cited by
Operator growth bounds in a cartoon matrix model
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
Signed reviews
abstract
We study operator growth in a model of $N(N-1)/2$ interacting Majorana fermions, which live on the edges of a complete graph of $N$ vertices. Terms in the Hamiltonian are proportional to the product of $q$ fermions which live on the edges of cycles of length $q$. This model is a cartoon "matrix model": the interaction graph mimics that of a single-trace matrix model, which can be holographically dual to quantum gravity. We prove (non-perturbatively in $1/N$, and without averaging over any ensemble) that the scrambling time of this model is at least of order $\log N$, consistent with the fast scrambling conjecture. We comment on apparent similarities and differences between operator growth in our "matrix model" and in the melonic models.
Forward citations
Cited by 3 Pith papers
-
Fast quantum computation with all-to-all Hamiltonians
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.
-
Refining the Understanding of Operator Size Dynamics in Open Quantum Systems
In Brownian SYK models, operator size under the bath-traced Lindblad definition shows a scrambling signature only for intra-system interactions, with the same early-time critical point as the full-contour definition, ...
-
Scrambling Enabled Entropy Accumulation in Open Quantum Systems
A weak probe coupled to an open quantum system accumulates a finite Rényi entropy increase only when the system is in the scrambling phase, vanishing in the dissipative phase as the probe coupling goes to zero.
Discussion (0). Continue with ORCID to comment.