Is decoding interior partners from Hawking radiation exponentially hard?
46No. 889 in all physics · No. 35 in Gravitation and Quantum Gravity
Given the radiation of a black hole of entropy $S$, is distilling the qubit entangled with a given late Hawking mode (the Harlow-Hayden task) quantum-computationally hard, requiring time $\exp(\Omega(S))$ for every quantum algorithm, for realistic black hole dynamics instead of idealized random unitaries? An answer is a reduction to a standard hardness assumption, an unconditional bound, or an efficient algorithm.
What would settle it
A complexity-theoretic proof of hardness for decoding under a physically motivated model of black hole dynamics, or an efficient decoder.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
Hardness holds under complexity assumptions (Harlow and Hayden 2013) and was later tied to the existence of quantum cryptographic primitives (2023); realistic dynamics remain open as of 2026.
Parent problems
- Special case of Does an infalling observer see vacuum at an old black hole's horizon? · open · from revision 1
No solutions, ideas or subproblems yet.
See also
Details, signature and history
- Kind
- Well-posed question
- Answer
- Yes no
- Posed
- 2013
- Topic review
- D. Harlow, Jerusalem lectures on black holes and quantum information, Rev. Mod. Phys. 88, 015002, 2016. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- b2bccd4c8bef…
- Public log
- Entry 1,470, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.