How noisy quantum time loops select forecasts that match the future

Used as a forecast test, a quantum time loop simulated by postselected teleportation selects the runs in which an early random forecast matches a later choice, and it selects well only if a later operation can stop the loop from closing when the two differ. We prove an exact formula for the least closing probability of n loops under energy loss. At any non-zero loss, one loop can never be stopped completely, so some wrong forecasts always survive. Two loops operated jointly can be stopped completely by a single entangling gate for loss up to 82.8%, and n loops for loss up to 1 − (2^(1/n) − 1)^2. No wrong forecast then survives, for any number M of possible choices, but only a fraction p_max/M of runs survives. For two loops, complete stopping needs a nonseparable operation once loss exceeds 50%. Under a simulated noise model for a six-qubit superconducting circuit, the joint gate reaches 2.9 bits of contrast per loop against 2.4 for the best separate operations at 83% loss, and wrong three-bit forecasts fall from 21% to 11% of surviving runs. In a pilot on an IBM Heron processor at a programmed loss of 86%, the joint gate left both loops closed in 0.90% of runs against 1.19% for a separate veto on each loop, a little under half the simulated gain.

Authors

Publication Details

Journal
Research Square
Published
2026-11-19
DOI
https://doi.org/10.21203/rs.3.rs-11777101/v1
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

How noisy quantum time loops select forecasts that match the future

Peter Catt
2 links
Research Square
Quantum Information and Cryptography
preprint

How noisy quantum time loops select forecasts that match the future

Peter Catt
preprint en

Abstract

Used as a forecast test, a quantum time loop simulated by postselected teleportation selects the runs in which an early random forecast matches a later choice, and it selects well only if a later operation can stop the loop from closing when the two differ. We prove an exact formula for the least closing probability of n loops under energy loss. At any non-zero loss, one loop can never be stopped completely, so some wrong forecasts always survive. Two loops operated jointly can be stopped completely by a single entangling gate for loss up to 82.8%, and n loops for loss up to 1 − (2^(1/n) − 1)^2. No wrong forecast then survives, for any number M of possible choices, but only a fraction p_max/M of runs survives. For two loops, complete stopping needs a nonseparable operation once loss exceeds 50%. Under a simulated noise model for a six-qubit superconducting circuit, the joint gate reaches 2.9 bits of contrast per loop against 2.4 for the best separate operations at 83% loss, and wrong three-bit forecasts fall from 21% to 11% of surviving runs. In a pilot on an IBM Heron processor at a programmed loss of 86%, the joint gate left both loops closed in 0.90% of runs against 1.19% for a separate veto on each loop, a little under half the simulated gain.

Research Square
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon