pith. sign in

arxiv: 2501.16335 · v4 · submitted 2025-01-04 · 🪐 quant-ph

Experimental simulation of postselected closed timelike curves for decoding scrambled quantum information

Yi-Te Huang , Hsiang-Wei Huang , Jhen-Dong Lin , Adam Miranowicz , Neill Lambert , Guang-Yin Chen , Franco Nori , Yueh-Nan Chen This is my paper

Pith reviewed 2026-05-23 06:39 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum information scramblingpostselected closed timelike curvesout-of-time-ordered correlationsquantum circuitsquantum processorsinformation decoding
0
0 comments X

The pith

Postselection on a final measurement lets a quantum circuit decode scrambled information before the information is generated.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a circuit protocol in which conditioning on one specific postselected outcome turns an ordinary quantum experiment into a simulation of a closed timelike curve. Under that conditioning the scrambled data can be recovered even though the original local information has not yet been encoded. The probability that the postselected outcome occurs is set by out-of-time-ordered correlations, the usual diagnostic of scrambling. The protocol was run on cloud quantum processors, showing that the time-loop interpretation is experimentally realizable. The result supplies a concrete, causally consistent way to retrieve future-to-past scrambled information when postselection is allowed.

Core claim

When a quantum circuit is conditioned on a chosen final measurement outcome, the same circuit can be re-interpreted as a paradox-free closed timelike curve that decodes globally scrambled information prior to its initial local encoding; the success probability of this decoding is fixed by out-of-time-ordered correlations.

What carries the argument

Postselected closed timelike curves (PCTCs), which re-interpret an ordinary quantum circuit plus postselection as a consistent time-loop trajectory that recovers scrambled information.

If this is right

  • Success probability of the PCTC decoding is governed by out-of-time-ordered correlations.
  • The protocol can be executed on present-day cloud quantum processors.
  • Conditioned on the postselected outcome, information recovery occurs prior to encoding.
  • The circuit supplies a causally consistent simulation of future-to-past scrambled-information retrieval.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same postselection technique might be applied to other scrambling diagnostics beyond out-of-time-ordered correlations.
  • If postselection can be replaced by a deterministic operation, the time-loop interpretation would extend to non-postselected circuits.

Load-bearing premise

Postselection on a final measurement outcome can be treated as creating a consistent, paradox-free closed timelike curve that decodes information before the information is encoded.

What would settle it

An experiment in which the observed frequency of the postselected outcome fails to match the independently measured out-of-time-ordered correlation or in which the recovered information is inconsistent with the claimed pre-encoding decoding.

Figures

Figures reproduced from arXiv: 2501.16335 by Adam Miranowicz, Franco Nori, Guang-Yin Chen, Hsiang-Wei Huang, Jhen-Dong Lin, Neill Lambert, Yi-Te Huang, Yueh-Nan Chen.

