Collapse Threshold from a Computational Limit

We propose a modernization of quantum mechanics through the introduction of the Collapse Threshold Rule: a branch or coherence is removed if it cannot be distinguished experimentally from absence. The classical outcome becomes objective rather than a virtual interpretation of decoherence. The threshold is derived from the finite number of binary distinctions within a causal patch — 3,5 × 10¹²⁰. The scale of equiprobable branching and the RCS limit are about 400 qubits. The model forbids factorization of RSA-1024. The non-unitarity of the collapse act permits non-conservation of energy as well as superluminal information transfer. An experimental test on a single 404-qubit processor is proposed.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-07
DOI
https://doi.org/10.5281/zenodo.22613566
Primary Topic
Quantum Mechanics and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Collapse Threshold from a Computational Limit

Oleg Ponfilenok
Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications
preprint

Collapse Threshold from a Computational Limit

Oleg Ponfilenok
preprint en

Abstract

We propose a modernization of quantum mechanics through the introduction of the Collapse Threshold Rule: a branch or coherence is removed if it cannot be distinguished experimentally from absence. The classical outcome becomes objective rather than a virtual interpretation of decoherence. The threshold is derived from the finite number of binary distinctions within a causal patch — 3,5 × 10¹²⁰. The scale of equiprobable branching and the RCS limit are about 400 qubits. The model forbids factorization of RSA-1024. The non-unitarity of the collapse act permits non-conservation of energy as well as superluminal information transfer. An experimental test on a single 404-qubit processor is proposed.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications
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.