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:2312.03838 · Quantum

Hayden-Preskill recovery in chaotic and integrable unitary circuit dynamics

Michael A. Rampp, Pieter W. Claeys

Published Aug 8, 2024• 12 citations
arXivHTMLPDF

Abstract

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.

DOI
10.22331/q-2024-08-08-1434

Related papers

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

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 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

Simulating Floquet scrambling circuits on trapped-ion quantum computers

Kazuhiro Seki, Yuta Kikuchi, Tomoya Hayata +1 more

Complex quantum many-body dynamics spread initially localized quantum information across the entire system. Information scrambling refers to such a process whose simulation is one of the promising applications of quantum computing. We demonstrate the Hayden-Preskill recovery protocol and the interferometric protocol for calculating out-of-time-ordered correlators to study the scrambling property of a one-dimensional kicked-Ising model on 20-qubit trapped-ion quantum processors. The simulated quantum circuits have a geometrically local structure that exhibits the ballistic growth of entanglement, resulting in the circuit depth being linear in the number of qubits for the entire state to be scrambled. We experimentally confirm the growth of signals in the Hayden-Preskill recovery protocol and the decay of out-of-time-ordered correlators at late times. As an application of the created scrambling circuits, we also experimentally demonstrate the calculation of the microcanonical expectation values of local operators adopting the idea of thermal pure quantum states. Our experiments are made possible by extensively utilizing one of the highest-fidelity quantum processors currently available and, thus, should be considered as a benchmark for the current status of the most advanced quantum computers.

arXiv:2405.07613•Physical Review Research•Apr 10, 2025•16 citations

Entanglement in dual unitary quantum circuits with impurities

Shachar Fraenkel, Colin Rylands

Bipartite entanglement entropy is one of the most useful characterizations of universal properties in a many-body quantum system. Far from equilibrium, there exist two highly effective theories describing its dynamics -- the quasiparticle and membrane pictures. In this work we investigate entanglement dynamics, and these two complementary approaches, in a quantum circuit model perturbed by an impurity. In particular, we consider a dual unitary quantum circuit containing a spatially fixed, non-dual-unitary impurity gate, allowing for differing local Hilbert space dimensions to either side. We compute the entanglement entropy for both a semi-infinite and a finite subsystem within a finite distance of the impurity, comparing exact results to predictions of the effective theories. We find that for a semi-infinite subsystem, both theories agree with each other and the exact calculation. For a finite subsystem, however, both theories qualitatively differ, with the quasiparticle picture predicting a non-monotonic growth in contrast to the membrane picture. We show that such non-monotonic behavior can arise even in random chaotic circuits, shedding light on the range of validity of the membrane picture in such systems.

arXiv:2410.03442•Physical review. B./Physical review. B•Jul 7, 2025•6 citations

Microscopic Side Information Controls Ordered Hayden--Preskill Recovery

Joao V. R. Alencar, Allan R. P. Moreira, Joao B. R. Silva

In the Hayden--Preskill protocol, the decoder is usually assumed to know the microscopic identity of the collected output qubits. We study what happens when these labels are unavailable and only the relative order of the received qubits is preserved. The resulting order-preserving deletion channel maps an $n$-qubit scrambled register to a subsequence of length $\ell$. For a diary of fixed size $k$, we prove that the optimal entanglement fidelity converges to the no-output value $4^{-k}$ when $\ell=o(n^{2/3})$, uniformly over the scrambling unitary. For a Haar-random scrambling unitary, it converges to one when $\ell=ω(n^{2/3})$ and $\ell=o(n)$. Monotonicity then gives the fixed-error recovery scale $\ell_{\mathrm{rec}}=Θ(n^{2/3})$. We also consider partial position information obtained by dividing the register into $B$ consecutive blocks and revealing the block of origin of each received qubit. The recovery scale becomes $\ell_{\mathrm{rec}}(n,B)\asymp n^{2/3}B^{-1/3}$ for $B\leq\sqrt n$ and $\ell_{\mathrm{rec}}(n,B)\asymp n/B$ for $B\geq\sqrt n$. The exponent $2/3$ is traced to rank-aligned coincidences between random subsequences, which control both the converse and the recovery argument. Thus, even purely classical information about the origin of the received subsystems can change the amount of quantum output required for Hayden--Preskill recovery.

