Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2106.15628

Recovery algorithms for Clifford Hayden-Preskill problem

Beni Yoshida

Published Jun 29, 2021• 15 citations
arXivHTMLPDF

Abstract

The Hayden-Preskill recovery problem has provided useful insights on physics of quantum black holes as well as dynamics in quantum many-body systems from the viewpoint of quantum error-correcting codes. While finding an efficient universal information recovery procedure seems challenging, some interesting classes of dynamical systems may admit efficient recovery algorithms. Here we present simple deterministic recovery algorithms for the Hayden-Preskill problem when its unitary dynamics is given by a Clifford operator. The algorithms utilize generalized Bell measurements and apply feedback operations based on the measurement result. The recovery fidelity and the necessary feedback operation can be found by analyzing the operator growth. These algorithms can also serve as a decoding strategy for entanglement-assisted quantum error-correcting codes (EAQECCs). We also present a version of recovery algorithms with local Pauli basis measurements, which can be viewed as a many-body generalization of quantum teleportation with fault-tolerance. A certain relation between out-of-time order correlation functions and discrete Wigner functions is also discussed, which may be of independent interest.

DOI
10.48550/arxiv.2106.15628

Related papers

Decoding algorithms for Clifford Hayden-Preskill problem

Beni Yoshida

We present simple deterministic recovery algorithms for the Hayden-Preskill thought experiment when its unitary dynamics is given by a Clifford operator. The algorithms utilize generalized Bell measurements and apply feedback operations based on the measurement result. The recovery fidelity and the necessary feedback operation can be found by analyzing the operator growth. These algorithms can also serve as a decoding strategy for entanglement-assisted quantum error-correcting codes (EAQECCs). We also present a version of recovery algorithms with local Pauli basis measurements, which can be viewed as a many-body generalization of quantum teleportation with fault-tolerance. A certain relation between out-of-time order correlation functions and discrete Wigner functions is also discussed, which may be of independent interest.

•Jun 29, 2021•2 citations

Hayden-Preskill recovery in chaotic and integrable unitary circuit dynamics

Michael A. Rampp, Pieter W. Claeys

The Hayden-Preskill protocol probes the capability of information recovery from local subsystems after unitary dynamics. As such it resolves the capability of quantum many-body systems to dynamically implement a quantum error-correcting code. The transition to coding behavior has been mostly discussed using effective approaches, such as entanglement membrane theory. Here, we present exact results on the use of Hayden-Preskill recovery as a dynamical probe of scrambling in local quantum many-body systems. We investigate certain classes of unitary circuit models, both structured Floquet (dual-unitary) and Haar-random circuits. We discuss different dynamical signatures corresponding to information transport or scrambling, respectively, that go beyond effective approaches. Surprisingly, certain chaotic circuits transport information with perfect fidelity. In integrable dual-unitary circuits, we relate the information transmission to the propagation and scattering of quasiparticles. Using numerical and analytical insights, we argue that the qualitative features of information recovery extend away from these solvable points. Our results suggest that information recovery protocols can serve to distinguish chaotic and integrable behavior, and that they are sensitive to characteristic dynamical features, such as long-lived quasiparticles or dual-unitarity.

arXiv:2312.03838•Quantum•Aug 8, 2024•12 citations

Efficient decoding for the Hayden-Preskill protocol

Beni Yoshida, Alexei Kitaev

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.

arXiv:1710.03363•Oct 10, 2017•237 citations

Hayden--Preskill recovery at finite temperature on a quantum processor: dynamics and initial state from the SYK model

Jeongho Bang, Moongul Byun, Kyoungho Cho +2 more

In the original Hayden--Preskill recovery, the post-injection scrambler and initial state are {\it not related}. We extend this setup in two ways: by using a SWAP gate so that the scrambler and initial state are {\it related}, and by considering recovery at {\it finite} temperature. For this modified protocol, we show that the information is successfully recovered in the sense that the postselection probability is non-negligible and the conditional fidelity is large. We find that both the postselection probability and the conditional fidelity are proportional to temperature, reflecting the reduced entanglement of the initial state at lower temperatures. We also derive their late-time analytic estimates under the assumption of uniform operator spreading and show that they agree well with the numerical results. This demonstrates that strong scrambling is important for successful information recovery. Implementing the protocol on an IBM superconducting processor using a binary sparse SYK Hamiltonian with $N = 8$ Majoranas, we observe that the data retain the qualitative recovery dynamics and that a SWAP-based error-mitigation scheme improves both the postselection probability and the conditional fidelity.

