Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Time Is Not Projection-Inert Under Born-Compliant Histograms

Emre Koçana

Published Jan 10, 2026• 0 citations
Publisher

Abstract

This preprint proposes a minimal, platform-agnostic operational test to constrain the role of time in quantum measurement under Born-compliant outcome histograms. The work introduces a Δt-sweep protocol in which the only controlled intervention is the temporal window used to project trial-resolved measurement records into outcomes. A null class of readout-only, memoryless, projection-inert descriptions is defined, together with a decision-level schedule witness designed to detect sweep-order and sweep-rate dependence while preserving Born-level histogram stability. Drift-robust inference is achieved via drift-preserving block permutations and permutation-based confidence intervals. The contribution is deliberately limited to an operational constraint on model classes, conditional on future experimental implementation, without committing to any specific collapse dynamics or modified quantum evolution. ## Replication Independent experimental replications and platform implementations of the Δt-sweep / schedule-witness protocol are welcome. When reporting results, please cite the protocol-of-record and use the reference implementation above.

DOI
10.5281/zenodo.18202855

Related papers

Born-Convergence and Decision-Level Memory: A Δt-Sweep Operational Exclusion Criterion for Readout-Only Models

Emre Koçana

Quantum mechanics predicts outcome statistics via the Born rule, yet remains operationally under-specified with respect to how, and on what timescale, a single outcome becomes definite in an experimental record. In many platforms, identical Born-compliant outcome histograms can be produced either by a time-extended physical closure process, in which competing channels accumulate influence until a decision event, or by purely readout-level mappings and post-processing applied to measurement records. This under-determination motivates an operational question: which broad classes of readout-based explanations remain viable given finite-time, resolution-dependent data alone? Here we formulate an operational exclusion criterion relative to a broad null family of readout-only, memoryless models. In this null family, for each temporal resolution Delta t, the reported outcome is generated by a (possibly stochastic and nonlinear) mapping from a single-shot record R to an outcome Y, with no decision-level internal state persisting across Delta t settings and no dependence on sweep direction or parameter history. Under these structural assumptions, sweep-history dependence is excluded by construction. Using Delta t as a single experimentally controlled parameter, interpreted as an effective integration window, we define three operational quantities. The first is a Born distance D_B(Delta t), measuring the deviation between the observed outcome distribution at resolution Delta t and the corresponding Born-rule prediction. The second is a convergence-rate proxy gamma(Delta t), defined as the negative derivative of D_B with respect to the logarithm of Delta t, which quantifies the tendency toward convergence to Born statistics as temporal resolution is increased. The third is a hysteresis-based memory witness M(Delta t), defined as the absolute difference between Born distances obtained from increasing and decreasing Delta t sweeps. We then state a conditional trade-off for stateful closure explanations. Over Delta t ranges where these quantities are well defined, a positive convergence tendency gamma(Delta t) greater than zero is generically expected to be accompanied by nonzero path dependence M(Delta t) greater than zero. This expectation can be summarized by an upper bound of the form: gamma(Delta t) is less than or equal to C times M(Delta t), plus a correction term epsilon(Delta t). Here C depends on coarse structural features of the closure process, such as the number of competing channels and the sharpness of decision thresholds, while epsilon collects finite-sample and finite-resolution effects. An efficiency ratio eta(Delta t), defined as gamma(Delta t) divided by M(Delta t), is introduced as a diagnostic. Within the null family, where M(Delta t) is identically zero, any sustained claim of finite positive gamma necessarily drives eta to diverge, signaling incompatibility with the readout-only, memoryless assumptions. The framework does not propose new dynamics or modify quantum theory. Instead, it specifies an operational protocol and a coupled signature set whose robust observation would render the readout-only, memoryless null family insufficient as an explanation of finite-time Born convergence. Robustness controls, including sweep-rate variation, randomized Delta t ordering, and mapping-invariance checks, are outlined to separate decision-level path dependence from trivial instrumental artifacts.