quant-pharXiv:2607.15537•Jul 20, 2026•0 citations
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.
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
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.
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.
Complex quantum many-body dynamics spread initially localized quantum information across the entire system. Information scrambling refers to such a process whose simulation is one of the promising applications of quantum computing. We demonstrate the Hayden-Preskill recovery protocol and the interferometric protocol for calculating out-of-time-ordered correlators to study the scrambling property of a one-dimensional kicked-Ising model on 20-qubit trapped-ion quantum processors. The simulated quantum circuits have a geometrically local structure that exhibits the ballistic growth of entanglement, resulting in the circuit depth being linear in the number of qubits for the entire state to be scrambled. We experimentally confirm the growth of signals in the Hayden-Preskill recovery protocol and the decay of out-of-time-ordered correlators at late times. As an application of the created scrambling circuits, we also experimentally demonstrate the calculation of the microcanonical expectation values of local operators adopting the idea of thermal pure quantum states. Our experiments are made possible by extensively utilizing one of the highest-fidelity quantum processors currently available and, thus, should be considered as a benchmark for the current status of the most advanced quantum computers.
Bipartite entanglement entropy is one of the most useful characterizations of universal properties in a many-body quantum system. Far from equilibrium, there exist two highly effective theories describing its dynamics -- the quasiparticle and membrane pictures. In this work we investigate entanglement dynamics, and these two complementary approaches, in a quantum circuit model perturbed by an impurity. In particular, we consider a dual unitary quantum circuit containing a spatially fixed, non-dual-unitary impurity gate, allowing for differing local Hilbert space dimensions to either side. We compute the entanglement entropy for both a semi-infinite and a finite subsystem within a finite distance of the impurity, comparing exact results to predictions of the effective theories. We find that for a semi-infinite subsystem, both theories agree with each other and the exact calculation. For a finite subsystem, however, both theories qualitatively differ, with the quasiparticle picture predicting a non-monotonic growth in contrast to the membrane picture. We show that such non-monotonic behavior can arise even in random chaotic circuits, shedding light on the range of validity of the membrane picture in such systems.
In the Hayden--Preskill protocol, the decoder is usually assumed to know the microscopic identity of the collected output qubits. We study what happens when these labels are unavailable and only the relative order of the received qubits is preserved. The resulting order-preserving deletion channel maps an nnn-qubit scrambled register to a subsequence of length ℓ\ellℓ. For a diary of fixed size kkk, we prove that the optimal entanglement fidelity converges to the no-output value 4−k4^{-k}4−k when ℓ=o(n2/3)\ell=o(n^{2/3})ℓ=o(n2/3), uniformly over the scrambling unitary. For a Haar-random scrambling unitary, it converges to one when ℓ=ω(n2/3)\ell=ω(n^{2/3})ℓ=ω(n2/3) and ℓ=o(n)\ell=o(n)ℓ=o(n). Monotonicity then gives the fixed-error recovery scale ℓrec=Θ(n2/3)\ell_{\mathrm{rec}}=Θ(n^{2/3})ℓrec​=Θ(n2/3). We also consider partial position information obtained by dividing the register into BBB consecutive blocks and revealing the block of origin of each received qubit. The recovery scale becomes ℓrec(n,B)≍n2/3B−1/3\ell_{\mathrm{rec}}(n,B)\asymp n^{2/3}B^{-1/3}ℓrec​(n,B)≍n2/3B−1/3 for B≤nB\leq\sqrt nB≤n​ and ℓrec(n,B)≍n/B\ell_{\mathrm{rec}}(n,B)\asymp n/Bℓrec​(n,B)≍n/B for B≥nB\geq\sqrt nB≥n​. The exponent 2/32/32/3 is traced to rank-aligned coincidences between random subsequences, which control both the converse and the recovery argument. Thus, even purely classical information about the origin of the received subsystems can change the amount of quantum output required for Hayden--Preskill recovery.