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

Omega Beyond the Einstein–Bohr Boundary

Pasquale Kaboth

Published Aug 24, 2026• 0 citations
Publisher

Abstract

This work develops a mathematical and computational investigation of the Einstein–Bohr boundary problem by reformulating it as a problem of representation, projection, reconstruction, and empirical identifiability. Rather than beginning with a predetermined interpretation of quantum mechanics, the study asks a more constrained question: what mathematical structure would be required for an observer-independent carrier of physical states to be describable, reconstructable, and empirically distinguishable from standard quantum-mechanical explanations? A generalized carrier, denoted by Ω, is introduced as an algebraic-dynamical structure whose observable consequences arise through context-dependent projections. This formulation permits mathematical description without requiring a global, context-independent assignment of classical values. The resulting framework is examined against quantum contextuality, Bell/CHSH constraints, incomplete witness bases, information loss under projection, reconstruction ambiguity, dynamical consistency, and observational equivalence. A sequence of computational Model-Lab investigations then addresses a stronger problem: even if such a carrier can be mathematically represented, can it be empirically identified? History dependence, hidden memory, non-Markovian dynamics, causal breaks, system resets, and latent-state models are tested against increasingly strong quantum countermodels. These investigations show that several apparently distinctive signatures are insufficient by themselves. In particular, history dependence and memory can be reproduced by enlarged system–environment quantum models, and strong statistical evidence for memory does not automatically constitute evidence for an additional ontology. The analysis therefore proceeds to possible post-quantum escape routes. No-signalling supra-quantum correlations, nonlinear dynamics, complete-positivity boundaries, ancilla consistency, process-tensor descriptions, and higher-order quantum-process alternatives are examined as successive admissibility tests. These investigations motivate a hierarchy of constraints that any empirically meaningful extension must survive before a deviation from standard quantum modeling can reasonably be interpreted as evidence for additional physical structure. The final part develops a resource-bounded empirical discrimination program. Instead of allowing hidden environments or memory resources to grow without limit, the admissible quantum countermodel class is constrained by independently established physical resources. A synthetic memory-dimension experiment demonstrates how temporal process complexity can, under explicitly stated representation-dependent assumptions, provide a witness against a bounded-memory null class. Finite-sample simulations and adversarial null-model stress tests are used to explore the statistical behavior of this approach. The central conclusion is deliberately limited: Ω can be mathematically described within the developed model class, but mathematical describability does not establish its physical existence or unique empirical identification. Memory, history dependence, non-Markovianity, and unusual correlations are likewise insufficient on their own. Independent empirical warrant would require observations that cannot be reproduced by any admissible standard quantum model after environment, memory, causal, higher-order, and other relevant resources have been independently constrained. The work consequently transforms the original ontological question into a more precise experimental one: what observation would remain outside the equivalence class of all resource-bounded quantum-process explanations while continuing to satisfy the required probabilistic, causal, compositional, and physical consistency conditions? The accompanying computational artifacts document the Model-Lab simulations, identifiability tests, post-quantum model campaign, resource-bounded experiment, and adversarial null-model analysis. These numerical investigations are computational experiments and should not be interpreted as laboratory evidence for physics beyond quantum mechanics.

DOI
10.5281/zenodo.22082349

Related papers

From Distinguishability to Identifiability: An Operational Framework for Quantum States, Geometry, and Processes.

Paz Marcelo Esteban

