Open-Relation Quantum Computation (ORQC) is investigated as a contract-first organisation of standard quantum mechanics based on Causal-Relational Closure (CRC): irreversible records need not exhaust relational distinctions accessible to admissible future operations. The computational objects are complete future-response contracts, open relational transitions, and composition rules rather than a prescribed global state-vector history. A reproducible finite-model programme examines coherentrelation composition, noncommuting transformations, contextual completion, future-selected quantum connectivity, delayed operand binding, reusable and generative relational fabrics, and nonlinear outcome-generated computational sectors. A central three-operand example emits two overlapping Boolean-relation records while retaining a five-dimensional coherent branch. Three constrained local generators close exactly to a ten-dimensional Lie algebra isomorphic to so(5); fine-grained operandmeasurement preserves the emitted answer probabilities but destroys future-coherent responses. Additional examples establish exact reference-preserving output instruments under late future choices and successive irreversible records. Negative controls include unsuccessful native fault-tolerance attempts, inefficient sequential contextuality recycling, and adversarial demonstrations of equivalence with optimised conventional quantum circuits. A future-query memory bound and an oracle-accesscounterexample delimit claims of relational compression and coherent black-box control. Known stabilizer, measurement-based, contextuality, teleportation, and constrained-dynamics mechanisms are identified explicitly. The results establish an exploratory, reproducible computational methodology, not new quantum predictions, universal ORQC synthesis, physical quantum advantage, or a certified fault-tolerant implementation.
Open-Relation Quantum Computation (ORQC) is investigated as a contract-first organisation of standard quantum mechanics based on Causal-Relational Closure (CRC): irreversible records need not exhaust relational distinctions accessible to admissible future operations. The computational objects are complete future-response contracts, open relational transitions, and composition rules rather than a prescribed global state-vector history. A reproducible finite-model programme examines coherentrelation composition, noncommuting transformations, contextual completion, future-selected quantum connectivity, delayed operand binding, reusable and generative relational fabrics, and nonlinear outcome-generated computational sectors. A central three-operand example emits two overlapping Boolean-relation records while retaining a five-dimensional coherent branch. Three constrained local generators close exactly to a ten-dimensional Lie algebra isomorphic to so(5); fine-grained operandmeasurement preserves the emitted answer probabilities but destroys future-coherent responses. Additional examples establish exact reference-preserving output instruments under late future choices and successive irreversible records. Negative controls include unsuccessful native fault-tolerance attempts, inefficient sequential contextuality recycling, and adversarial demonstrations of equivalence with optimised conventional quantum circuits. A future-query memory bound and an oracle-accesscounterexample delimit claims of relational compression and coherent black-box control. Known stabilizer, measurement-based, contextuality, teleportation, and constrained-dynamics mechanisms are identified explicitly. The results establish an exploratory, reproducible computational methodology, not new quantum predictions, universal ORQC synthesis, physical quantum advantage, or a certified fault-tolerant implementation.
Causal-relational closure (CRC) distinguishes fixed local records from relations that remain open to physically admissible future operations. A sequence of small quantum-circuit laboratories develops this distinction through interfering pairings, target-excluding routes, coherent measurement interactions, and future-programmed quantum gates. The central worked experiment records an informative pointer bit that predicts an input bit with probability 3/4. In one record branch, a later controller measurement distinguishes two prepared phases with conditional probabilities 5/6 and 1/6; in another, the same readout is completely uninformative. More strongly, the phase alternatives in the latter branch produce identical surviving quantum states and therefore cannot be distinguished by any subsequent measurement on the retained apparatus. A no-interaction control shows that phase distinguishability was lost rather than merely revealed by adding another detector. Explicit response matrices illustrate contract refinement, while a second quotient calculation identifies redundant pointer histories under a declared downstream-consumer contract and shows how archive access restores their distinction. State and channel identities, success probabilities, complete instruments, conventional precedents, and dephasing controls are supplied throughout. Established quantum operations provide the implementation language, while CRC supplies the constructive organising principle: fixed events and future-distinguishable relations are treated as different physical questions. The resulting connected circuit family makes that ontological distinction calculable, testable, and accessible without changing standard quantum probabilities.
A formal framework is developed for causal-relational closure (CRC), the principle that a physical relation remains open while an admissible future can still complete, distinguish, or reroute it. At a causal cut, histories are compared only through the probabilities generated by physically admissible future protocols. Two histories are future-equivalent when every admissible continuation gives the same outcome statistics. The resulting future quotient is the coarsest prediction-preserving partition of past histories, and therefore the minimal operational object relative to the declared contract. Several structural results follow. Enlarging the admissible future can only refine the quotient; combining future contracts intersects their equivalence relations; distinctions that have become future-indistinguishable cannot reappear under a fixed complete contract; and exact quotient dynamics exists whenever forward evolution respects future equivalence. For quantum realizations, future equivalence becomes equality modulo the annihilator of the admissible effect space, yielding a contract-dependent distinguishability seminorm. A past-future response matrix provides a finite-dimensional linear representation whose rank defines an operational relational dimension without identifying quotient cardinality with Hilbert-space size. This structure supports quantitative definitions of closure capacity, active causal width, and epsilon-causal depth. Quantum erasure, delayed-choice entanglement swapping, reversible observer records, and complexity-limited black-hole decoding illustrate the same calculus. The mathematics overlaps with causal states, predictive state representations, quantum combs, process tensors, quantum Markov order, and statistical sufficiency; the distinctive claim is the physical inversion that the admissible future helps define the operative relational object rather than merely compress a pre-assumed instantaneous ontology.
A theory of quantum relations is proposed in which physical meaning is not exhausted by the structure visible on an instantaneous time slice. The central principle is that a quantum relation remains physically open while an admissible future operation can still complete, distinguish, or reroute that relation. Recorded local events remain fixed; relational topology can remain unresolved. The causal-relational closure principle is inspired by conceptual patterns from the Quantum Entanglement Spacetime Theory research programme, but no constructive derivation from Quantum Entanglement Spacetime Theory is assumed. Several established experiments become manifestations of one physical idea. Quantum erasure shows that later access to path information controls which interference relation becomes visible. Delayed-choice entanglement swapping shows that a later measurement can select entangled or separable conditional relations among already registered events. Entanglement swapping between photons that never coexisted shows that a quantum relation need not correspond to simultaneously existing endpoint systems. Localizable entanglement and measurement-based graph-state experiments show that weak pairwise signatures can coexist with strong future-realizable entanglement. These results provide retrospective empirical consistency tests, not exclusive confirmation over standard quantum mechanics. A new composite prediction follows: after endpoint events have been recorded, later Bell measurements on retained mediator systems can program which Bell-correlation graph is realized among those records, including pairings of endpoints that never coexisted. For 2m endpoints, (2m − 1)!! perfect-matching topologies are selectable in the ideal pairwise construction. The state vector remains a valid predictive representation, while instantaneous state structure need not coincide with final physically meaningful relational structure.
Relational quantum causal processes formulate finite operational contexts as normal positive functionals on local completely positive maps. Response differences generate an influence algebra, and its central projections define jointly readable Boolean events. We develop this starting point through a sequence of exact and controlled models. Fresh-environment unitary collision circuits produce dephasing-exchange kinetics with an exact charge-center fixed algebra, a uniform finite-step limit at fixed response order, and graph-controlled metastable Markov dynamics. An absorbing-state model exhibits a sharp transition between non-Abelian quantum memory and Boolean records. A reversal-covariant defect dynamics generates a locally finite partial order on a restricted graph family without assuming a Lyapunov time. Conditional on a certified order, a positive additive record measure, compactness, and identifiability, we prove subsequential convergence to a Lorentzian metric-measure space, finite reconstruction bounds, and uniqueness of admissible smooth limits. Complementary finite regulators provide controlled tests of modular-to-boost response, null tomography, same-update variational identities, induced quadratic gravity, and compatible common-refinement limits. These results are exact or controlled within their stated models, but they do not yet constitute a single background-independent microscopic law that jointly generates adjacency, time, volume normalization, dimension, signature, nonlinear Einstein constraints, and quantum matter. We therefore present RQCP-QG as a theorem-indexed framework that separates established mechanisms, conditional compositions, and open assumptions.
Quantum-reconstruction programmes normally begin after several structures have already stabilised: a system type, a tensor-product composition rule, an operational perspective, and a reference-frame regime. Quantum-reference-frame (QRF) research, by contrast, shows that precisely these structures may depend on physical perspective. We develop Relational-Perspectival Quantum Reconstruction (RPQR), an operational architecture that places perspective formation and subsystem composition upstream of a fixed-perspective quantum-reconstruction core. The primitive data are complete candidate situations, physically implementable protocols, outcome statistics, sequential composition, and admissible multi-fragment gluing. An informational perspective is the quotient induced by the protocols available in that perspective. We prove a quotient-factorisation theorem defining an information order, then separate information perspectives from stronger process perspectives carrying actual statistics-preserving simulator functors. Coherent simulator data yield an indexed operational theory and hence a fibration. Composition is not assumed primitive: a perspective-local tensor product is introduced only when admissible multi-input gluing is representable; preservation of the corresponding universal gluing is the criterion for strong monoidality of a perspective change. Finite reference, clock and control resources are compared only after transport to a common operational comparison theory, allowing ideal backgrounds to be represented as context-stable completion limits. A fixed, resource-stable, representable sector then conservatively recovers the operational signature required by a companion fixed-perspective reconstruction, without deriving its independent quantum-selection principles. The architecture is shown to be nontrivial by an explicit three-qubit Z2 QRF realisation based on the extra-particle framework. Two invariant global states are identical in a naive Alice-relative description but orthogonal in Bob’s relative description. The missing information is identified with the central charge algebra C ⊕ C, providing a finite transition-remainder witness. The chargeaware QRF transformation induces, after an explicit operational-saturation model specification, a typed equivalence of whole process fibres. Each perspective contains a preferred representable compositional sector, while the preferred subsystem decomposition is perspective dependent. The QRF is an exact finite-resource witness, and fixing a charge sector yields an ordinary 𝑀4 (C) quantum subsector in which the fixed-perspective reconstruction signature is recovered. Thus RPQR possesses an explicit finite nontrivial model realising the full T1–T5 architecture. We also state falsifiability diagnostics and delimit the claims: no universal information-to-process lifting theorem, no universal cross-perspective tensor covariance, and no new quantum dynamics are assumed.
Thirty-four quantum and causal paradoxes are shown to arise from four misuses of one distinction: the distinction between a fixed event and a closed relation. The Causal-Relational Closure (CRC) principle, introduced in a companion theory paper, states that a quantum relation remains physically open while an admissible future operation can still complete, distinguish, or reroute it, and that recorded local events never change. Each paradox examined here is traced to one of four failure modes: treating a fixed event as a closed relation; combining context-indexed relations into one classical description that a stated no-go result excludes; assuming a relation closed before any closure; or treating a reversible or coherently controlled measurement interaction as a completed closure. The paradoxes span quantum optics and trajectories (delayed choice, quantum erasure, Afshar, Mott's cloud-chamber track), pre- and post-selection (Hardy, three-box, quantum pigeonhole, quantum Cheshire Cat, the quantum liar, the past of a photon), nonlocality, contextuality and temporal correlations (Einstein--Podolsky--Rosen, Greenberger--Horne--Zeilinger, Kochen--Specker, teleportation, Leggett--Garg, quantum Zeno, Renninger's negative result), observer scenarios (Wigner's friend, Frauchiger--Renner, Local Friendliness, quantum delayed choice), quantum field theory (Fermi's two-atom problem, the Unruh effect), gravity and cosmology (the firewall argument, cosmic delayed choice, the Rietdijk--Putnam argument, the classicality of inflationary perturbations), and statistical and molecular physics (Gibbs, Landauer, Loschmidt, Hund's paradox of optical isomers). Earlier approaches in four domains exhibit structures that CRC seeks to organise: Mott's 1929 analysis of the cloud-chamber track, Hegerfeldt's weak causality, the Harlow--Hayden argument, and Jaynes's resolution of the Gibbs paradox. No new probabilities are predicted; the contribution is a single diagnostic that replaces a family of case-by-case resolutions.