hep-thCross-listedarXiv:2607.28486•Jul 31, 2026•1 citation

Hayden-Preskill recovery in Hamiltonian systems

Yoshifumi Nakata, Masaki Tezuka

Information scrambling refers to the unitary dynamics that quickly spreads and encodes localized quantum information over an entire many-body system and makes the information accessible from any small subsystem. While information scrambling is the key to understanding complex quantum many-body dynamics and is well-understood in random unitary models, it has been hardly explored in Hamiltonian systems. In this Letter, we investigate the information recovery in various time-independent Hamiltonian systems, including chaotic spin chains and Sachdev-Ye-Kitaev models. We show that information recovery is possible in certain, but not all, chaotic models, which highlights the difference between information recovery and quantum chaos based on the energy spectrum or the out-of-time-ordered correlators. We also show that information recovery probes transitions caused by the change of information-theoretic features of the dynamics. Published by the American Physical Society 2024

arXiv:2303.02010•Physical Review Research•Apr 25, 2024•10 citations

Repeated Extraction of Scrambled Quantum Data: Sustainability of the Hayden-Preskill Type Protocols

Seok Hyung Lie, Yong Siah Teo, Hyunseok Jeong

We introduce and study the problem of scrambler hacking, which is the procedure of quantum information extraction from and installation on a quantum scrambler given only partial access. This problem necessarily emerges from a central topic in contemporary physics - information recovery from systems undergoing scrambling dynamics, such as the Hayden-Preskill protocol in black hole studies - because one must replace quantum data with another when extracting it due to the no-cloning theorem. For large scramblers, we supply analytical formulas for the optimal hacking fidelity, a quantitative measure of the effectiveness of scrambler hacking with limited access. In the two-user scenario where Bob attempts to hack Alice's data, we find that the optimal fidelity converges to $64/(9π^2)\approx0.72$ with increasing Bob's hacking space relative to Alice's user space. We applied our results to the black hole information problem and showed that the limited hacking fidelity implies the reflectivity decay of a black hole as an information mirror, which questions the solvability of the black hole information paradox through the Hayden-Preskill type protocol.

