arxiv: 2601.17459 · v3 · submitted 2026-01-24 · 🪐 quant-ph · physics.comp-ph

Recognition: 2 theorem links

· Lean Theorem

Qhronology: A Python package for studying quantum models of closed timelike curves

Lachlan G. Bishop

Authors on Pith no claims yet

Pith reviewed 2026-05-16 11:14 UTC · model grok-4.3

classification 🪐 quant-ph physics.comp-ph

keywords quantum informationclosed timelike curvespython packagequantum simulationtemporal paradoxesquantum circuitsparadox resolution

0 comments

The pith

Qhronology is a Python package for simulating quantum closed timelike curves and calculating resolutions to temporal paradoxes.

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

The paper introduces Qhronology as a new scientific-computing package written in Python for studying quantum models of closed timelike curves. It supplies tools to compute quantum resolutions for temporal paradoxes that appear in such models. The same package also works as a full quantum circuit simulator that handles both numerical and symbolic calculations of quantum algorithms and protocols. This integrated setup lets users examine quantum information processing inside frameworks that include antichronological time travel.

Core claim

Qhronology is a scientific-computing package that provides a comprehensive framework for analyzing quantum theories of antichronological time travel, including functionality to calculate quantum resolutions to temporal paradoxes. It also operates as a complete quantum circuit simulator, enabling the examination of quantum algorithms and protocols in both numerical and symbolic capacities.

What carries the argument

The Qhronology package, which implements models of quantum closed timelike curves together with quantum circuit simulation in numerical and symbolic modes.

Load-bearing premise

The package implementations of quantum CTC models and paradox resolutions match the underlying theoretical frameworks without adding simulation artifacts.

What would settle it

Run a known quantum paradox resolution through the package and check whether the numerical output matches the exact theoretical prediction; any mismatch would show an implementation error.

Figures

Figures reproduced from arXiv: 2601.17459 by Lachlan G. Bishop.

**Figure 1.** Figure 1: The directory structure of Qhronology, depicting the hierarchy of the various subpackages and modules within the package. 2.2 Classes and their relationships Qhronology presents an innovative approach to describing both simulations of quantum mechanics and the various associated mathematical constructs and processes which collectively form the foundation of contemporary quantum physics. While this is not n… view at source ↗

