REVIEW 2 cited by
Scrambling with Matrix Black Holes
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
read the original abstract
If black holes are not to be dreaded syncs of information but be fully described by unitary evolution, they must scramble in-falling data and eventually leak it through Hawking radiation. Sekino and Susskind have conjectured that black holes are fast scramblers: they generate entanglement at a remarkably efficient rate, with characteristic time scaling logarithmically with the entropy. In this work, we focus on Matrix theory -- M theory in the light-cone frame -- and directly probe the conjecture. We develop a concrete test bed for quantum gravity using the fermionic variables of Matrix theory and show that the problem becomes that of chains of qubits with an intricate network of interactions. We demonstrate that the black hole system evolves much like a Brownian quantum circuit, with strong indications that it is indeed a fast scrambler. We also analyze the Berenstein-Maldacena-Nastase model and reach the same tentative conclusion.
Forward citations
Cited by 2 Pith papers
-
An exact algorithm for U(N) matrix models in the gauge-invariant singlet sector
A group-theoretic algorithm computes U(N)-singlet Hamiltonian matrix elements as closed-form polynomials in N, validated for one matrix against the exact fermion mapping.
-
Simulating matrix models with tensor networks
Tensor-network DMRG simulations of SU(2) and small-SU(N) bosonic and supersymmetric matrix models give convergent ground states and entanglement measures, with costs that appear to grow polynomially with the number of...
Discussion (0). Continue with ORCID to comment.