•Jan 5, 2026•0 citations

From Schedule Witness to Memory Witness: Trial-Resolved Floors Under Born-Stable Marginals

Emre Koçana

Born-level marginals can remain stable while trial-resolved measurement records exhibit order- and rate-dependent signatures. Such sequence sensitivity is invisible to histogram-only analyses yet constrains which operational descriptions of measurement remain viable under controlled schedule manipulations. Building on the Δt-sweep schedule witness introduced in a companion Foundations of Physics submission, this preprint poses a quantitative question: how much trial-resolved memory is minimally required to support the observed sequence sensitivity while remaining compatible with Born-stable marginals? We introduce (i) trial-resolved memory witnesses based on conditional mutual information (with a computational proxy), (ii) operational procedures for extracting conservative lower bounds (“floors”) on memory and occurrence using drift-robust null constructions, and (iii) an exclusion ladder that organizes control requirements for separating readout-only, latency/DAQ, drift/interleaving, and weak-memory explanations. The contribution is an operational lower-bound framework; it does not identify a unique physical mechanism and makes no ontological commitment. Device-specific attribution is deferred to experimental implementations. This manuscript is a working preprint subject to revision.

•Jan 20, 2026•0 citations

Measurement as Record-Registration: A Locked-Null Protocol for Testing Record-Level Structure in Quantum Computing Readout

William T Partin

This manuscript presents a methods-forward, operational protocol for evaluating whether any structured dependence remains in quantum-computing measurement records after explicit modeling of standard quantum and device-level mechanisms. Classical definiteness is defined at the record layer, and pre-record states are treated as predictive descriptions rather than as classical outcome facts. Within this operational stance, the protocol converts questions about outcome status and record formation into a falsifiable test program grounded in preregistered analysis rules and standard measurement telemetry. A locked null-model family is specified in advance, incorporating standard quantum dynamics together with documented device-level mechanisms including drift, correlated and non-Markovian noise, crosstalk proxies, and leakage indicators. The framework provides operational definitions, a conservative postulate set, preregistered endpoints, residual-adjudication criteria, negative controls, a fixed windowing discipline, and a bound-first reporting standard designed to yield informative constraints under null results. Any candidate contribution beyond the declared null family must appear as structured, reproducible residual dependence that survives the locked null family and the full residual-filter sequence. Version 4.4 refines the protocol specification, clarifies evidentiary boundaries, and strengthens the integration of the synthetic demonstration. The manuscript includes a fully specified classical simulation that executes the decision pipeline under controlled conditions. The synthetic study illustrates how the protocol classifies a bounded-null case, a measured-artifact case, a partial-artifact/unresolved-covariate case, an injected structured-residual case, and a failed-topology case. This demonstration establishes computational executability of the protocol and clarifies the behavior of the decision tree, but it does not constitute empirical evidence for any physical mechanism. Because the protocol relies only on standard measurement telemetry and preregistered analysis rules, it is directly implementable across contemporary quantum-computing platforms and does not depend on any single dataset, backend, or hardware realization. The manuscript is a specification paper: it defines a reproducible evidentiary framework for record-level claims, while large-scale empirical implementation, hardware benchmarking, and cross-platform replication remain subsequent studies.

•Mar 17, 2026•0 citations

Timeverse × Quantum Measurement: Phase-Addressed Scheduling of Measurement Interactions (A Control-Plane Framework Compatible with Standard POVMs)

Tarik Ouardi

