{"work":{"id":"c3c20ae3-c9c7-480e-bb3a-de87d2df7ef1","openalex_id":"https://openalex.org/W2762636446","doi":"10.48550/arxiv.1710.03363","arxiv_id":"1710.03363","raw_key":null,"title":"Efficient decoding for the Hayden-Preskill protocol","authors":null,"authors_text":"B","year":2017,"venue":"hep-th","abstract":"We present two particular decoding procedures for reconstructing a quantum state from the Hawking radiation in the Hayden-Preskill thought experiment. We work in an idealized setting and represent the black hole and its entangled partner by $n$ EPR pairs. The first procedure teleports the state thrown into the black hole to an outside observer by post-selecting on the condition that a sufficient number of EPR pairs remain undisturbed. The probability of this favorable event scales as $1/d_{A}^2$, where $d_A$ is the Hilbert space dimension for the input state. The second procedure is deterministic and combines the previous idea with Grover's search. The decoding complexity is $\\mathcal{O}(d_{A}\\mathcal{C})$ where $\\mathcal{C}$ is the size of the quantum circuit implementing the unitary evolution operator $U$ of the black hole. As with the original (non-constructive) decoding scheme, our algorithms utilize scrambling, where the decay of out-of-time-order correlators (OTOCs) guarantees faithful state recovery.","external_url":"https://arxiv.org/abs/1710.03363","cited_by_count":77,"metadata_source":"pith","metadata_fetched_at":"2026-08-05T02:28:24.338817+00:00","pith_arxiv_id":"1710.03363","created_at":"2026-05-13T21:13:16.528303+00:00","updated_at":"2026-08-05T02:28:24.338817+00:00","title_quality_ok":true,"display_title":"Efficient decoding for the Hayden-Preskill protocol","render_title":"Efficient decoding for the Hayden-Preskill protocol"},"hub":{"state":{"tier_text":"hub","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":11,"external_cited_by_count":77},"tier":"hub","role_counts":[{"context_role":"background","n":2}],"polarity_counts":[{"context_polarity":"background","n":2}],"runs":{},"summary":{},"graph":{},"authors":[]}}