The typical-state paradox: diagnosing horizons with complexity

DOI10.1002/PROP.201500091MaRDI QIDQ2815134zbMATH OpenOpenAlexFDO

Authors Leonard Susskind

Publication date 27 June 2016

Published in Fortschritte der Physik (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.02287

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Black holes (83C57)

Abstract: The concept of transparent and opaque horizons is defined. One example of opaqueness is the presence of a firewall. Two apparently contradictory statements are reconciled: The overwhelming number of black hole states have opaque horizons; and: All black holes formed by natural processes have transparent horizons. A diagnostic is proposed for transparency, namely that the computational complexity of the state be increasing with time. It is shown that opaque horizons are extremely unstable and that the slightest perturbation will make them transparent within a scrambling time.

Recommendations

• Computational complexity and black hole horizons
• The Limits of Black Hole Complementarity
• Black holes: complementarity or firewalls?
• Addendum to computational complexity and black hole horizons
• Firewall or smooth horizon?

Cites work

• Black holes and the butterfly effect
• Black holes: complementarity or firewalls?
• Localized shocks
• Multiple shocks
• Quantum computation vs. firewalls
• Stringy effects in scrambling
• The geometry of quantum computation
• Violations of the Born rule in cool state-dependent horizons

Cited in

(39)

• The factorization problem in Jackiw-Teitelboim gravity
• Size and momentum of an infalling particle in the black hole interior
• Complexity and multi-boundary wormholes in \(2 + 1\) dimensions
• Firewall or smooth horizon?
• Complexity of quantum circuits via sensitivity, magic, and coherence
• A smooth horizon without a smooth horizon
• Slow complexification
• Cosmological singularities, holographic complexity and entanglement
• On complexity of holographic flavors
• On the time dependence of holographic complexity
• Holevo information and ensemble theory of gravity
• On the non-perturbative bulk Hilbert space of JT gravity
• Complexity is simple!
• Holographic non-computers
• State-independent black hole interiors from the crossed product
• The holographic map of an evaporating black hole
• Holographic complexity in charged accelerating black holes
• Holographic complexity equals which action?
• The power of Lorentzian wormholes
• Firewalls at exponentially late times
• Spread and spectral complexity in quantum spin chains: from integrability to chaos
• The black hole interior from non-isometric codes and complexity
• Complexity growth in integrable and chaotic models
• Chaos in quantum channels
• Holographic complexity and spacetime singularities
• Holographic and QFT complexity with angular momentum
• Collisions of localized shocks and quantum circuits
• Holographic complexity in Vaidya spacetimes. II.
• The volume of the black hole interior at late times
• A complexity/fidelity susceptibility \(g\)-theorem for \(\mathrm{AdS}_{3}/BCFT_{2}\)
• Aspects of the first law of complexity
• Holographic complexity of cold hyperbolic black holes
• Firewalls from wormholes in higher genus
• On some universal features of the holographic quantum complexity of bulk singularities
• Complexity via replica trick
• On the time dependence of holographic complexity for charged AdS black holes with scalar hair
• Chaos and complexity by design
• On the saturation of late-time growth of complexity in supersymmetric JT gravity
• A quantum circuit interpretation of evaporating black hole geometry

This page was built for publication: The typical-state paradox: diagnosing horizons with complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815134)