This paper proposes phase-addressed measurement scheduling: a control-plane framework in which quantum measurement interactions are triggered inside cycle-anchored phase windows of a shared reference phase φ(t) ∈ [0,1) ≃ S¹, rather than targeted by absolute timestamps or fixed qubit-index order. SCOPE AND CLAIMS This is a theoretical and architectural proposal. It does NOT modify the Born rule, POVMs, Hilbert-space dynamics, or any foundational aspect of quantum mechanics. The framework constrains WHEN standard measurement instruments are applied, using wrap-safe phase windows and explicit cycle indexing to avoid periodic ambiguity ("same phase / wrong cycle"). No performance numbers are claimed without hardware validation. KEY CONTRIBUTIONS • Formalization of phase-window execution for measurement timing using standard notation• Analytic toy models clarifying conditions of benefit: – Phase-addressing helps when measurement drift is quasi-periodic and phase-correlated – No guaranteed gain under white, phase-uncorrelated noise – Explicit throughput/fidelity trade-off analysis• Three experimentally testable protocols: – Superconducting processors: drift vs phase characterization – Controller jitter injection tests – Photonic/quantum network coordination without long-horizon timestamp synchronization• Integration with phase-coordination stacks (Q-Address, TAQA, HS-Bloch) for distributed verification and audit POSITIONING The proposal is compatible with:• Standard POVM-based measurement theory• Quantum reference-frame viewpoints (Bartlett et al., 2007)• Filter-function / dynamical decoupling perspectives (Cywiński et al., 2008; Green et al., 2013)• Synchronous detection and stroboscopic sampling techniques The distinctive contribution is an interoperable, verifiable control-plane representation (cycle anchoring, wrap-safe windows, tick-canonical verification) intended for distributed quantum architectures. LIMITATIONS AND REPORTING REQUIREMENTS The paper explicitly documents when phase-addressed scheduling does NOT help (white noise, no phase correlation) and specifies reporting requirements for any experimental evaluation to avoid overstating benefits. KEYWORDS phase-addressed measurement, scheduling, phase windows, cyclic phase, quantum control, POVM, drift, synchronization, distributed quantum systems, Timeverse, TAQA, Q-Address, HS-Bloch

•Feb 4, 2026•0 citations

Observer Access as a Boundary Condition: A Foundational Test of the Born Rule

Klarić Kevin

This paper proposes an operational and falsifiable test of whether verified observer access to quantum measurement outcomes correlates with systematic deviations from the Born rule. We introduce a phenomenological indexical weighting factor Φ(I) and a new consistency axiom (NRU – No Retroactive Update) while preserving unitary dynamics. The design uses a clean Access vs. No-access toggle with rigorous controls (including yoked replays and sham-human baselines) and is feasible with existing photonic platforms. Abstract We propose an operational and falsifiable test of whether observer access to quantum measurement outcomes correlates with systematic deviations from the Born rule. The design implements a preregistered toggle between two physically isomorphic conditions: (Access) a live photon stream reaches a human retina and attention is verified via signal-detection measures, versus (No-access) the identical stream is generated and routed but optically blocked at the final millimeter. We formalize a phenomenological weighting of probabilities by an indexical factor Φ(I) over observer frames, derive an observer-access–weighted Born rule that reduces to standard quantum mechanics for uniform Φ, and show that non-signalling holds under locality of Φ̂ together with a no-retroactive-update (NRU) constraint. NRU is introduced axiomatically as a new postulate, and Φ(I) is treated as a phenomenological placeholder rather than a constructive model, with the aim of enabling direct empirical test. This is a preprint version (June 2026). A journal submission is in preparation.

•Jun 18, 2026•0 citations

Quantum Temporal Boundary Collapse Framework: A Finite-Dimensional Operational Analysis of Born Weights, Retrodiction, and Branch Witnesses

Minglai Man