**Figure 2.** Figure 2: A simplified UML (Unified Modeling Language) class diagram depicting the relationships between Qhronology’s core classes. 6 [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗

**Figure 3.** Figure 3: The results of the benchmarks, plotted in two different ways. Note that even though only 5 samples were taken for each data point, the error bars are vanishingly small for all of them. It should also be noted that, when plotted on linearly (not logarithmically) scaled axes, the data in Subfigure 3a can be observed to follow a virtually perfect linear trend, indicating that the execution time of Qhronology’… view at source ↗

**Figure 4.** Figure 4: The scaling behaviour of Qhronology’s quantum circuit simulation algorithm can be characterized by determining the trend of the data as a function of the number of systems involved in the simulation. By combining (via summation) two different models (exponential and linear functions), we obtain a single model that appears to accurately describe the non-linear scaling of the program. Note that while the ser… view at source ↗

read the original abstract

Qhronology is a novel scientific-computing package for studying quantum models of closed timelike curves (CTCs) and simulating general quantum information processing and computation. Written in Python, the program provides a comprehensive framework for analyzing quantum theories of antichronological time travel, including functionality to calculate quantum resolutions to temporal paradoxes. It also operates as a complete quantum circuit simulator, enabling the examination of quantum algorithms and protocols in both numerical and symbolic capacities. In this paper, we formally introduce Qhronology, beginning with discussion on aspects of its design philosophy and architecture. An overview of its basic usage is then presented, along with a collection of examples demonstrating its various capabilities within a variety of distinct contexts. Lastly, the performance of the package's circuit simulation component is characterized by way of some simple empirical benchmarking.

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.

Desk Editor's Note private letter to a colleague

Qhronology is a new Python package for quantum CTC simulations and general circuit modeling, presented as a tool release with examples and basic benchmarks rather than new theory.

read the letter

The paper introduces Qhronology, a Python package for studying quantum models of closed timelike curves, including functionality for quantum resolutions to temporal paradoxes, while also operating as a full quantum circuit simulator in numerical and symbolic modes. It covers design philosophy, basic usage, examples across contexts, and simple empirical benchmarking of the circuit component. This is a software tool announcement rather than a derivation of new physics results. What it does well is make a specialized simulation capability accessible through concrete examples and a clear architecture overview, which should help researchers in this niche get started without building everything themselves. The benchmarking provides an initial performance check on the circuit side. Soft spots are that the CTC implementations encode existing models without new derivations or extensive validation tests shown, so correctness for non-linear dynamics rests on the code itself rather than demonstrated here. The benchmarks are basic, which fits a first release but leaves room for more thorough checks in follow-up work. No major internal inconsistencies appear in the described approach. This paper is for researchers in quantum information and gravity foundations who need a ready simulator for CTC explorations. A reader focused on computational tools in this area would get practical value from the usage sections. It deserves peer review to evaluate the implementation reliability and documentation.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces Qhronology, a Python package for studying quantum models of closed timelike curves (CTCs) that implements calculations of quantum resolutions to temporal paradoxes under non-linear consistency conditions, while also serving as a general-purpose quantum circuit simulator supporting both numerical and symbolic modes. The paper covers design philosophy and architecture, basic usage, illustrative examples across contexts, and empirical benchmarking focused on the circuit-simulation component.

Significance. If the CTC implementations correctly encode the underlying theoretical frameworks without introducing artifacts in the non-linear dynamics, the package would supply a reproducible, open-source platform that lowers the barrier to systematic numerical exploration of quantum CTC models and paradox resolutions. The dual role as a general quantum-information simulator further increases its potential utility for cross-checking results against standard circuit protocols.

major comments (2)

[Benchmarking section] Benchmarking section: performance and accuracy characterization is reported only for the general circuit simulator; no timing, convergence, or fidelity tests are given for the CTC-specific modules that handle non-linear consistency conditions, leaving the central claim of reliable paradox-resolution functionality unverified.
[Examples section] Examples section: the presented usage cases demonstrate functionality but contain no side-by-side comparison of package outputs against known analytical solutions or independent implementations of quantum CTC models from the literature, which is required to establish that the non-linear dynamics are simulated without discretization or iteration artifacts.

minor comments (2)

The abstract could more explicitly separate the re-implementation of existing CTC frameworks from any novel algorithmic or architectural contributions of the package itself.
[Design and architecture] Notation for density-matrix evolution under the consistency condition is introduced without an explicit equation reference, making it harder for readers to map the code directly to the theoretical literature.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thoughtful review and positive recommendation for minor revision. We address each major comment below and will revise the manuscript accordingly to strengthen the validation of the CTC-specific functionality.

read point-by-point responses

Referee: [Benchmarking section] Benchmarking section: performance and accuracy characterization is reported only for the general circuit simulator; no timing, convergence, or fidelity tests are given for the CTC-specific modules that handle non-linear consistency conditions, leaving the central claim of reliable paradox-resolution functionality unverified.

Authors: We agree that dedicated benchmarking for the CTC modules is warranted to fully support the central claims. The non-linear consistency solver relies on the same numerical backend as the circuit simulator, but we acknowledge the need for explicit timing, convergence, and fidelity metrics on the iterative fixed-point solutions. We will add a new subsection to the benchmarking section that includes these tests for representative CTC paradox resolutions, using both small-scale analytical cases and larger numerical examples. revision: yes
Referee: [Examples section] Examples section: the presented usage cases demonstrate functionality but contain no side-by-side comparison of package outputs against known analytical solutions or independent implementations of quantum CTC models from the literature, which is required to establish that the non-linear dynamics are simulated without discretization or iteration artifacts.

Authors: We accept this point. The current examples focus on demonstrating usage and capabilities across contexts, but we will revise the examples section to incorporate direct comparisons against known analytical solutions (e.g., Deutsch's model and other standard CTC resolutions from the literature). This will include tabulated or plotted side-by-side results to confirm that the package reproduces expected outcomes without introducing numerical artifacts from discretization or iteration. revision: yes

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The manuscript is a description of a Python software package that implements existing quantum CTC models and a general quantum circuit simulator. No derivations, fitted parameters, predictions, or uniqueness theorems are presented; the central claims concern code functionality, usage examples, and benchmarking results. These are supported directly by the implementation and empirical timing data rather than by any self-referential reduction to inputs. No load-bearing self-citations or ansatzes appear in the provided text.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The package implements standard quantum mechanics and existing CTC models from the literature without introducing new free parameters, axioms, or invented physical entities in the paper itself.

pith-pipeline@v0.9.0 · 5432 in / 1038 out tokens · 22370 ms · 2026-05-16T11:14:03.525009+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

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

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Qhronology … provides … calculation of the states of the CR and CV quantum systems according to … Deutsch’s model (D-CTCs) … postselected teleportation (P-CTCs) … simulation of general quantum information processing … visualization of quantum circuit diagrams
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

The package … is … a complete quantum circuit simulator … built around … SymPy and NumPy … standard d-dimensional matrix mechanics

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

21 extracted references · 21 canonical work pages · 3 internal anchors

[1]

Quantum mechanics near closed timelike lines

D. Deutsch, “Quantum mechanics near closed timelike lines”, Physical Review D44, 3197–3217 (1991),https://link.aps.org/doi/10.1103/PhysRevD.44.3197

work page doi:10.1103/physrevd.44.3197 1991
[2]

Quantum mechanics of time travel through post-selected teleportation

S. Lloyd, L. Maccone, R. Garcia-Patron, V. Giovannetti, and Y. Shikano, “Quantum mechanics of time travel through post-selected teleportation”, Physical Review D84, 025007 (2011),https: //link.aps.org/doi/10.1103/PhysRevD.84.025007

work page doi:10.1103/physrevd.84.025007 2011
[3]

Closed Timelike Curves via Postselection: TheoryandExperimentalTestofConsistency

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: TheoryandExperimentalTestofConsistency”,PhysicalReviewLetters106,040403(2011),https: //link.aps.org/doi/10.1103/PhysRevLett.106.040403

work page doi:10.1103/physrevlett.106.040403 2011
[4]

Simulated time travel, teleportation without communication, and how to conduct a romance with someone who has fallen into a black hole

C. H. Bennett and B. Schumacher, “Simulated time travel, teleportation without communication, and how to conduct a romance with someone who has fallen into a black hole”, QUPON Conference (QUPON conference, Vienna, Austria), May 2005,http : / / www . research . ibm . com / people / b / bennetc/QUPONBshort.pdf

work page 2005
[5]

Effective Quantum Time Travel

G. Svetlichny,Effective Quantum Time Travel, (Feb. 27, 2009)http://arxiv.org/abs/0902.4898,

work page internal anchor Pith review Pith/arXiv arXiv 2009
[6]

Time Travel: Deutsch vs. Teleportation

G. Svetlichny, “Time Travel: Deutsch vs. Teleportation”, International Journal of Theoretical Physics50, 3903–3914 (2011),https://doi.org/10.1007/s10773-011-0973-x. 79

work page doi:10.1007/s10773-011-0973-x 2011
[7]

L. G. Bishop,Qhronology: A Python package for studying quantum models of closed timelike curves and simulating general quantum information processing & computation, 2025,https : / / qhronology.org, Source code:https://github.com/lgbishop/qhronology

work page 2025
[8]

SymPy: symbolic computing in Python

A. Meurer, C. P. Smith, M. Paprocki, O. Čertík, S. B. Kirpichev, M. Rocklin, Am. Kumar, S. Ivanov, J. K. Moore, S. Singh, T. Rathnayake, S. Vig, B. E. Granger, R. P. Muller, F. Bonazzi, H. Gupta, S. Vats, F. Johansson, F. Pedregosa, M. J. Curry, A. R. Terrel, Š. Roučka, A. Saboo, I. Fernando, S. Kulal, R. Cimrman, and A. Scopatz, “SymPy: symbolic computin...

work page doi:10.7717/peerj-cs.103 2017
[9]

R., Millman, K

C. R. Harris, K. J. Millman, S. J. van der Walt, R. Gommers, P. Virtanen, D. Cournapeau, E. Wieser, J. Taylor, S. Berg, N. J. Smith, R. Kern, M. Picus, S. Hoyer, M. H. van Kerkwijk, M. Brett, A. Haldane, J. F. del Río, M. Wiebe, P. Peterson, P. Gérard-Marchant, K. Sheppard, T. Reddy, W. Weckesser, H. Abbasi, C. Gohlke, and T. E. Oliphant, “Array programmi...

work page doi:10.1038/s41586-020-2649-2 2020
[10]

L. G. Bishop,Qhronology: Documentation, Examples, and Theory, 2025,https://github.com/ lgbishop / qhronology / blob / latest / docs / _build / latex / Qhronology . pdf, Available online: https://qhronology.org

work page 2025
[11]

Gamma, R

E. Gamma, R. Helm, R. Johnson, and J. Vlissides,Design Patterns: Elements of Reusable Object- Oriented Software(Addison-Wesley Professional, 1994), 416 pp

work page 1994
[12]

IBM and the Qiskit Community,Qiskit, 2017,https: // www .ibm .com /quantum / qiskit, Source code:https://github.com/Qiskit/qiskit

work page 2017
[13]

Quantum computing with Qiskit

A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, and J. M. Gambetta,Quantum computing with Qiskit, (June 19, 2024)http://arxiv.org/abs/2405.08810,

work page internal anchor Pith review Pith/arXiv arXiv 2024
[14]

google / cirq, Source code: https://github.com/quantumlib/Cirq

Google and the Cirq Community,Cirq, 2018,https : / / quantumai . google / cirq, Source code: https://github.com/quantumlib/Cirq

work page 2018
[15]

Xanadu and the PennyLane Community,PennyLane, 2018,https://pennylane.ai/, Source code: https://github.com/PennyLaneAI/pennylane

work page 2018
[16]

PennyLane: Automatic differentiation of hybrid quantum-classical computations

V. Bergholm, J. Izaac, M. Schuld, C. Gogolin, S. Ahmed, V. Ajith, M. S. Alam, G. Alonso-Linaje, B. AkashNarayanan, A. Asadi, J. M. Arrazola, U. Azad, S. Banning, C. Blank, T. R. Bromley, B. A. Cordier, J. Ceroni, A. Delgado, O. D. Matteo, A. Dusko, T. Garg, D. Guala, A. Hayes, R. Hill, A. Ijaz, T. Isacsson, D. Ittah, S. Jahangiri, P. Jain, E. Jiang, A. Kh...

work page internal anchor Pith review Pith/arXiv arXiv 2022
[17]

The QuTiP Community,QuTiP, 2012,https://qutip.org/, Source code:https://github.com/ qutip/qutip

work page 2012
[18]

QuTiP 5: The Quantum Toolbox in Python

N. Lambert, E. Giguère, P. Menczel, B. Li, P. Hopf, G. Suárez, M. Gali, J. Lishman, R. Gadhvi, R. Agarwal, A. Galicia, N. Shammah, P. Nation, J. R. Johansson, S. Ahmed, S. Cross, A. Pitchford, and F. Nori, “QuTiP 5: The Quantum Toolbox in Python”, Physics Reports1153, 1–62 (2026), https://www.sciencedirect.com/science/article/pii/S0370157325002704

work page 2026
[19]

Quantum state tomography on closed timelike curves using weak measurements

L. G. Bishop, F. Costa, and T. C. Ralph, “Quantum state tomography on closed timelike curves using weak measurements”, Classical and Quantum Gravity42, 045018 (2025),https://dx.doi. org/10.1088/1361-6382/ada90b

work page doi:10.1088/1361-6382/ada90b 2025
[20]

Treating time travel quantum mechanically

J.-M. A. Allen, “Treating time travel quantum mechanically”, Physical Review A90, 042107 (2014), https://link.aps.org/doi/10.1103/PhysRevA.90.042107

work page doi:10.1103/physreva.90.042107 2014
[21]

Time-traveling billiard-ball clocks: A quantum model

L. G. Bishop, F. Costa, and T. C. Ralph, “Time-traveling billiard-ball clocks: A quantum model”, Physical Review A103, 042223 (2021),https://link.aps.org/doi/10.1103/PhysRevA.103. 042223. 80

work page doi:10.1103/physreva.103 2021