Recoverability of quantum coherence is formulated as a family of success-constrained operational frontiers indexed by a state, channel, or multi-time process, a task, an interface, and an exact- or minimum-success convention. The framework separates state ceilings from experimentally reachable performance and distinguishes restrictions due to control, time, uncertainty, environmental records, memory, and inaccessible channel structure. The manuscript develops a typed simulation preorder on complete response families, a compiler-relative closure order, and a directed response deficiency on success-tagged behaviors. It gives exact static trace-norm ceilings, success-frontier geometry, explicit memory and record benchmarks, primal-dual finite-experiment separation programs, and reference-assisted channel-lineage witnesses. “Shadow activation” denotes the interface-relative exposure of a pre-existing process distinction under an enriched tester interface; it is not proposed as a new microscopic law. Version 1.0 follows a claim-by-claim bibliography and content audit. It is a separate work, conceptually derived in part from the earlier Italian criterion DOI 10.5281/zenodo.21333992, but it is neither a translation nor a new version of that record. This is a theoretical preprint and has not been peer reviewed.
Recoverability of quantum coherence is formulated as a family of success-constrained operational frontiers indexed by a state, channel, or multi-time process, a task, an interface, and an exact- or minimum-success convention. The framework separates state ceilings from experimentally reachable performance and distinguishes restrictions due to control, time, uncertainty, environmental records, memory, and inaccessible channel structure. The manuscript develops a typed simulation preorder on complete response families, a compiler-relative closure order, and a directed response deficiency on success-tagged behaviors. It gives exact static trace-norm ceilings, success-frontier geometry, explicit memory and record benchmarks, primal-dual finite-experiment separation programs, and reference-assisted channel-lineage witnesses. “Shadow activation” denotes the interface-relative exposure of a pre-existing process distinction under an enriched tester interface; it is not proposed as a new microscopic law. Version 1.0 follows a claim-by-claim bibliography and content audit. It is a separate work, conceptually derived in part from the earlier Italian criterion DOI 10.5281/zenodo.21333992, but it is neither a translation nor a new version of that record. This is a theoretical preprint and has not been peer reviewed.
Quantum records may be well encoded upstream yet fail to support downstream inference when routing, decoder resources, memory, or comparison channels are restricted. We analyze finite routed quantum-record networks using task-specific Bayes risk. Three exact results provide the constructive core. First, a single Bell-coded pair supplied as the same complete input to GLOBAL and finite-round LOCC-late decoders yields the risk gap qμ/2, where q is pair-delivery probability and μ retained coherence; memory policy determines whether this access is preserved. Second, fixing local binary experiments with error rates 0.20 and 0.30, we determine the entire compatible joint-risk interval [0.15, 0.20] and an attaining decoder with minimax risk 0.20 that does not know the coupling. Third, a binary sufficient-statistic delivery law is attained by a three-record majority compression with nonzero raw risk, yielding a tight physical reconstruction defect. A generated-outcome model gives an exact receiver-availability boundary, while four reduced-description witnesses and continuity bounds delineate when source, state/resource, local-coupling, or clock/memory information is insufficient. The results distinguish record formation, receiver use, memory retention, and task-adequate comparison within standard finite quantum processes. Author manuscript, preprint version 1.0. This manuscript is not a peer-reviewed journal publication. A separate technical Supplement provides complete model definitions, proofs, channel specifications and numerical details. Reproducibility materials are available separately as Software release 1.3 on OSF: https://doi.org/10.17605/OSF.IO/5TDRB. The preprint and reproducibility record are separate, linked scholarly outputs.
What information about environmental memory must a quantum controller retain to guarantee a specified computational output? This preprint formulates that question in terms of task-sufficient process representations, intervention-valid predictions, stochastic clock laws, and explicit resource accounting. The central requirement is to preserve the outcomes and costs of the permitted decisions, with a stated accuracy contract and a finite-sample certificate. The paper connects two complementary lines of analysis. An operational construction studies Gaussian dephasing and controlled qubit tasks. A separate stochastic-clock analysis studies direct and inverse time changes, fractional relaxation, and the information that temporal coarse graining must transport. These constructions address related modelling questions but are not identified as a single microscopic noise model. The main elements are: Identical uncontrolled channels, different controlled responses. A continuum of Gaussian phase processes has the same uncontrolled coherence at every time and zero Breuer-Laine-Piilo backflow, yet different spin-echo responses. The construction shows why an uncontrolled channel family alone can fail to determine an intervention-dependent control decision. Task-sufficient equivalence and resource contracts. The manuscript defines a contract functional collecting accepted-output moments, acceptance probabilities, and physical costs over a declared policy family. Its finite linear task quotient identifies distinctions relevant to those predictions. Approximate sufficiency is accompanied by stability bounds that expose the sensitivity of conditional guarantees to low acceptance probabilities and small feasibility margins. Simultaneous finite-policy certification. Conservative confidence bounds certify conditional task bias and expected cost per accepted outcome after selection among a fixed, finite set of candidate policies. The assumptions include independent reset attempts, bounded observations and costs, and a trusted ideal reference. Failure to certify a candidate is explicitly distinguished from proof that no feasible physical policy exists. An explicit coarse-graining framework for stochastic clocks. The proposed decorated phase space records the process, permitted policy family, observable set, and clock law. The clock component transports stable laws under their natural scaling and relates domains of attraction to regular variation of waiting-time tails. Within the stated two-parameter clock-and-coupling family, the relaxation-rate direction scales with eigenvalue c^alpha. These clock results are placed in the established probabilistic renormalization literature; they do not establish hyperbolicity or convergence for the full decorated operator. A reset-sensitive fractional-relaxation calculation. Direct subordination of a quantum dynamical semigroup is distinguished from inverse-stable time change. For the latter, the paper compares uninterrupted evolution with independent renewal of the hidden clock and relevant environment. At half order and dimensionless rate one, the exact erfcx representation gives the short-time defect Delta(h) ~ 0.660989212585294 sqrt(h). The difference concerns the declared reset protocols, rather than a general assertion that every physical gate resets its environment. The reported classical benchmark uses ten candidate policies with explicit pulse depolarisation and separate X- and Z-expectation contracts. At the quasistatic endpoint, midpoint echo increases average identity-gate fidelity from 0.789293 to 0.990050. The fidelity crossover near r = 0.0467883 is distinct from the stricter X-task feasibility threshold r >= 0.9688074. For the selected Z-task input, dephasing is harmless and unnecessary echo pulses reduce the expectation. Conventional calibrated echo matches the best tested control performance; calibration, sampling, rejected attempts, and amortisation remain part of the resource account. Two questions are isolated as conjectures: boundedness of the task-quotient dimension along the coarse-graining orbit, and rigidity of the task quotient as a complete contract invariant. The manuscript specifies falsifiable numerical and experimental tests, including rescaled relaxation-profile collapse and finite tests of quotient-rank growth. It establishes no hardware advantage, scalable task-compression theorem, logical error-rate improvement, or error-correction overhead reduction. This illustrated version 2.0 contains 30 pages, four scientific figures, derivation and reproduction appendices, a methodological comparison with renormalization in one-dimensional dynamics, a glossary, and 58 references. The manuscript is dated 12 November 2026 and supersedes version 1.0 of 10 November 2026. The four figures show the uncontrolled/control-response contrast, task-dependent protection, finite-policy certification alongside dimensionless fractional relaxation, and the exact scalar clock-reset defect.
This preprint develops a framework for intervention-relative predictive memory: the minimum information that must be retained about the past in order to predict every future experiment allowed by a declared intervention set.For finite-dimensional linear processes, predictive memory is characterized exactly by a reachable-observable quotient and the rank of the corresponding past-future Hankel response matrix. The paper derives finite certification procedures, monotonicity under richer control, a decomposition of memory growth into reachability expansion and visibility activation, symmetry-protected compression, and no-compression results under sufficiently rich intervention algebras.The framework is connected to process-tensor bond rank, hidden-memory realization, and physical memory costs. At a prepare-and-measure temporal cut, linear, classical, and quantum memory are distinguished through ordinary rank, nonnegative rank, and positive-semidefinite rank. A robust quantum-dimension witness is derived for an n-message decoding task.A proposed single-photon spatial-mode experiment provides a concrete test. Phase-coded histories have identical present path-intensity distributions but can be perfectly distinguished by permitted future phase and Fourier operations, giving an ideal response matrix equal to the identity. For 17 modes, sufficiently high decoding success directly certifies a 17-dimensional quantum memory.The paper distinguishes established realization, automata, process-tensor, quantum-control, and factorization results from the proposed synthesis and experimental interpretation. It concludes with two natural next directions: experimental implementation and a multitime completely-positive / PSD-rank theory of intervention-relative quantum memory.
This record contains version 2 of the preprint “Identifiability Limits in Experimental Tests of Quantum Collapse.” It supersedes the conceptually broader first version deposited under DOI 10.5281/zenodo.19617199 and substantially revises the framing, formal results and experimental analysis. The paper formulates experimental tests of objective-collapse dynamics as an operational identifiability problem. It shows that finite accessible CPTP process statistics cannot uniformly distinguish fundamental nonunitarity from an unrestricted unitary-environment dilation. It then separates visibility loss, record formation and global measurement access, and derives a nuisance-profiled Fisher-information criterion for determining when complementary measurement channels jointly identify a shared collapse-parameter vector. A four-arm matched-control architecture is proposed that combines baseline stability, coherent reversibility, calibrated decoherence, durable-record formation and at least one independent side-effect channel. The result is a falsifiable experimental decision framework and a boundary on what accessible data can establish; it is not presented as an ontological solution of the quantum measurement problem. A major technical revision is available as version 3 under DOI 10.5281/zenodo.22072199. This record contains version 2 of the preprint “Identifiability Limits in Experimental Tests of Quantum Collapse.” It supersedes the conceptually broader first version deposited under DOI 10.5281/zenodo.19617199 and substantially revises the framing, formal results and experimental analysis. The paper formulates experimental tests of objective-collapse dynamics as an operational identifiability problem. It shows that finite accessible CPTP process statistics cannot uniformly distinguish fundamental nonunitarity from an unrestricted unitary-environment dilation. It then separates visibility loss, record formation and global measurement access, and derives a nuisance-profiled Fisher-information criterion for determining when complementary measurement channels jointly identify a shared collapse-parameter vector. A four-arm matched-control architecture is proposed that combines baseline stability, coherent reversibility, calibrated decoherence, durable-record formation and at least one independent side-effect channel. The result is a falsifiable experimental decision framework and a boundary on what accessible data can establish; it is not presented as an ontological solution of the quantum measurement problem. Files in this record:1. Main preprint PDF.2. Reproducibility package containing the journal-neutral source, editable manuscript, original figures, deterministic calculation and figure-generation code, machine-readable results, citation metadata and SHA-256 checksums. The included calculations are deterministic mathematical and synthetic checks; they are not experimental validation.
This preprint studies operational equivalence and recovery in a twenty-dimensional residual system with a fixed four-sector representation of dimensions 8, 8, 2 and 2. It distinguishes what a declared observation algebra can detect, what a channel preserves, and what a retained classical record makes recoverable. Record-resolved criteria separate useful reversible-error records from unrelated labels and measured-sector records, even when the discarded channel is the same. For a specified coarse-record model, the work identifies exactly recoverable observable algebras and proves an optimal entanglement-fidelity expression on a fixed four-state orbit code. Preparation-aware recovery is then classified over all one-use isometric subspaces in the stated family. An explicit ten-dimensional marker code attains exact recovery under a specified stochastic record where the whole-sector support restriction permits only eight dimensions. Its encoding, nonbaseline marker measurement, and conditional inverse operations remain supplied resources. Scoped Lean evidence verifies the explicit arbitrary-complex-matrix recovery construction and related finite identities; it does not formalize the general complete-positivity/reference framework or optimal-dimension theorem. The recorded-error model is not derived from the companion exchange-timing model, and no protection of its long pulse sequence is claimed.
This paper extends the Ontological Totality Functional (OTF) programme into the domain of quantum causal structure. Its central claim is that physical admissibility cannot be exhausted by state-level consistency or dynamical stability alone. It must also constrain the admissibility of causal organization itself. The paper introduces a causal defect functional for higher-order quantum processes and argues that definite causal order can emerge as a limiting case of admissible structure. Working in a finite-dimensional process-matrix setting, the paper defines the causal defect as the trace-norm distance to the set of valid causally separable processes with fixed normalization. It proves that this defect is non-negative, vanishes exactly on the causally separable set, and is convex. A free class of admissible supermaps is then identified: linear maps on processes that preserve validity, preserve causal separability, and are contractive in trace norm. Under these maps, the causal defect is monotone. An exact dual operational characterization is established: the causal defect equals the maximal bounded-test advantage over the causally separable set for Hermitian tests of bounded operator norm. In this sense, bounded causal witnesses arise as certified lower-bound functionals for admissibility. To connect the formalism to concrete physical scenarios, the paper studies a dephased-switch family W_eta = W_diag + eta X, where W_diag is causally separable and X encodes interference between orders. For this family, the defect is bounded above linearly in |eta|, while a witness with positive overlap on X yields a matching linear lower bound. As eta tends to zero, the process approaches definite-order admissibility. Within the OTF series, this paper functions as a frontier extension. Paper I introduced physical admissibility mathematically, Paper II studied admissibility in a tensor-cosmology channel, and Paper III interpreted admissibility ontologically. Paper IV shows that the same programme can be pushed into higher-order causal structure, where admissibility constrains not only which states and channels are physically stable but also which causal architectures can count as physically realized. Companion records in the OTF series:OTF I — DOI: 10.5281/zenodo.19068375OTF II — DOI: 10.5281/zenodo.19075284OTF Master Edition — DOI: 10.5281/zenodo.19077303