We study a finite-dimensional quantum-operational formulation of the Quantum Temporal Boundary Collapse (QTBC) framework. First, nonnegative additive terminal weights and exhaustive terminal normalization imply that the total terminal functional is the trace on the positive cone. For a complete projective CP instrument with orthogonal rejection, this gives the projective Born weights p(a | ρ) = Tr(ρPa), without assuming projector-specific probabilities; the result remains conditional on standard quantum-instrument structure. Second, in the quantum realization where physical structural distinguishability is represented by trace distance, RSCP forces every closed deterministic CPTP evolution on the same finite-dimensional Hilbert space to be unitary. Third, selected future data define a retrodictive likelihood kernel. In a branch-support-preserving sharp sector, a terminal test in the admissible domain with effects Ffa= UPaU † perfectly distinguishes the conditional instrument branches and satisfies Φ∗ (Ffa ) = Pa. These results organize ordinary Born marginals, future-conditioned retrodiction, and branch-witness transport within one explicit dependency structure. Macroscopic record formation and single-history actualization are not derived here.

•Sep 25, 2026•0 citations
This preprint proposes a minimal, platform-agnostic operational test to constrain the role of time in quantum measurement under Born-compliant outcome histograms. The work introduces a Δt-sweep protocol in which the only controlled intervention is the temporal window used to project trial-resolved measurement records into outcomes. A null class of readout-only, memoryless, projection-inert descriptions is defined, together with a decision-level schedule witness designed to detect sweep-order and sweep-rate dependence while preserving Born-level histogram stability. Drift-robust inference is achieved via drift-preserving block permutations and permutation-based confidence intervals. The contribution is deliberately limited to an operational constraint on model classes, conditional on future experimental implementation, without committing to any specific collapse dynamics or modified quantum evolution. ## Replication Independent experimental replications and platform implementations of the Δt-sweep / schedule-witness protocol are welcome. When reporting results, please cite the protocol-of-record and use the reference implementation above.
Quantum mechanics predicts outcome statistics via the Born rule, yet remains operationally under-specified with respect to how, and on what timescale, a single outcome becomes definite in an experimental record. In many platforms, identical Born-compliant outcome histograms can be produced either by a time-extended physical closure process, in which competing channels accumulate influence until a decision event, or by purely readout-level mappings and post-processing applied to measurement records. This under-determination motivates an operational question: which broad classes of readout-based explanations remain viable given finite-time, resolution-dependent data alone? Here we formulate an operational exclusion criterion relative to a broad null family of readout-only, memoryless models. In this null family, for each temporal resolution Delta t, the reported outcome is generated by a (possibly stochastic and nonlinear) mapping from a single-shot record R to an outcome Y, with no decision-level internal state persisting across Delta t settings and no dependence on sweep direction or parameter history. Under these structural assumptions, sweep-history dependence is excluded by construction. Using Delta t as a single experimentally controlled parameter, interpreted as an effective integration window, we define three operational quantities. The first is a Born distance D_B(Delta t), measuring the deviation between the observed outcome distribution at resolution Delta t and the corresponding Born-rule prediction. The second is a convergence-rate proxy gamma(Delta t), defined as the negative derivative of D_B with respect to the logarithm of Delta t, which quantifies the tendency toward convergence to Born statistics as temporal resolution is increased. The third is a hysteresis-based memory witness M(Delta t), defined as the absolute difference between Born distances obtained from increasing and decreasing Delta t sweeps. We then state a conditional trade-off for stateful closure explanations. Over Delta t ranges where these quantities are well defined, a positive convergence tendency gamma(Delta t) greater than zero is generically expected to be accompanied by nonzero path dependence M(Delta t) greater than zero. This expectation can be summarized by an upper bound of the form: gamma(Delta t) is less than or equal to C times M(Delta t), plus a correction term epsilon(Delta t). Here C depends on coarse structural features of the closure process, such as the number of competing channels and the sharpness of decision thresholds, while epsilon collects finite-sample and finite-resolution effects. An efficiency ratio eta(Delta t), defined as gamma(Delta t) divided by M(Delta t), is introduced as a diagnostic. Within the null family, where M(Delta t) is identically zero, any sustained claim of finite positive gamma necessarily drives eta to diverge, signaling incompatibility with the readout-only, memoryless assumptions. The framework does not propose new dynamics or modify quantum theory. Instead, it specifies an operational protocol and a coupled signature set whose robust observation would render the readout-only, memoryless null family insufficient as an explanation of finite-time Born convergence. Robustness controls, including sweep-rate variation, randomized Delta t ordering, and mapping-invariance checks, are outlined to separate decision-level path dependence from trivial instrumental artifacts.
Born-level marginals can remain stable while trial-resolved measurement records exhibit order- and rate-dependent signatures. Such sequence sensitivity is invisible to histogram-only analyses yet constrains which operational descriptions of measurement remain viable under controlled schedule manipulations. Building on the Δt-sweep schedule witness introduced in a companion Foundations of Physics submission, this preprint poses a quantitative question: how much trial-resolved memory is minimally required to support the observed sequence sensitivity while remaining compatible with Born-stable marginals? We introduce (i) trial-resolved memory witnesses based on conditional mutual information (with a computational proxy), (ii) operational procedures for extracting conservative lower bounds (“floors”) on memory and occurrence using drift-robust null constructions, and (iii) an exclusion ladder that organizes control requirements for separating readout-only, latency/DAQ, drift/interleaving, and weak-memory explanations. The contribution is an operational lower-bound framework; it does not identify a unique physical mechanism and makes no ontological commitment. Device-specific attribution is deferred to experimental implementations. This manuscript is a working preprint subject to revision.
This manuscript presents a methods-forward, operational protocol for evaluating whether any structured dependence remains in quantum-computing measurement records after explicit modeling of standard quantum and device-level mechanisms. Classical definiteness is defined at the record layer, and pre-record states are treated as predictive descriptions rather than as classical outcome facts. Within this operational stance, the protocol converts questions about outcome status and record formation into a falsifiable test program grounded in preregistered analysis rules and standard measurement telemetry. A locked null-model family is specified in advance, incorporating standard quantum dynamics together with documented device-level mechanisms including drift, correlated and non-Markovian noise, crosstalk proxies, and leakage indicators. The framework provides operational definitions, a conservative postulate set, preregistered endpoints, residual-adjudication criteria, negative controls, a fixed windowing discipline, and a bound-first reporting standard designed to yield informative constraints under null results. Any candidate contribution beyond the declared null family must appear as structured, reproducible residual dependence that survives the locked null family and the full residual-filter sequence. Version 4.4 refines the protocol specification, clarifies evidentiary boundaries, and strengthens the integration of the synthetic demonstration. The manuscript includes a fully specified classical simulation that executes the decision pipeline under controlled conditions. The synthetic study illustrates how the protocol classifies a bounded-null case, a measured-artifact case, a partial-artifact/unresolved-covariate case, an injected structured-residual case, and a failed-topology case. This demonstration establishes computational executability of the protocol and clarifies the behavior of the decision tree, but it does not constitute empirical evidence for any physical mechanism. Because the protocol relies only on standard measurement telemetry and preregistered analysis rules, it is directly implementable across contemporary quantum-computing platforms and does not depend on any single dataset, backend, or hardware realization. The manuscript is a specification paper: it defines a reproducible evidentiary framework for record-level claims, while large-scale empirical implementation, hardware benchmarking, and cross-platform replication remain subsequent studies.
This paper proposes phase-addressed measurement scheduling: a control-plane framework in which quantum measurement interactions are triggered inside cycle-anchored phase windows of a shared reference phase φ(t) ∈ [0,1) ≃ S¹, rather than targeted by absolute timestamps or fixed qubit-index order. SCOPE AND CLAIMS This is a theoretical and architectural proposal. It does NOT modify the Born rule, POVMs, Hilbert-space dynamics, or any foundational aspect of quantum mechanics. The framework constrains WHEN standard measurement instruments are applied, using wrap-safe phase windows and explicit cycle indexing to avoid periodic ambiguity ("same phase / wrong cycle"). No performance numbers are claimed without hardware validation. KEY CONTRIBUTIONS • Formalization of phase-window execution for measurement timing using standard notation• Analytic toy models clarifying conditions of benefit: – Phase-addressing helps when measurement drift is quasi-periodic and phase-correlated – No guaranteed gain under white, phase-uncorrelated noise – Explicit throughput/fidelity trade-off analysis• Three experimentally testable protocols: – Superconducting processors: drift vs phase characterization – Controller jitter injection tests – Photonic/quantum network coordination without long-horizon timestamp synchronization• Integration with phase-coordination stacks (Q-Address, TAQA, HS-Bloch) for distributed verification and audit POSITIONING The proposal is compatible with:• Standard POVM-based measurement theory• Quantum reference-frame viewpoints (Bartlett et al., 2007)• Filter-function / dynamical decoupling perspectives (Cywiński et al., 2008; Green et al., 2013)• Synchronous detection and stroboscopic sampling techniques The distinctive contribution is an interoperable, verifiable control-plane representation (cycle anchoring, wrap-safe windows, tick-canonical verification) intended for distributed quantum architectures. LIMITATIONS AND REPORTING REQUIREMENTS The paper explicitly documents when phase-addressed scheduling does NOT help (white noise, no phase correlation) and specifies reporting requirements for any experimental evaluation to avoid overstating benefits. KEYWORDS phase-addressed measurement, scheduling, phase windows, cyclic phase, quantum control, POVM, drift, synchronization, distributed quantum systems, Timeverse, TAQA, Q-Address, HS-Bloch
This paper proposes an operational and falsifiable test of whether verified observer access to quantum measurement outcomes correlates with systematic deviations from the Born rule. We introduce a phenomenological indexical weighting factor Φ(I) and a new consistency axiom (NRU – No Retroactive Update) while preserving unitary dynamics. The design uses a clean Access vs. No-access toggle with rigorous controls (including yoked replays and sham-human baselines) and is feasible with existing photonic platforms. Abstract We propose an operational and falsifiable test of whether observer access to quantum measurement outcomes correlates with systematic deviations from the Born rule. The design implements a preregistered toggle between two physically isomorphic conditions: (Access) a live photon stream reaches a human retina and attention is verified via signal-detection measures, versus (No-access) the identical stream is generated and routed but optically blocked at the final millimeter. We formalize a phenomenological weighting of probabilities by an indexical factor Φ(I) over observer frames, derive an observer-access–weighted Born rule that reduces to standard quantum mechanics for uniform Φ, and show that non-signalling holds under locality of Φ̂ together with a no-retroactive-update (NRU) constraint. NRU is introduced axiomatically as a new postulate, and Φ(I) is treated as a phenomenological placeholder rather than a constructive model, with the aim of enabling direct empirical test. This is a preprint version (June 2026). A journal submission is in preparation.
We study a finite-dimensional quantum-operational formulation of the Quantum Temporal Boundary Collapse (QTBC) framework. First, nonnegative additive terminal weights and exhaustive terminal normalization imply that the total terminal functional is the trace on the positive cone. For a complete projective CP instrument with orthogonal rejection, this gives the projective Born weights p(a | ρ) = Tr(ρPa), without assuming projector-specific probabilities; the result remains conditional on standard quantum-instrument structure. Second, in the quantum realization where physical structural distinguishability is represented by trace distance, RSCP forces every closed deterministic CPTP evolution on the same finite-dimensional Hilbert space to be unitary. Third, selected future data define a retrodictive likelihood kernel. In a branch-support-preserving sharp sector, a terminal test in the admissible domain with effects Ffa= UPaU † perfectly distinguishes the conditional instrument branches and satisfies Φ∗ (Ffa ) = Pa. These results organize ordinary Born marginals, future-conditioned retrodiction, and branch-witness transport within one explicit dependency structure. Macroscopic record formation and single-history actualization are not derived here.