When does operational distinguishability contain sufficient information to identify physical structure? We address this question through a resource-relative framework of Operational Informational Distinguishability (OID), designed to investigate the mathematical consistency of identifiability across quantum states, information geometry, and physical processes. An operational observer is characterized by (\mathcal{D}=(\mathcal{A},\mathcal{M},\mathcal{R},\delta)), whose labelled outcome distributions define an operational signature and induce equivalence classes of physically indistinguishable realizations. We establish an exact reconstruction criterion: a proposed geometric assignment factors uniquely through the operational signature if and only if it is constant on these equivalence classes. This provides a necessary-and-sufficient condition for operational reconstruction, while separating identifiability from the additional requirements of local non-degeneracy and stability. For faithful finite-dimensional quantum-state manifolds, we establish the measurement–information-geometric hierarchy[g^{(\mathcal{M})}\preceq g^{\mathrm{SLD}}\preceq g^{\mathrm{BKM}}relating measurement-restricted Fisher information, the symmetric logarithmic derivative metric, and the Bogoliubov–Kubo–Mori metric. We clarify the directional attainability of the SLD bound and its distinction from simultaneous multiparameter attainability. As an explicit algebraic result, we characterize the operator span generated by diagonal phase modulation of cyclic-shift eigenstate projectors in the one-excitation sector: it is precisely the constant-diagonal Hermitian subspace, of dimension (N^{2}-N+1), leaving (N-1) independent population directions unresolved. Adjoining site-basis projectors restores informational completeness. This idealized construction is connected to experimentally realized entangled measurements of (W) states. We further extend operational distinguishability to quantum processes through tester-restricted signatures and divergences, explicitly separating signalling from intervention-defined causal influence. Finally, we introduce accumulated information-geometric path length as a candidate operational clock parameter, without identifying it with physical time. By relating these constructions to holographic information-distance bounds, bulk entanglement, conditional mutual information and recovery, and recent approaches to emergent geometry and informational time, we formulate a central testable question: can a common resource-relative distinguishability structure remain identifiable, stable, and compositionally consistent across states, processes, geometry, temporal ordering, and causality? The framework makes both constructive reconstruction and mathematically explicit obstructions possible, providing a falsifiable methodological program rather than presupposing the emergence or unification of physical structure.

•Oct 30, 2026•0 citations

The Subordinator Renormalization Problem: When Markovian Error Models Misidentify Quantum Memory

Marcos Eduardo Elias Eliashberg Elias

A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the

•Nov 10, 2026•0 citations

The Admissibility of Natural Physics Part 1

Christoforos Panagis

The Admissibility of Natural Physics, Part I begins where an admissibility-first reconstruction of single-system quantum mechanics ends. Its central question is not whether the familiar tensor-product formalism can be assumed, but whether any physical composition law can be derived without importing composite systems, global state spaces, entanglement, locality, or signalling as primitives. The book develops a disciplined reconstruction of binary quantum composition from operational and structural requirements. It first records the exact content and limitations of the inherited single-system closure, establishes dependency and non-circularity statutes, and introduces the possible object of natural physics only as a provisional target ledger rather than as an assumed ontology. It then examines joint preparation, product states and effects, marginal consistency, operational no-signalling, minimal and maximal probabilistic composites, local tomography, and the classification of admissible tensor-product representations. Particular attention is given to the distinction between a mathematical representation theorem and the uniqueness of a physical composition rule. Real, complex, quaternionic, Jordan-algebraic, minimal, maximal, restricted, and non-tomographic alternatives are compared under explicitly declared admissibility conditions. The complex Hilbert-space tensor product is recovered only on branches satisfying the required factorization, coherence, scalar, and operational closure conditions. Where several inequivalent composites survive, the result is a classified family rather than a falsely asserted uniqueness theorem. Entanglement is introduced only after composition has been commissioned. It is defined as the failure of an admitted joint state to belong to the convex closure of admitted product preparations. The analysis proves, within the resulting predictive grammar, that entanglement is a property of composite-state geometry, not an additional force, substance, interaction mechanism, or signalling channel. Throughout, the argument enforces quotient primacy, refinement stability, finite diagnostic closure, regeneration stability, explicit dependency receipts, local termination, and the possibility of Undefined as a legitimate scientific outcome. Part I therefore supplies neither a speculative ontology nor a presupposed many-world formalism. It provides a conditional classification theorem for binary physical composition and identifies precisely what remains to be established before interaction, repeated composition, particle identity, locality, fields, symmetries, and particle content may be addressed.

•Jun 23, 2026•0 citations

META–CAUSAL: The Geometry of Predictive Memory and the Limits of Reconstructibility

Boris Batenin, Andrei Preece

META–CAUSAL: The Geometry of Predictive Memory and the Limits of Reconstructibility investigates a fundamental question: how much internal memory is required to reproduce an observable process, and how much of its hidden structure can be recovered from measurements? The monograph connects predictive memory, spectral invariants, and operational reconstruction across classical stochastic and quantum models. Its central perspective is that a simple observed signal need not admit a simple internal realization. Memory requirements depend on positivity, probability normalization, accessible measurements, and the distinction between exact reproduction and approximation. A principal result turns the approximation of a periodic spike into an exact fractional matching problem on a divisor hypergraph. For a spike of amplitude b, with 0 < b ≤ 1, repeating every n steps, the optimal uniform error of an m-state homogeneous Markov model, where 1 ≤ m < n, is Eₘ = b/(1 + νₘ). Here νₘ is the largest fractional matching mass attainable within the available cycle budget. This correspondence produces explicit stochastic constructions and matching lower bounds, revealing a staircase of memory thresholds. For period 210, the exact values include E₁₀₀ = 2b/7 and E₁₀₇ = b/4; period 1050 exhibits an additional plateau at 3b/8. A universal rational polytope organizes the possible error levels through determinant formulas, while a structural analysis identifies the final three thresholds for an arbitrary number of distinct prime divisors without enumerating the polytope’s vertices. The broader investigation examines what observations preserve, what they conceal, and what remains certifiable under noise. Spectral witnesses, positive realizations, finite-sample topological certificates, and geometric models involving S³, Hopf structures, and Berger metrics address complementary aspects of this problem. In open quantum systems, the distinction between a damping gap and a purity gap separates dynamical relaxation from the stability of stationary-state topology. The resulting framework combines exact mathematical statements, rational computational certificates, and explicitly conditional physical models. Its contribution is a concrete account of how algebraic, combinatorial, and geometric structure governs both the cost of prediction and the limits of reconstruction.

•Oct 15, 2026•0 citations

久那斗 Kunato Core Ver.5.0.0: Ontological Admission, Typed Representation Transport, and Effective-Structure Validation

Scheduler4861

Abstract We present Kunato Core Ver.5.0.0, a general framework for ontological admission, typed representation transport, empirical identifiability, effective-structure validation, and provenance-preserving epistemic state transition. The framework addresses a recurrent inferential problem across mathematical physics, statistical inference, inverse problems, effective theories, information theory, complex systems, quantum theory, and scientific realism: mathematical definability, empirical adequacy, model identification, and physical realization are distinct achievements and must not be silently promoted into one another. Kunato formalizes this separation through the constraint Formal(M) AND Emp(M; O) DOES NOT IMPLY Ontic(M). No representation receives automatic ontological privilege. Finite observation provides a first source of non-identification. Distinct formal models can agree exactly on a finite empirical record; in particular, uncountably many models can be constructed that coincide on any prescribed finite set of sample points. This establishes non-uniqueness within the relevant formal model class without promoting mathematical alternatives into claims about distinct physical causal histories. Finite measurement precision is treated through fibers of explicit resolution maps rather than by identifying metric neighborhoods with equivalence classes. The framework further distinguishes finite-dimensional state spaces from finite-state ontologies: finite-dimensional complex Hilbert spaces can contain a continuum of pure-state rays, whereas finite operational distinguishability requires additional assumptions such as a uniform positive separation scale on a compact state space. For stochastic observations, Kunato separates distributional identifiability, asymptotic inference, finite-sample discrimination, and zero-error identification. Positive overlap between competing observational laws prevents zero-error discrimination from the corresponding finite record. Increasing statistical evidence can therefore strengthen discrimination without automatically supplying an ontological realization warrant. Identification within a declared candidate class likewise remains conditional on that class and does not establish that physical reality belongs to it. The mathematical core is a typed property-transport calculus. Given a representation map Phi: X -> Y and a property P: X -> Z, P factors through Phi precisely when P is constant on every fiber of Phi. Equivalently, the kernel equivalence relation induced by Phi is contained in the kernel equivalence relation induced by P. This criterion separates state identification from property identification: a non-injective representation may fail to recover individual source states while still determining every property invariant on its fibers. Representation types, identified by their induced fiber equivalence relations, are organized by refinement within the complete lattice of equivalence relations on X. This provides a common mathematical structure for coarse-graining, quotient representations, projections, information loss, recoverability, and comparison of effective descriptions. Refinement is a partial order, so representations may also be incomparable. Effective structures consequently require property-specific transport warrants. Compression of a unitary parent operator, for example, need not preserve unitarity or normality. Conversely, non-normality alone does not entail a non-real spectrum, irreversibility, non-Markovianity, or absence of characteristic timescales. Observable symmetry, effective geometry, statistical regularity, entropy, information structure, temporal scales, and other representation-dependent properties cannot be transported automatically to a parent ontology. Kunato operationalizes these restrictions through methodological admission protocols. The Metric Admission Protocol regulates inference from effective metric structure to fundamental geometry. The Statistical-Invariant Admission Protocol separates existence of a mean from typicality, concentration, and self-averaging. The Timescale Admission Protocol distinguishes observed decay and hazard structure from claims about fundamental temporal dynamics. The Informational-Semantic Admission Protocol constrains inference from probability, entropy, information geometry, and semantic structure to latent ontology. The Criticality Admission Protocol separates phenomenological scaling from stronger claims of critical structure by requiring appropriately scoped diagnostics such as finite-size behavior, exponent stability, data collapse, robustness analysis, and negative controls. These protocols are methodological admission criteria rather than asserted laws of nature. Ontological admission is governed by differentiated semantic, fit, identification, scope, realization, revocation, and provenance warrants. These warrant types prevent empirical fit, interpretation, candidate-class identification, physical realization, and evidential history from being collapsed into an undifferentiated notion of support. Epistemic judgments are represented as contextual and versioned states, allowing changes in evidence, candidate classes, semantics, scope, and warrants to be reconstructed as explicit state transitions rather than hidden revisions. A central distinction is that UNRESOLVED is not REJECTED. Failure to establish an adequate promotion warrant blocks the requested inference but does not establish falsity or nonexistence. Rejection requires an independent refutation condition. Revocation acts on claims and accepted epistemic states while retaining their provenance; it does not imply any operation on authors or other persons. Self-application closes the framework. Continuum models, discrete models, cellular automata, XOR-based constructions, effective theories, quantum representations, and Kunato itself receive no exemption from the admission rules. Failure to identify a continuum ontology does not identify a discrete ontology, empirical adequacy of a constructive model does not establish its fundamental realization, and formal validity of Kunato does not confer physical ontological status on Kunato. The framework therefore entails neither a privileged fundamental model nor ontological nihilism. Not identified does not imply false, and not admitted does not imply nonexistent. Kunato Core Ver.5.0.0 provides a unified formal and computational vocabulary for ontological admission, finite-data non-identification, finite-record discrimination, inverse problems, coarse-graining, property factorization, representation refinement, effective dynamics, statistical invariants, temporal inference, information-theoretic interpretation, criticality assessment, model-class identification, provenance, epistemic-state revision, and scientific realism. Its objective is not to determine a preferred ontology by methodological fiat, but to make the inferential boundaries between representation, observation, identification, and physical realization explicit and auditable. The framework is summarized by four constraints: no hidden epistemic transition; no hidden ontological promotion; no untyped representational transport; and no self-exemption. Its terminal methodological principle is: no representation receives automatic ontological privilege.

•Aug 19, 2026•0 citations

Quantum Collapse and Computation in an Everett Multiverse

Fabrizio Tamburini, Ignazio Francesco Licata

The mathematical representation of the universe consists of sequences of symbols, rules and operators containing Gödel's undecidable propositions: information and its manipulation, also with Turing Machines. Classical information theory and mathematics, ideally independent from the medium used, can be interpreted realistically and objectively from their correspondence with quantum information, which is physical. Each representation of the universe and its evolution are, in any case, physical subsets of the universe, structured sets of observers and their complements in the universe made with spacetime events generated by local quantum measurements. Their description becomes a semantically closed structure without a global object-environment loss of decoherence as a von Neumann's universal constructor with a semantical abstract whose structure cannot be decided deterministically a priori from an internal observer. In a semantically closed structure, the realization of a specific event that writes the semantical abstract of the constructor is a problem of finding "which way" for the evolution of the universe as a choice of the constructor's state in a metastructure, like the many-world Everett scenario, from a specific result of any quantum measurement, corresponding to a Gödel undecidable proposition for an internal observer.

arXiv:2401.13336•Entropy•Dec 9, 2024•1 citation
This work develops a mathematical and computational investigation of the Einstein–Bohr boundary problem by reformulating it as a problem of representation, projection, reconstruction, and empirical identifiability. Rather than beginning with a predetermined interpretation of quantum mechanics, the study asks a more constrained question: what mathematical structure would be required for an observer-independent carrier of physical states to be describable, reconstructable, and empirically distinguishable from standard quantum-mechanical explanations? A generalized carrier, denoted by Ω, is introduced as an algebraic-dynamical structure whose observable consequences arise through context-dependent projections. This formulation permits mathematical description without requiring a global, context-independent assignment of classical values. The resulting framework is examined against quantum contextuality, Bell/CHSH constraints, incomplete witness bases, information loss under projection, reconstruction ambiguity, dynamical consistency, and observational equivalence. A sequence of computational Model-Lab investigations then addresses a stronger problem: even if such a carrier can be mathematically represented, can it be empirically identified? History dependence, hidden memory, non-Markovian dynamics, causal breaks, system resets, and latent-state models are tested against increasingly strong quantum countermodels. These investigations show that several apparently distinctive signatures are insufficient by themselves. In particular, history dependence and memory can be reproduced by enlarged system–environment quantum models, and strong statistical evidence for memory does not automatically constitute evidence for an additional ontology. The analysis therefore proceeds to possible post-quantum escape routes. No-signalling supra-quantum correlations, nonlinear dynamics, complete-positivity boundaries, ancilla consistency, process-tensor descriptions, and higher-order quantum-process alternatives are examined as successive admissibility tests. These investigations motivate a hierarchy of constraints that any empirically meaningful extension must survive before a deviation from standard quantum modeling can reasonably be interpreted as evidence for additional physical structure. The final part develops a resource-bounded empirical discrimination program. Instead of allowing hidden environments or memory resources to grow without limit, the admissible quantum countermodel class is constrained by independently established physical resources. A synthetic memory-dimension experiment demonstrates how temporal process complexity can, under explicitly stated representation-dependent assumptions, provide a witness against a bounded-memory null class. Finite-sample simulations and adversarial null-model stress tests are used to explore the statistical behavior of this approach. The central conclusion is deliberately limited: Ω can be mathematically described within the developed model class, but mathematical describability does not establish its physical existence or unique empirical identification. Memory, history dependence, non-Markovianity, and unusual correlations are likewise insufficient on their own. Independent empirical warrant would require observations that cannot be reproduced by any admissible standard quantum model after environment, memory, causal, higher-order, and other relevant resources have been independently constrained. The work consequently transforms the original ontological question into a more precise experimental one: what observation would remain outside the equivalence class of all resource-bounded quantum-process explanations while continuing to satisfy the required probabilistic, causal, compositional, and physical consistency conditions? The accompanying computational artifacts document the Model-Lab simulations, identifiability tests, post-quantum model campaign, resource-bounded experiment, and adversarial null-model analysis. These numerical investigations are computational experiments and should not be interpreted as laboratory evidence for physics beyond quantum mechanics.
When does operational distinguishability contain sufficient information to identify physical structure? We address this question through a resource-relative framework of Operational Informational Distinguishability (OID), designed to investigate the mathematical consistency of identifiability across quantum states, information geometry, and physical processes. An operational observer is characterized by (\mathcal{D}=(\mathcal{A},\mathcal{M},\mathcal{R},\delta)), whose labelled outcome distributions define an operational signature and induce equivalence classes of physically indistinguishable realizations. We establish an exact reconstruction criterion: a proposed geometric assignment factors uniquely through the operational signature if and only if it is constant on these equivalence classes. This provides a necessary-and-sufficient condition for operational reconstruction, while separating identifiability from the additional requirements of local non-degeneracy and stability. For faithful finite-dimensional quantum-state manifolds, we establish the measurement–information-geometric hierarchy[g^{(\mathcal{M})}\preceq g^{\mathrm{SLD}}\preceq g^{\mathrm{BKM}}relating measurement-restricted Fisher information, the symmetric logarithmic derivative metric, and the Bogoliubov–Kubo–Mori metric. We clarify the directional attainability of the SLD bound and its distinction from simultaneous multiparameter attainability. As an explicit algebraic result, we characterize the operator span generated by diagonal phase modulation of cyclic-shift eigenstate projectors in the one-excitation sector: it is precisely the constant-diagonal Hermitian subspace, of dimension (N^{2}-N+1), leaving (N-1) independent population directions unresolved. Adjoining site-basis projectors restores informational completeness. This idealized construction is connected to experimentally realized entangled measurements of (W) states. We further extend operational distinguishability to quantum processes through tester-restricted signatures and divergences, explicitly separating signalling from intervention-defined causal influence. Finally, we introduce accumulated information-geometric path length as a candidate operational clock parameter, without identifying it with physical time. By relating these constructions to holographic information-distance bounds, bulk entanglement, conditional mutual information and recovery, and recent approaches to emergent geometry and informational time, we formulate a central testable question: can a common resource-relative distinguishability structure remain identifiable, stable, and compositionally consistent across states, processes, geometry, temporal ordering, and causality? The framework makes both constructive reconstruction and mathematically explicit obstructions possible, providing a falsifiable methodological program rather than presupposing the emergence or unification of physical structure.
A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the
The Admissibility of Natural Physics, Part I begins where an admissibility-first reconstruction of single-system quantum mechanics ends. Its central question is not whether the familiar tensor-product formalism can be assumed, but whether any physical composition law can be derived without importing composite systems, global state spaces, entanglement, locality, or signalling as primitives. The book develops a disciplined reconstruction of binary quantum composition from operational and structural requirements. It first records the exact content and limitations of the inherited single-system closure, establishes dependency and non-circularity statutes, and introduces the possible object of natural physics only as a provisional target ledger rather than as an assumed ontology. It then examines joint preparation, product states and effects, marginal consistency, operational no-signalling, minimal and maximal probabilistic composites, local tomography, and the classification of admissible tensor-product representations. Particular attention is given to the distinction between a mathematical representation theorem and the uniqueness of a physical composition rule. Real, complex, quaternionic, Jordan-algebraic, minimal, maximal, restricted, and non-tomographic alternatives are compared under explicitly declared admissibility conditions. The complex Hilbert-space tensor product is recovered only on branches satisfying the required factorization, coherence, scalar, and operational closure conditions. Where several inequivalent composites survive, the result is a classified family rather than a falsely asserted uniqueness theorem. Entanglement is introduced only after composition has been commissioned. It is defined as the failure of an admitted joint state to belong to the convex closure of admitted product preparations. The analysis proves, within the resulting predictive grammar, that entanglement is a property of composite-state geometry, not an additional force, substance, interaction mechanism, or signalling channel. Throughout, the argument enforces quotient primacy, refinement stability, finite diagnostic closure, regeneration stability, explicit dependency receipts, local termination, and the possibility of Undefined as a legitimate scientific outcome. Part I therefore supplies neither a speculative ontology nor a presupposed many-world formalism. It provides a conditional classification theorem for binary physical composition and identifies precisely what remains to be established before interaction, repeated composition, particle identity, locality, fields, symmetries, and particle content may be addressed.
META–CAUSAL: The Geometry of Predictive Memory and the Limits of Reconstructibility investigates a fundamental question: how much internal memory is required to reproduce an observable process, and how much of its hidden structure can be recovered from measurements? The monograph connects predictive memory, spectral invariants, and operational reconstruction across classical stochastic and quantum models. Its central perspective is that a simple observed signal need not admit a simple internal realization. Memory requirements depend on positivity, probability normalization, accessible measurements, and the distinction between exact reproduction and approximation. A principal result turns the approximation of a periodic spike into an exact fractional matching problem on a divisor hypergraph. For a spike of amplitude b, with 0 < b ≤ 1, repeating every n steps, the optimal uniform error of an m-state homogeneous Markov model, where 1 ≤ m < n, is Eₘ = b/(1 + νₘ). Here νₘ is the largest fractional matching mass attainable within the available cycle budget. This correspondence produces explicit stochastic constructions and matching lower bounds, revealing a staircase of memory thresholds. For period 210, the exact values include E₁₀₀ = 2b/7 and E₁₀₇ = b/4; period 1050 exhibits an additional plateau at 3b/8. A universal rational polytope organizes the possible error levels through determinant formulas, while a structural analysis identifies the final three thresholds for an arbitrary number of distinct prime divisors without enumerating the polytope’s vertices. The broader investigation examines what observations preserve, what they conceal, and what remains certifiable under noise. Spectral witnesses, positive realizations, finite-sample topological certificates, and geometric models involving S³, Hopf structures, and Berger metrics address complementary aspects of this problem. In open quantum systems, the distinction between a damping gap and a purity gap separates dynamical relaxation from the stability of stationary-state topology. The resulting framework combines exact mathematical statements, rational computational certificates, and explicitly conditional physical models. Its contribution is a concrete account of how algebraic, combinatorial, and geometric structure governs both the cost of prediction and the limits of reconstruction.
Abstract We present Kunato Core Ver.5.0.0, a general framework for ontological admission, typed representation transport, empirical identifiability, effective-structure validation, and provenance-preserving epistemic state transition. The framework addresses a recurrent inferential problem across mathematical physics, statistical inference, inverse problems, effective theories, information theory, complex systems, quantum theory, and scientific realism: mathematical definability, empirical adequacy, model identification, and physical realization are distinct achievements and must not be silently promoted into one another. Kunato formalizes this separation through the constraint Formal(M) AND Emp(M; O) DOES NOT IMPLY Ontic(M). No representation receives automatic ontological privilege. Finite observation provides a first source of non-identification. Distinct formal models can agree exactly on a finite empirical record; in particular, uncountably many models can be constructed that coincide on any prescribed finite set of sample points. This establishes non-uniqueness within the relevant formal model class without promoting mathematical alternatives into claims about distinct physical causal histories. Finite measurement precision is treated through fibers of explicit resolution maps rather than by identifying metric neighborhoods with equivalence classes. The framework further distinguishes finite-dimensional state spaces from finite-state ontologies: finite-dimensional complex Hilbert spaces can contain a continuum of pure-state rays, whereas finite operational distinguishability requires additional assumptions such as a uniform positive separation scale on a compact state space. For stochastic observations, Kunato separates distributional identifiability, asymptotic inference, finite-sample discrimination, and zero-error identification. Positive overlap between competing observational laws prevents zero-error discrimination from the corresponding finite record. Increasing statistical evidence can therefore strengthen discrimination without automatically supplying an ontological realization warrant. Identification within a declared candidate class likewise remains conditional on that class and does not establish that physical reality belongs to it. The mathematical core is a typed property-transport calculus. Given a representation map Phi: X -> Y and a property P: X -> Z, P factors through Phi precisely when P is constant on every fiber of Phi. Equivalently, the kernel equivalence relation induced by Phi is contained in the kernel equivalence relation induced by P. This criterion separates state identification from property identification: a non-injective representation may fail to recover individual source states while still determining every property invariant on its fibers. Representation types, identified by their induced fiber equivalence relations, are organized by refinement within the complete lattice of equivalence relations on X. This provides a common mathematical structure for coarse-graining, quotient representations, projections, information loss, recoverability, and comparison of effective descriptions. Refinement is a partial order, so representations may also be incomparable. Effective structures consequently require property-specific transport warrants. Compression of a unitary parent operator, for example, need not preserve unitarity or normality. Conversely, non-normality alone does not entail a non-real spectrum, irreversibility, non-Markovianity, or absence of characteristic timescales. Observable symmetry, effective geometry, statistical regularity, entropy, information structure, temporal scales, and other representation-dependent properties cannot be transported automatically to a parent ontology. Kunato operationalizes these restrictions through methodological admission protocols. The Metric Admission Protocol regulates inference from effective metric structure to fundamental geometry. The Statistical-Invariant Admission Protocol separates existence of a mean from typicality, concentration, and self-averaging. The Timescale Admission Protocol distinguishes observed decay and hazard structure from claims about fundamental temporal dynamics. The Informational-Semantic Admission Protocol constrains inference from probability, entropy, information geometry, and semantic structure to latent ontology. The Criticality Admission Protocol separates phenomenological scaling from stronger claims of critical structure by requiring appropriately scoped diagnostics such as finite-size behavior, exponent stability, data collapse, robustness analysis, and negative controls. These protocols are methodological admission criteria rather than asserted laws of nature. Ontological admission is governed by differentiated semantic, fit, identification, scope, realization, revocation, and provenance warrants. These warrant types prevent empirical fit, interpretation, candidate-class identification, physical realization, and evidential history from being collapsed into an undifferentiated notion of support. Epistemic judgments are represented as contextual and versioned states, allowing changes in evidence, candidate classes, semantics, scope, and warrants to be reconstructed as explicit state transitions rather than hidden revisions. A central distinction is that UNRESOLVED is not REJECTED. Failure to establish an adequate promotion warrant blocks the requested inference but does not establish falsity or nonexistence. Rejection requires an independent refutation condition. Revocation acts on claims and accepted epistemic states while retaining their provenance; it does not imply any operation on authors or other persons. Self-application closes the framework. Continuum models, discrete models, cellular automata, XOR-based constructions, effective theories, quantum representations, and Kunato itself receive no exemption from the admission rules. Failure to identify a continuum ontology does not identify a discrete ontology, empirical adequacy of a constructive model does not establish its fundamental realization, and formal validity of Kunato does not confer physical ontological status on Kunato. The framework therefore entails neither a privileged fundamental model nor ontological nihilism. Not identified does not imply false, and not admitted does not imply nonexistent. Kunato Core Ver.5.0.0 provides a unified formal and computational vocabulary for ontological admission, finite-data non-identification, finite-record discrimination, inverse problems, coarse-graining, property factorization, representation refinement, effective dynamics, statistical invariants, temporal inference, information-theoretic interpretation, criticality assessment, model-class identification, provenance, epistemic-state revision, and scientific realism. Its objective is not to determine a preferred ontology by methodological fiat, but to make the inferential boundaries between representation, observation, identification, and physical realization explicit and auditable. The framework is summarized by four constraints: no hidden epistemic transition; no hidden ontological promotion; no untyped representational transport; and no self-exemption. Its terminal methodological principle is: no representation receives automatic ontological privilege.
The mathematical representation of the universe consists of sequences of symbols, rules and operators containing Gödel's undecidable propositions: information and its manipulation, also with Turing Machines. Classical information theory and mathematics, ideally independent from the medium used, can be interpreted realistically and objectively from their correspondence with quantum information, which is physical. Each representation of the universe and its evolution are, in any case, physical subsets of the universe, structured sets of observers and their complements in the universe made with spacetime events generated by local quantum measurements. Their description becomes a semantically closed structure without a global object-environment loss of decoherence as a von Neumann's universal constructor with a semantical abstract whose structure cannot be decided deterministically a priori from an internal observer. In a semantically closed structure, the realization of a specific event that writes the semantical abstract of the constructor is a problem of finding "which way" for the evolution of the universe as a choice of the constructor's state in a metastructure, like the many-world Everett scenario, from a specific result of any quantum measurement, corresponding to a Gödel undecidable proposition for an internal observer.