The Computational Event Horizon: An Operational Ontology of Information and the Limits of Recoverability

The Computational Event Horizon: Access and Compute Limits on Recovering Past Quantum States Quantum evolution is exactly unitary, so information about a past state is never destroyed. This preprint asks when that information can still be recovered by a physically bounded observer, and formalizes the Computational Event Horizon as the boundary beyond which it cannot be. The framework treats two resources together: spatial access (an observer who touches only k of N qubits) and computational capacity (a gate budget N_ops, calibrated to physical limits via the Margolus–Levitin bound). It has four parts: Tier A (unconditional): for scrambling unitaries forming a 2-design, a k-qubit observer’s mutual information with the input is exponentially small in N − 2k. Tier A′ (unconditional): the same setting requires about 2^(N−2k) copies to distinguish two microstates, which gives a concrete critical size. Tier B (conditional): assuming sub-exponentially secure quantum-secure one-way functions and the concrete security of known pseudorandom-unitary constructions, keyed scramblers defeat every keyless decoder within a stated gate budget. Tier C (conjecture): that chaotic Hamiltonians and evaporating black holes realize this behavior physically.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24342534
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Computational Event Horizon: An Operational Ontology of Information and the Limits of Recoverability

Tuvshinbold Enkhbold
5 links
Zenodo (CERN European Organization for Nuclear Research)
Quantum Information and Cryptography
preprint

The Computational Event Horizon: An Operational Ontology of Information and the Limits of Recoverability

Tuvshinbold Enkhbold
preprint en

Abstract

The Computational Event Horizon: Access and Compute Limits on Recovering Past Quantum States Quantum evolution is exactly unitary, so information about a past state is never destroyed. This preprint asks when that information can still be recovered by a physically bounded observer, and formalizes the Computational Event Horizon as the boundary beyond which it cannot be. The framework treats two resources together: spatial access (an observer who touches only k of N qubits) and computational capacity (a gate budget N_ops, calibrated to physical limits via the Margolus–Levitin bound). It has four parts: Tier A (unconditional): for scrambling unitaries forming a 2-design, a k-qubit observer’s mutual information with the input is exponentially small in N − 2k. Tier A′ (unconditional): the same setting requires about 2^(N−2k) copies to distinguish two microstates, which gives a concrete critical size. Tier B (conditional): assuming sub-exponentially secure quantum-secure one-way functions and the concrete security of known pseudorandom-unitary constructions, keyed scramblers defeat every keyless decoder within a stated gate budget. Tier C (conjecture): that chaotic Hamiltonians and evaporating black holes realize this behavior physically.

Zenodo (CERN European Organization for Nuclear Research)
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