aiqbench analysis
This research implements theoretical Deutsch closed timelike curve (D-CTC) models on actual quantum hardware to test the feasibility of recovering information from chronology-violating registers. By utilizing IBM devices, the study quantifies critical metrics such as decoder fidelity and post-selection overhead in single-qubit systems, bridging abstract concepts from general relativity with practical quantum circuit execution. The work advances our understanding of how fundamental physics constraints might manifest within near-term noisy intermediate-scale quantum (NISQ) architectures.
Closed Timelike Curve Decoding on Quantum Hardware
arXiv:2607.27473v1 Announce Type: new Abstract: Deutsch closed timelike curves (D-CTCs) are described by a fixed-point condition for a chronology-violating register. We study a finite-dimensional circuit model that places a Hayden--Preskill/Yoshida--Kitaev recovery map inside such a consistency loop. A register-routing construction makes the Deutsch map explicit: an initial SWAP moves the incoming CTC state to an idle dump register, the scrambler and decoder act on the remaining active registers, and a final SWAP writes the recovered message back to the CTC register. When the active branch recovers the message, the induced map on the CTC register is the replacement channel \(\sigma\mapsto \rho_M\), with the unique fixed point \(\rho_M\). We implement the associated Lloyd-type post-selected decoder circuits on quantum hardware and formulate a classical-feedback iteration for the experimentally estimated map. Qiskit simulations and IBM-hardware data for single-qubit instances quantify decoder fidelity, post-selection overhead, routing-dependent noise, and quantum-geometric susceptibility.
Abstract:Deutsch closed timelike curves (D-CTCs) are described by a fixed-point condition for a chronology-violating register. We study a finite-dimensional circuit model that places a Hayden--Preskill/Yoshida--Kitaev recovery map inside such a consistency loop. A register-routing construction makes the Deutsch map explicit: an initial SWAP moves the incoming CTC state to an idle dump register, the scrambler and decoder act on the remaining active registers, and a final SWAP writes the recovered message back to the CTC register. When the active branch recovers the message, the induced map on the CTC register is the replacement channel \(\sigma\mapsto \rho_M\), with the unique fixed point \(\rho_M\). We implement the associated Lloyd-type post-selected decoder circuits on quantum hardware and formulate a classical-feedback iteration for the experimentally estimated map. Qiskit simulations and IBM-hardware data for single-qubit instances quantify decoder fidelity, post-selection overhead, routing-dependent noise, and quantum-geometric susceptibility.
arXiv:2607.27473 [quant-ph]
(or arXiv:2607.27473v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2607.27473 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 232 words
Related coverage
[AINews] High Taste Testers Ep. 1
Latent Space · Oct 17, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026

Megaquop, What a Million Reliable Quantum Operations Would Buy
Quantum Zeitgeist · Sep 1, 2026