Figure 1
Figure 1. Figure 1: Our protocol includes three main steps: (1) en￾coding quantum information using QIS, (2) time-travel part of the encoded information into the past via a PCTC, and (3) decoding the original information. We begin with Alice (A), who prepares an arbitrary pure quantum state |ψð with Hilbert space dimension dA at time T1. As time progresses from T1 to T2, sys￾tem A interacts with a chronology-respecting many-b… view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2 [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4 [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
read the original abstract

Quantum information scrambling (QIS) describes the rapid spread of initially localized information across an entire quantum many-body system through entanglement generation. Once scrambled, the original local information becomes encoded globally, inaccessible from any single subsystem. In this work, we introduce a circuit-based decoding protocol. By utilizing the concept of postselected closed timelike curves (PCTCs), we demonstrate how postselection allows us to interpret an ordinary quantum experiment as an example of a paradox-free trajectory, simulating a consistent time loop and reliable information recovery. Specifically, when conditioned on a final postselected outcome, this experiment can be interpreted as decoding the scrambled information even before the original information is generated. Furthermore, the success probability of the PCTC is governed by out-of-time-ordered correlations, which is a standard measure of QIS. We experimentally implement our protocol on cloud-based Quantinuum and IBM quantum processors. Our approach illuminates a unique quantum task under postselection: the causally consistent simulation of future-to-past scrambled information retrieval.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The paper introduces a circuit-based protocol that uses postselection on a final measurement outcome to interpret an ordinary quantum circuit as a paradox-free postselected closed timelike curve (PCTC). Conditioned on this outcome, the protocol is claimed to decode scrambled quantum information even before the encoding unitary acts, with the success probability governed by out-of-time-ordered correlations (OTOCs). The protocol is experimentally realized on Quantinuum and IBM quantum processors.

Significance. If the postselection is shown to enforce a self-consistent CTC boundary condition that recovers the input state prior to encoding, the work would provide the first experimental simulation of CTC-assisted decoding in a scrambling context and would establish a direct operational link between OTOCs and postselected success probabilities. This could open a new experimental window on quantum causality and information recovery under postselection.

major comments (2)
  1. [Protocol description and circuit construction] The central claim that the postselected circuit yields a consistent CTC trajectory whose statistics decode the scrambled state before encoding requires an explicit derivation of the self-consistency condition (analogous to Deutsch or postselected CTC fixed-point equations). No such derivation appears in the protocol section; without it the conditional probabilities may reduce to ordinary postselected teleportation rather than pre-encoding recovery.
  2. [Success probability and OTOC relation] The statement that the PCTC success probability is governed by OTOCs is presented as a derived result, yet the abstract and protocol text provide no calculation showing that the probability equals a specific OTOC (e.g., the four-point correlator) rather than being tautological with the postselection projector. This relation must be derived explicitly before the claim can be used to interpret the experimental data.
minor comments (3)
  1. [Figures and experimental implementation] Figure captions and circuit diagrams should explicitly label the postselection measurement and the scrambling unitary so that the causal ordering is unambiguous.
  2. [Experimental results] The manuscript should include a short comparison table of the observed success probabilities against the theoretically predicted OTOC values for the chosen scrambling unitaries.
  3. [Introduction] A reference to the original Deutsch CTC model and to postselected teleportation literature would clarify the novelty of the consistency condition used here.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the constructive comments, which help clarify the presentation of the PCTC protocol and its connection to OTOCs. We address each major comment below.

read point-by-point responses

  1. Referee: [Protocol description and circuit construction] The central claim that the postselected circuit yields a consistent CTC trajectory whose statistics decode the scrambled state before encoding requires an explicit derivation of the self-consistency condition (analogous to Deutsch or postselected CTC fixed-point equations). No such derivation appears in the protocol section; without it the conditional probabilities may reduce to ordinary postselected teleportation rather than pre-encoding recovery.

    Authors: We agree that an explicit derivation of the self-consistency condition is required to rigorously establish the PCTC interpretation. The manuscript constructs the circuit to simulate a paradox-free trajectory under postselection but does not derive the fixed-point equation in the protocol section. In the revised version we will add this derivation, showing how the postselected measurement enforces the boundary condition that recovers the input state prior to the encoding unitary, thereby distinguishing the protocol from standard postselected teleportation. revision: yes

  2. Referee: [Success probability and OTOC relation] The statement that the PCTC success probability is governed by OTOCs is presented as a derived result, yet the abstract and protocol text provide no calculation showing that the probability equals a specific OTOC (e.g., the four-point correlator) rather than being tautological with the postselection projector. This relation must be derived explicitly before the claim can be used to interpret the experimental data.

    Authors: We acknowledge that the manuscript states the success probability is governed by OTOCs without supplying the explicit calculation linking it to a four-point correlator. We will add this derivation in the revised manuscript, computing the postselection probability in terms of the relevant OTOC to enable direct interpretation of the Quantinuum and IBM experimental results. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation remains self-contained

full rationale

The paper presents a circuit-based protocol that interprets postselected measurements as simulating paradox-free PCTC trajectories for pre-encoding recovery of scrambled information, with success probability stated to be governed by OTOCs. This link is framed as using a pre-existing standard measure of QIS rather than deriving the probability from a fitted parameter or self-referential definition. No equations or steps in the abstract reduce the central interpretive claim or experimental results to an input by construction; the quantum-processor implementation supplies an independent empirical test. The postselection consistency assumption is an interpretive modeling choice, not a self-definitional equivalence. The derivation chain therefore does not collapse under any of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

Central claim rests on interpreting postselection as a consistent CTC simulation and on OTOCs as the governing quantity; both are domain-standard but the specific mapping is introduced here.

axioms (2)
  • domain assumption Postselection on quantum measurement outcomes can be interpreted as realizing a paradox-free closed timelike curve
    Invoked to justify the time-loop decoding interpretation
  • standard math Out-of-time-ordered correlations quantify quantum information scrambling
    Standard in the field and used to link success probability to scrambling
invented entities (1)
  • Postselected closed timelike curves (PCTCs) no independent evidence
    purpose: To frame postselected quantum circuits as consistent time-loop simulators for information decoding
    Conceptual construct introduced to enable the before-generation decoding claim

pith-pipeline@v0.9.0 · 5731 in / 1333 out tokens · 26849 ms · 2026-05-23T06:39:05.403194+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

89 extracted references · 89 canonical work pages · 2 internal anchors

  1. [1]

    We begin with Alice (A), who prepares an arbitrary pure quantum state |ψð with Hilbert space dimension dA at time T1

    Our protocol includes three main steps: (1) en- coding quantum information using QIS, (2) time-travel part of the encoded information into the past via a PCTC, and (3) decoding the original information. We begin with Alice (A), who prepares an arbitrary pure quantum state |ψð with Hilbert space dimension dA at time T1. As time progresses from T1 to T2, sy...

    work page

  2. [2]

    If the initial state of E and E’ at T0 is a maximally entangled state, E’ can be interpreted as a mirror of E that travels backward in time [ 55, 56]. Fur- 3 thermore, it is necessary to perform a projective (or se- lective) measurement on the joint system EE’ at T2, and the measurement outcome must remain consistent with itself (the same state) at T0 to ...

    work page

  3. [3]

    can be di- rectly calculated by the success probability P(ψ) of time travel in our decoding protocol [ 47]: Oavg = ∫ ∫ dW dV O(W, V ) = ∫ dψP(ψ) (10) (see Methods). Here, the double integral represents the Haar average over all unitary operators W and V on the corresponding subsystems, and the single integral aver- ages over all initial states |ψð in our ...

    work page

  4. [4]

    Note that the calibration data of this processor is presented in the Supplementary Information

    The circuit is imple- mented using Quantinuum H1-1 quantum charge-coupled processor, which features 20 trapped-ion ( 171Yb+) qubits with all-to-all connectivity [ 73]. Note that the calibration data of this processor is presented in the Supplementary Information. In the following, we explain the circuit in detail in the laboratory’s rest frame (from T0 to...

    work page

  5. [5]

    After applying the decoding operation U † to the joint system HE, we perform quantum state tomography (i.e., single-qubit Pauli measurements [ 74]) on qubit B before T1

    with dA = 2: |Φ+ðEE’ = 1√ 2 (|0ðE ¹ |0ðE’ + |1ðE ¹ |1ðE’) , (11) which is a Bell state [ 74]. After applying the decoding operation U † to the joint system HE, we perform quantum state tomography (i.e., single-qubit Pauli measurements [ 74]) on qubit B before T1. To ensure the information is from the future, we reset qubit B and then prepare a pure quantu...

    work page

  6. [6]

    According to Eq

    The success probability for an arbitrary state |ψð under the scrambler Uq is P(ψ) = 0 .25. According to Eq. ( 8), this leads to an estimated fidelity of unity for any state |ψð, indicating perfect decoding. FIG. 4. Circuit representation of the three-qubit Clif- ford scrambler. This scrambling unitary operator includes six controlled- Z and three Hadamard ...

    work page

  7. [7]

    2(a)], the unitary operator W in Eq

    Because the EPR projection oper- ator is applied to the joint system EE’ at T2 [as shown in Fig. 2(a)], the unitary operator W in Eq. ( 19) should act on system E. Therefore, the OTOC ïW †(t)V †W (t)V ð in Eq. ( 21) can be interpreted as the overlap between the following two states: WE(t)VA|φ0ðA ¹ |EPRðEE’ ¹ |EPRðHH’ =U † HE→BHWEUAH→HEVA × |φ0ðA ¹ |EPRðEE...

    work page

  8. [8]

    represents the inverse version of our protocol, where the direction of all time- lines (as indicated by the arrows in Fig

    work page

  9. [9]

    As time proceeds backward from T1 to T0, Bob encodes the state |φ0ðB into the joint system HE using the scrambling operation ( U † BH→HE)† = UBH→HE

    is reversed. As time proceeds backward from T1 to T0, Bob encodes the state |φ0ðB into the joint system HE using the scrambling operation ( U † BH→HE)† = UBH→HE. After system E trav- els forward in time from T0 to T2 through the PCTC, the perturbation WE is applied to system E, and the tempo- ral direction is again reversed at T2. As time proceeds backwar...

    work page 2019

  10. [10]

    Xu and B

    S. Xu and B. Swingle, Scrambling Dynamics and Out-of- Time-Ordered Correlators in Quantum Many-Body Sys- tems, PRX Quantum 5, 010201 (2024)

    work page 2024

  11. [11]

    Swingle, Unscrambling the physics of out-of-time- order correlators, Nat

    B. Swingle, Unscrambling the physics of out-of-time- order correlators, Nat. Phys. 14, 988 (2018)

    work page 2018

  12. [12]

    Iyoda and T

    E. Iyoda and T. Sagawa, Scrambling of quantum infor- mation in quantum many-body systems, Phys. Rev. A 97, 042330 (2018)

    work page 2018

  13. [13]

    D. Ding, P. Hayden, and M. Walter, Conditional mutual information of bipartite unitaries and scrambling, J. High Energy Phys. 2016, 145 (2016)

    work page 2016

  14. [14]

    Yunger Halpern, B

    N. Yunger Halpern, B. Swingle, and J. Dressel, Quasiprobability behind the out-of-time-ordered corre- lator, Phys. Rev. A 97, 042105 (2018)

    work page 2018

  15. [15]

    Pappalardi, A

    S. Pappalardi, A. Russomanno, B. ˇZunkoviˇ c, F. Iemini, A. Silva, and R. Fazio, Scrambling and entanglement spreading in long-range spin chains, Phys. Rev. B 98, 134303 (2018)

    work page 2018

  16. [16]

    Touil and S

    A. Touil and S. Deffner, Quantum scrambling and the growth of mutual information, Quantum Sci. Technol. 5, 035005 (2020)

    work page 2020

  17. [17]

    Lin, W.-Y

    J.-D. Lin, W.-Y. Lin, H.-Y. Ku, N. Lambert, Y.-N. Chen, and F. Nori, Quantum steering as a witness of quantum scrambling, Phys. Rev. A 104, 022614 (2021)

    work page 2021

  18. [18]

    K. K. Sharma and V. P. Gerdt, Quantum informa- tion scrambling and entanglement in bipartite quantum states, Quantum Inf. Process. 20, 195 (2021)

    work page 2021

  19. [19]

    Harris, B

    J. Harris, B. Yan, and N. A. Sinitsyn, Benchmarking Information Scrambling, Phys. Rev. Lett. 129, 050602 (2022)

    work page 2022

  20. [20]

    Zhu et al

    Q. Zhu et al. , Observation of Thermalization and Infor- mation Scrambling in a Superconducting Quantum Pro- cessor, Phys. Rev. Lett. 128, 160502 (2022)

    work page 2022

  21. [21]

    G. L. Monaco, L. Innocenti, D. Cilluffo, D. A. Chisholm, S. Lorenzo, and G. M. Palma, An operational definition of quantum information scrambling, arXiv:2312.11619 (2023)

    work page arXiv 2023

  22. [22]

    R. J. Garcia, K. Bu, and A. Jaffe, Resource theory of quantum scrambling, Proc. Natl. Acad. Sci. 120, e2217031120 (2023)

    work page 2023

  23. [23]

    Hosur, X.-L

    P. Hosur, X.-L. Qi, D. A. Roberts, and B. Yoshida, Chaos in quantum channels, J. High Energy Phys. 2016, 4 9 (2016)

    work page 2016

  24. [24]

    Seshadri, V

    A. Seshadri, V. Madhok, and A. Lakshminarayan, Tri- partite mutual information, entanglement, and scram- bling in permutation symmetric systems with an applica- tion to quantum chaos, Phys. Rev. E 98, 052205 (2018)

    work page 2018

  25. [25]

    Dowling, P

    N. Dowling, P. Kos, and K. Modi, Scrambling Is Neces- sary but Not Sufficient for Chaos, Phys. Rev. Lett. 131, 180403 (2023)

    work page 2023

  26. [26]

    Maldacena and D

    J. Maldacena and D. Stanford, Remarks on the Sachdev- Ye-Kitaev model, Phys. Rev. D 94, 106002 (2016)

    work page 2016

  27. [27]

    Nahum, J

    A. Nahum, J. Ruhman, S. Vijay, and J. Haah, Quantum entanglement growth under random unitary dynamics, Phys. Rev. X 7, 031016 (2017)

    work page 2017

  28. [28]

    C. W. von Keyserlingk, T. Rakovszky, F. Pollmann, and S. L. Sondhi, Operator hydrodynamics, OTOCs, and en- tanglement growth in systems without conservation laws, Phys. Rev. X 8, 021013 (2018)

    work page 2018

  29. [29]

    Cotler, N

    J. Cotler, N. Hunter-Jones, J. Liu, and B. Yoshida, Chaos, complexity, and random matrices, J. High Energy Phys. 2017, 48 (2017)

    work page 2017

  30. [30]

    R. Fan, P. Zhang, H. Shen, and H. Zhai, Out-of-time- order correlation for many-body localization, Sci. Bull. 62, 707 (2017)

    work page 2017

  31. [31]

    Gu, X.-L

    Y. Gu, X.-L. Qi, and D. Stanford, Local criticality, diffu- sion and chaos in generalized Sachdev-Ye-Kitaev models, J. High Energy Phys. 2017, 125 (2017)

    work page 2017

  32. [32]

    Khemani, A

    V. Khemani, A. Vishwanath, and D. A. Huse, Operator spreading and the emergence of dissipative hydrodynam- ics under unitary evolution with conservation laws, Phys. Rev. X 8, 031057 (2018)

    work page 2018

  33. [33]

    Zonnios, J

    M. Zonnios, J. Levinsen, M. M. Parish, F. A. Pollock, and K. Modi, Signatures of Quantum Chaos in an Out-of- Time-Order Tensor, Phys. Rev. Lett. 128, 150601 (2022)

    work page 2022

  34. [34]

    Tezuka, O

    M. Tezuka, O. Oktay, E. Rinaldi, M. Hanada, and F. Nori, Binary-coupling sparse Sachdev-Ye-Kitaev model: An improved model of quantum chaos and holog- raphy, Phys. Rev. B 107, L081103 (2023)

    work page 2023

  35. [35]

    Bin, L.-L

    Q. Bin, L.-L. Wan, F. Nori, Y. Wu, and X.-Y. L¨ u, Out-of- time-order correlation as a witness for topological phase transitions, Phys. Rev. B 107, L020202 (2023)

    work page 2023

  36. [36]

    J. R. G. Alonso, N. Shammah, S. Ahmed, F. Nori, and J. Dressel, Diagnosing quantum chaos with out-of- time-ordered-correlator quasiprobability in the kicked- top model, arXiv:2201.08175 (2022)

    work page arXiv 2022

  37. [37]

    Hayden and J

    P. Hayden and J. Preskill, Black holes as mirrors: Quan- tum information in random subsystems, J. High Energy Phys. 2007, 120 (2007)

    work page 2007

  38. [38]

    Sekino and L

    Y. Sekino and L. Susskind, Fast scramblers, J. High En- ergy Phys. 2008, 065 (2008)

    work page 2008

  39. [39]

    Lashkari, D

    N. Lashkari, D. Stanford, M. Hastings, T. Osborne, and P. Hayden, Towards the fast scrambling conjecture, J. High Energy Phys. 2013, 22 (2013)

    work page 2013

  40. [40]

    S. H. Shenker and D. Stanford, Black holes and the but- terfly effect, J. High Energy Phys. 2014, 67 (2014)

    work page 2014

  41. [41]

    D. A. Roberts and D. Stanford, Diagnosing chaos using four-point functions in two-dimensional conformal field theory, Phys. Rev. Lett. 115, 131603 (2015)

    work page 2015

  42. [42]

    Blake, Universal charge diffusion and the butterfly ef- fect in holographic theories, Phys

    M. Blake, Universal charge diffusion and the butterfly ef- fect in holographic theories, Phys. Rev. Lett. 117, 091601 (2016)

    work page 2016

  43. [43]

    P. Gao, D. L. Jafferis, and A. C. Wall, Traversable worm- holes via a double trace deformation, J. High Energy Phys. 2017, 151 (2017)

    work page 2017

  44. [44]

    Maldacena, D

    J. Maldacena, D. Stanford, and Z. Yang, Diving into traversable wormholes, Fortschr. Phys. 65, 1700034 (2017)

    work page 2017

  45. [45]

    B. Chen, B. Czech, and Z.-Z. Wang, Quantum informa- tion in holographic duality, Rep. Prog. Phys. 85, 046001 (2022)

    work page 2022

  46. [46]

    Liu, Scrambling and decoding the charged quantum information, Phys

    J. Liu, Scrambling and decoding the charged quantum information, Phys. Rev. Res. 2, 043164 (2020)

    work page 2020

  47. [47]

    Rinaldi, X

    E. Rinaldi, X. Han, M. Hassan, Y. Feng, F. Nori, M. McGuigan, and M. Hanada, Matrix-Model Simula- tions Using Quantum Computing, Deep Learning, and Lattice Monte Carlo, PRX Quantum 3, 010324 (2022)

    work page 2022

  48. [48]

    P. D. Nation, M. P. Blencowe, and F. Nori, Non- equilibrium Landauer transport model for Hawking radi- ation from a black hole, New J. Phys. 14, 033013 (2012)

    work page 2012

  49. [49]

    Y. Li, X. Li, and J. Jin, Information scrambling in a collision model, Phys. Rev. A 101, 042324 (2020)

    work page 2020

  50. [50]

    Y. Li, X. Li, and J. Jin, Dissipation-Induced Information Scrambling in a Collision Model, Entropy 24, 345 (2022)

    work page 2022

  51. [51]

    F. Tian, J. Zou, H. Li, L. Han, and B. Shao, Relationship between Information Scrambling and Quantum Darwin- ism, Entropy 26, 19 (2024)

    work page 2024

  52. [52]

    H. Shen, P. Zhang, Y.-Z. You, and H. Zhai, Information Scrambling in Quantum Neural Networks, Phys. Rev. Lett. 124, 200504 (2020)

    work page 2020

  53. [53]

    S. Choi, Y. Bao, X.-L. Qi, and E. Altman, Quan- tum Error Correction in Scrambling Dynamics and Measurement-Induced Phase Transition, Phys. Rev. Lett. 125, 030505 (2020)

    work page 2020

  54. [54]

    Z. Li, H. Zheng, Y. Wang, L. Jiang, Z.-W. Liu, and J. Liu, SU(d)-Symmetric random unitaries: Quan- tum scrambling, error correction, and machine learning, arXiv:2309.16556 (2023)

    work page arXiv 2023

  55. [55]

    Yan and N

    B. Yan and N. A. Sinitsyn, Recovery of Damaged Infor- mation and the Out-of-Time-Ordered Correlators, Phys. Rev. Lett. 125, 040605 (2020)

    work page 2020

  56. [56]

    Efficient decoding for the Hayden-Preskill protocol

    B. Yoshida and A. Kitaev, Efficient decoding for the Hayden-Preskill protocol, arXiv:1710.03363 (2017)

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  57. [57]

    Yoshida and N

    B. Yoshida and N. Y. Yao, Disentangling Scrambling and Decoherence via Quantum Teleportation, Phys. Rev. X 9, 011006 (2019)

    work page 2019

  58. [58]

    Bao and Y

    N. Bao and Y. Kikuchi, Hayden-Preskill decoding from noisy Hawking radiation, J. High Energy Phys. 2021, 17 (2021)

    work page 2021

  59. [59]

    Schuster, B

    T. Schuster, B. Kobrin, P. Gao, I. Cong, E. T. Khabi- boulline, N. M. Linke, M. D. Lukin, C. Monroe, B. Yoshida, and N. Y. Yao, Many-Body Quantum Tele- portation via Operator Spreading in the Traversable Wormhole Protocol, Phys. Rev. X 12, 031013 (2022)

    work page 2022

  60. [60]

    K. A. Landsman, C. Figgatt, T. Schuster, N. M. Linke, B. Yoshida, N. Y. Yao, and C. Monroe, Verified quantum information scrambling, Nature (London) 567, 61 (2019)

    work page 2019

  61. [61]

    M. S. Blok, V. V. Ramasesh, T. Schuster, K. O’Brien, J. M. Kreikebaum, D. Dahlen, A. Morvan, B. Yoshida, N. Y. Yao, and I. Siddiqi, Quantum Information Scram- bling on a Superconducting Qutrit Processor, Phys. Rev. X 11, 021010 (2021)

    work page 2021

  62. [62]

    Wang et al

    J.-H. Wang et al. , Information scrambling dynamics in a fully controllable quantum simulator, Phys. Rev. Res. 4, 043141 (2022)

    work page 2022

  63. [63]

    Shapoval, V

    I. Shapoval, V. P. Su, W. de Jong, M. Urbanek, and B. Swingle, Towards Quantum Gravity in the Lab on Quantum Processors, Quantum 7, 1138 (2023) . 10

    work page 2023

  64. [64]

    Lloyd, L

    S. Lloyd, L. Maccone, R. Garcia-Patron, V. Giovannetti, Y. Shikano, S. Pirandola, L. A. Rozema, A. Darabi, Y. Soudagar, L. K. Shalm, and A. M. Steinberg, Closed timelike curves via postselection: Theory and experi- mental test of consistency, Phys. Rev. Lett. 106, 040403 (2011)

    work page 2011

  65. [65]

    Lloyd, L

    S. Lloyd, L. Maccone, R. Garcia-Patron, V. Giovan- netti, and Y. Shikano, Quantum mechanics of time travel through post-selected teleportation, Phys. Rev. D 84, 025007 (2011)

    work page 2011

  66. [66]

    W. J. van Stockum, The gravitational field of a distri- bution of particles rotating about an axis of symmetry, Proc. R. Soc. Edinb. 57, 135–154 (1938)

    work page 1938

  67. [67]

    G¨ odel, An example of a new type of cosmological so- lutions of Einstein’s field equations of gravitation, Rev

    K. G¨ odel, An example of a new type of cosmological so- lutions of Einstein’s field equations of gravitation, Rev. Mod. Phys. 21, 447 (1949)

    work page 1949

  68. [68]

    M. S. Morris, K. S. Thorne, and U. Yurtsever, Worm- holes, time machines, and the weak energy condition, Phys. Rev. Lett. 61, 1446 (1988)

    work page 1988

  69. [69]

    Buluta and F

    I. Buluta and F. Nori, Quantum Simulators, Science 326, 108 (2009)

    work page 2009

  70. [70]

    I. M. Georgescu, S. Ashhab, and F. Nori, Quantum sim- ulation, Rev. Mod. Phys. 86, 153 (2014)

    work page 2014

  71. [71]

    P. D. Nation, J. R. Johansson, M. P. Blencowe, and F. Nori, Colloquium: Stimulating uncertainty: Amplify- ing the quantum vacuum with superconducting circuits, Rev. Mod. Phys. 84, 1 (2012)

    work page 2012

  72. [72]

    Friedman, M

    J. Friedman, M. S. Morris, I. D. Novikov, F. Echev- erria, G. Klinkhammer, K. S. Thorne, and U. Yurt- sever, Cauchy problem in spacetimes with closed timelike curves, Phys. Rev. D 42, 1915 (1990)

    work page 1915

  73. [73]

    Lloyd and J

    S. Lloyd and J. Preskill, Unitarity of black hole evapo- ration in final-state projection models, J. High Energy Phys. 2014, 126 (2014)

    work page 2014

  74. [74]

    Xu et al

    P. Xu et al. , Satellite testing of a gravitationally in- duced quantum decoherence model, Science 366, 132–135 (2019)

    work page 2019

  75. [75]

    I. H. Kim and J. Preskill, Complementarity and the uni- tarity of the black hole s-matrix, J. High Energy Phys. 2023, 233 (2023)

    work page 2023

  76. [76]

    Oreshkov and N

    O. Oreshkov and N. J. Cerf, Operational formulation of time reversal in quantum theory, Nat. Phys. 11, 853–858 (2015)

    work page 2015

  77. [77]

    S. M. Korotaev and E. O. Kiktenko, Quantum causality in closed timelike curves, Phys. Scr. 90, 085101 (2015)

    work page 2015

  78. [78]

    Chiribella and Z

    G. Chiribella and Z. Liu, Quantum operations with in- definite time direction, Commun. Phys. 5, 190 (2022)

    work page 2022

  79. [79]

    E. O. Kiktenko, Exploring postselection-induced quan- tum phenomena with time-bidirectional state formalism, Phys. Rev. A 107, 032419 (2023)

    work page 2023

  80. [80]

    D. R. M. Arvidsson-Shukur, A. G. McConnell, and N. Yunger Halpern, Nonclassical advantage in metrol- ogy established via quantum simulations of hypotheti- cal closed timelike curves, Phys. Rev. Lett. 131, 150202 (2023)

    work page 2023

Showing first 80 references.