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

Decoding algorithms for Clifford Hayden-Preskill problem

Beni Yoshida

Published Jun 29, 2021• 2 citations
OpenAlex

Abstract

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.

Related papers

Recovery algorithms for Clifford Hayden-Preskill problem

Beni Yoshida

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.

arXiv:2106.15628•Jun 29, 2021•15 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

Decoding the Entanglement Structure of Monitored Quantum Circuits

Beni Yoshida

Given an output wavefunction of a monitored quantum circuit consisting of both unitary gates and projective measurements, we ask whether two complementary subsystems are entangled or not. For Clifford circuits, we find that this question can be mapped to a certain classical error-correction problem where various entanglement measures can be explicitly computed from the recoverability. The dual classical code is constructed from spacetime patterns of out-of-time ordered correlation functions among local operators and measured Pauli operators in the past, suggesting that the volume-law entanglement in a monitored circuit emerges from quantum information scrambling, namely the growth of local operators. We also present a method of verifying quantum entanglement by providing a simple deterministic entanglement distillation algorithm, which can be interpreted as decoding of the dual classical code. Discussions on coding properties of a monitored Clifford circuit, including explicit constructions of logical and stabilizer operators, are also presented. Applications of our framework to various physical questions, including non-Clifford systems, are discussed as well. Namely, we argue that the entanglement structure of a monitored quantum circuit in the volume-law phase is largely independent of the initial states and past measurement outcomes except recent ones, due to the decoupling phenomena from scrambling dynamics, up to a certain polynomial length scale which can be identified as the code distance of the circuit. We also derive a general relation between the code distance and the sub-leading contribution to the volume-law entanglement entropy. Applications of these results to black hole physics are discussed as well.

arXiv:2109.08691•Sep 17, 2021•24 citations

Measurement and feedforward circuits from quantum error correcting codes

Georgios Styliaris, Rahul Trivedi

Measurements and feedforward enhance the power of shallow quantum circuits, enabling the deterministic implementation of global unitary operations and the preparation of long-range entangled states. We establish a general correspondence between all such protocols and quantum error-correcting codes: the circuit preceding the measurements acts as an encoder, and unitary feedforward can eliminate post-selection if and only if the measurement projectors are detectable errors on the codespace. This correspondence provides a common framework for state preparation and implementation of global unitaries with measurements and feedforward, turning both into a code-design problem. For stabilizer codes with Pauli measurements, although the resulting operation can be non-Clifford, we show that its nonstabilizerness originates entirely from the encoder. We overcome this restriction using non-Pauli measurements or non-additive codes, constructing protocols that generate long-range nonstabilizerness while requiring only single-qubit unitary corrections.

quant-pharXiv:2609.39764•Oct 1, 2026•0 citations
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 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.
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.
Given an output wavefunction of a monitored quantum circuit consisting of both unitary gates and projective measurements, we ask whether two complementary subsystems are entangled or not. For Clifford circuits, we find that this question can be mapped to a certain classical error-correction problem where various entanglement measures can be explicitly computed from the recoverability. The dual classical code is constructed from spacetime patterns of out-of-time ordered correlation functions among local operators and measured Pauli operators in the past, suggesting that the volume-law entanglement in a monitored circuit emerges from quantum information scrambling, namely the growth of local operators. We also present a method of verifying quantum entanglement by providing a simple deterministic entanglement distillation algorithm, which can be interpreted as decoding of the dual classical code. Discussions on coding properties of a monitored Clifford circuit, including explicit constructions of logical and stabilizer operators, are also presented. Applications of our framework to various physical questions, including non-Clifford systems, are discussed as well. Namely, we argue that the entanglement structure of a monitored quantum circuit in the volume-law phase is largely independent of the initial states and past measurement outcomes except recent ones, due to the decoupling phenomena from scrambling dynamics, up to a certain polynomial length scale which can be identified as the code distance of the circuit. We also derive a general relation between the code distance and the sub-leading contribution to the volume-law entanglement entropy. Applications of these results to black hole physics are discussed as well.
Measurements and feedforward enhance the power of shallow quantum circuits, enabling the deterministic implementation of global unitary operations and the preparation of long-range entangled states. We establish a general correspondence between all such protocols and quantum error-correcting codes: the circuit preceding the measurements acts as an encoder, and unitary feedforward can eliminate post-selection if and only if the measurement projectors are detectable errors on the codespace. This correspondence provides a common framework for state preparation and implementation of global unitaries with measurements and feedforward, turning both into a code-design problem. For stabilizer codes with Pauli measurements, although the resulting operation can be non-Clifford, we show that its nonstabilizerness originates entirely from the encoder. We overcome this restriction using non-Pauli measurements or non-additive codes, constructing protocols that generate long-range nonstabilizerness while requiring only single-qubit unitary corrections.