arXiv:2204.00374•Apr 1, 2022•2 citations
The Hayden-Preskill recovery problem has provided useful insights on physics of quantum black holes as well as dynamics in quantum many-body systems from the viewpoint of quantum error-correcting codes. While finding an efficient universal information recovery procedure seems challenging, some interesting classes of dynamical systems may admit efficient recovery algorithms. Here we present simple deterministic recovery algorithms for the Hayden-Preskill problem when its unitary dynamics is given by a Clifford operator. The algorithms utilize generalized Bell measurements and apply feedback operations based on the measurement result. The recovery fidelity and the necessary feedback operation can be found by analyzing the operator growth. These algorithms can also serve as a decoding strategy for entanglement-assisted quantum error-correcting codes (EAQECCs). We also present a version of recovery algorithms with local Pauli basis measurements, which can be viewed as a many-body generalization of quantum teleportation with fault-tolerance. A certain relation between out-of-time order correlation functions and discrete Wigner functions is also discussed, which may be of independent interest.
We present simple deterministic recovery algorithms for the Hayden-Preskill thought experiment when its unitary dynamics is given by a Clifford operator. The algorithms utilize generalized Bell measurements and apply feedback operations based on the measurement result. The recovery fidelity and the necessary feedback operation can be found by analyzing the operator growth. These algorithms can also serve as a decoding strategy for entanglement-assisted quantum error-correcting codes (EAQECCs). We also present a version of recovery algorithms with local Pauli basis measurements, which can be viewed as a many-body generalization of quantum teleportation with fault-tolerance. A certain relation between out-of-time order correlation functions and discrete Wigner functions is also discussed, which may be of independent interest.
The Hayden-Preskill protocol probes the capability of information recovery from local subsystems after unitary dynamics. As such it resolves the capability of quantum many-body systems to dynamically implement a quantum error-correcting code. The transition to coding behavior has been mostly discussed using effective approaches, such as entanglement membrane theory. Here, we present exact results on the use of Hayden-Preskill recovery as a dynamical probe of scrambling in local quantum many-body systems. We investigate certain classes of unitary circuit models, both structured Floquet (dual-unitary) and Haar-random circuits. We discuss different dynamical signatures corresponding to information transport or scrambling, respectively, that go beyond effective approaches. Surprisingly, certain chaotic circuits transport information with perfect fidelity. In integrable dual-unitary circuits, we relate the information transmission to the propagation and scattering of quasiparticles. Using numerical and analytical insights, we argue that the qualitative features of information recovery extend away from these solvable points. Our results suggest that information recovery protocols can serve to distinguish chaotic and integrable behavior, and that they are sensitive to characteristic dynamical features, such as long-lived quasiparticles or dual-unitarity.
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 nnn 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/dA21/d_{A}^21/dA2​, where dAd_AdA​ 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 O(dAC)\mathcal{O}(d_{A}\mathcal{C})O(dA​C) where C\mathcal{C}C is the size of the quantum circuit implementing the unitary evolution operator UUU 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.
In the original Hayden--Preskill recovery, the post-injection scrambler and initial state are {\it not related}. We extend this setup in two ways: by using a SWAP gate so that the scrambler and initial state are {\it related}, and by considering recovery at {\it finite} temperature. For this modified protocol, we show that the information is successfully recovered in the sense that the postselection probability is non-negligible and the conditional fidelity is large. We find that both the postselection probability and the conditional fidelity are proportional to temperature, reflecting the reduced entanglement of the initial state at lower temperatures. We also derive their late-time analytic estimates under the assumption of uniform operator spreading and show that they agree well with the numerical results. This demonstrates that strong scrambling is important for successful information recovery. Implementing the protocol on an IBM superconducting processor using a binary sparse SYK Hamiltonian with N=8N = 8N=8 Majoranas, we observe that the data retain the qualitative recovery dynamics and that a SWAP-based error-mitigation scheme improves both the postselection probability and the conditional fidelity.
Information scrambling refers to the unitary dynamics that quickly spreads and encodes localized quantum information over an entire many-body system and makes the information accessible from any small subsystem. While information scrambling is the key to understanding complex quantum many-body dynamics and is well-understood in random unitary models, it has been hardly explored in Hamiltonian systems. In this Letter, we investigate the information recovery in various time-independent Hamiltonian systems, including chaotic spin chains and Sachdev-Ye-Kitaev models. We show that information recovery is possible in certain, but not all, chaotic models, which highlights the difference between information recovery and quantum chaos based on the energy spectrum or the out-of-time-ordered correlators. We also show that information recovery probes transitions caused by the change of information-theoretic features of the dynamics. Published by the American Physical Society 2024
We introduce and study the problem of scrambler hacking, which is the procedure of quantum information extraction from and installation on a quantum scrambler given only partial access. This problem necessarily emerges from a central topic in contemporary physics - information recovery from systems undergoing scrambling dynamics, such as the Hayden-Preskill protocol in black hole studies - because one must replace quantum data with another when extracting it due to the no-cloning theorem. For large scramblers, we supply analytical formulas for the optimal hacking fidelity, a quantitative measure of the effectiveness of scrambler hacking with limited access. In the two-user scenario where Bob attempts to hack Alice's data, we find that the optimal fidelity converges to 64/(9π2)≈0.7264/(9π^2)\approx0.7264/(9π2)≈0.72 with increasing Bob's hacking space relative to Alice's user space. We applied our results to the black hole information problem and showed that the limited hacking fidelity implies the reflectivity decay of a black hole as an information mirror, which questions the solvability of the black hole information paradox through the Hayden-Preskill type protocol.