This paper introduces QXymb, a general framework for constructing observational declarative twins of quantum circuits, and develops QILP-0, its first complete order-0 specialization. QILP-0 constructs a finite multi-valued propositional logic program from observed circuit behaviour within a declared observational scope.
The pipeline traverses a declared family of quantum observables incrementally according to a reproducible structural grading and a declared observational reference horizon. Progress is quantified through reference-relative coverage against a fixed target-independent reference. Observable responses are organized through target-independent geometry, while retained latent structure is mapped deterministically back to original observable columns before symbolic processing, preserving observational semantics and provenance.
Selected observable profiles are converted into a finite relation through admissible target-independent discretization. The target is used only afterwards to audit twin-admissibility and induce the declarative theory. A theory is certified as an exact observational declarative twin when it completely and correctly reconstructs the resulting finite task-conditioned discrete relation. Logical exactness is therefore separated from numerical, backend, provider, and discretization uncertainty, which is retained as audit metadata.
Validation uses two complementary QML settings. Exhaustive Bars & Stripes experiments compare product and grid-CZ embeddings from 16 to 100 qubits and exercise the native-discrete branch. Low-Depth MNIST analyses all 14,708 digit-0/1 instances before and after a trained variational quantum transformation and exercises continuous discretization. In every reported relation, the induced QILP-0 theory achieves complete, conflict-free reconstruction with strict accuracy equal to one.
Comments
39 pages, 7 figures. Submitted to Knowledge-Based Systems
This paper introduces QXymb, a general framework for constructing observational declarative twins of quantum circuits, and develops QILP-0, its first complete order-0 specialization. QILP-0 constructs a finite multi-valued propositional logic program from observed circuit behaviour within a declared observational scope.
The pipeline traverses a declared family of quantum observables incrementally according to a reproducible structural grading and a declared observational reference horizon. Progress is quantified through reference-relative coverage against a fixed target-independent reference. Observable responses are organized through target-independent geometry, while retained latent structure is mapped deterministically back to original observable columns before symbolic processing, preserving observational semantics and provenance.
Selected observable profiles are converted into a finite relation through admissible target-independent discretization. The target is used only afterwards to audit twin-admissibility and induce the declarative theory. A theory is certified as an exact observational declarative twin when it completely and correctly reconstructs the resulting finite task-conditioned discrete relation. Logical exactness is therefore separated from numerical, backend, provider, and discretization uncertainty, which is retained as audit metadata.
Validation uses two complementary QML settings. Exhaustive Bars & Stripes experiments compare product and grid-CZ embeddings from 16 to 100 qubits and exercise the native-discrete branch. Low-Depth MNIST analyses all 14,708 digit-0/1 instances before and after a trained variational quantum transformation and exercises continuous discretization. In every reported relation, the induced QILP-0 theory achieves complete, conflict-free reconstruction with strict accuracy equal to one.
A Kernel-Role Determinacy Theorem for Record Fixation, Fixed-Domain Quotients, and Boundary-Trace Normal Form This paper specializes the AASC kernel to the construction and use of quantum measurement records. Its central question is not initially how outcomes are produced, whether a wavefunction collapses, or which interpretation of quantum theory is correct. It asks what must be fixed for a measurement record to function as the same determinate physical and evidential object across retention, prospective use, deliberation, comparison, and report. For any non-degenerate determinate physical object, state, carrier, transformation, record, comparison, or endpoint, the paper takes the governing kernel to be: NDObj(x) ⇒ K(x) = (Adm, Stand, Ref, Irr). Admissibility, standing, reference, and irreversibility are therefore treated as necessary role conditions of determinate record use, not as an optional interpretive overlay added to an otherwise complete physical description. Measurement-record determinacy The manuscript constructs a fixed-domain measurement-record target in which a record must preserve: reference to the same construction token; standing-bearing evidential eligibility; admissible reuse; original act-time qualification; lawful redescription; retained and prospective record use; deliberative and comparative use; reportability and downstream inheritance. The resulting assignment space is quotiented by equivalence of standing-bearing measurement-record content. A rival quotient claiming exactly the same content collapses to the canonical measurement-record quotient. Representational differences that preserve the complete role content are treated as skin; differences affecting record identity, evidential ordering, admissibility, continuation, or downstream use remain physically relevant. Physically non-selective quantum regimes The paper then studies a physically non-selective quantum regime containing unitary branching, entanglement, decoherence, branch-local records, and stable local reports. The central result is conditional and target-specific: The bare unitary-entangling-decohering package can support multiple stable branch-local records without supplying a unique standing evidential record for the fixed construction-relative target. This is not a claim that branch-local records are unreal, unstable, or physically useless. It is a distinction between: physical occurrence of branch-local record structures; local branch-relative reportability; evidential role fixation for a record reused as the same standing object across the measurement practice. The paper shows that non-selective structures may agree on branch weights, density content, decoherence, correlations, instrument sums, channel closure, effect weights, projector orthogonality, and repeatability without selecting one fine record as the standing evidential record. Fixed-domain quotient and fixation commutation The theorem ladder establishes: fixed-domain assignment-space forcing; exact quotient construction for standing-bearing record content; same-scope equivalence collapse; fixation commutation under admissible transformation; inheritance of the original qualification requirement; persistence-bearing reuse; asymmetry exhaustion; anti-weakening; selector exhaustion. If evidential ordering varies across admissible assignments while the target requires one fixed-domain ordering, the ordering is not defined on that scope merely because numerical values or branch-local reports happen to coincide. The paper therefore treats measurement-record fixation as prior to the theory-level evidential reuse that depends on it. Boundary-trace normal form After internal and provenance/indexical routes have been exhausted, the residual same-domain route is a singleton stable boundary trace. Such a trace is not collapse dynamics, hidden-variable selection, or a new physical mechanism. It is an admissibility-preserving role anchor that can fix a record-bearing assignment only when its channel, incidence, transport law, original authority, and singleton-positive condition are independently warranted. The result distinguishes: sound partial selection from complete role fixation; unique trace value from unique original occupant; class-valued record fixation from raw-token fixation; later discovery of an original qualification from retroactive repair; physical record occurrence from standing evidential identity. Finite quantum specialization The paper occupies the abstract structure with an explicit finite two-branch quantum measurement domain containing: two outcomes; two fine records and one merged record; denominator-two branch weights; a balanced integer-amplitude state; density-table realization; selective and non-selective instrument maps; environment-record maps; projective branch maps; complementary effects; zero-product projectors; repeatability operations. On the declared balanced witness, amplitude weights, density weights, branch-map traces, effect weights, pointer records, instrument records, environment records, and channel records agree on the same branch architecture. Selective surfaces preserve the fine-record distinction. Non-selective surfaces agree only on the merged record. The fine records therefore remain separated, while the declared non-selective surfaces supply no singleton fine-record selector. The finite selector-boundary theorem eliminates the disjunction of candidate hidden selectors across the state, instrument, environment, channel, effect, and repeatability surfaces. The resulting diagnosis is precise: the missing structure is admissible fine-record role fixation, not further branch production, weighting, decoherence, stabilization, or repeatability. Scope and non-claims The manuscript establishes a finite, conditional, manuscript-facing theorem. It does not claim: to derive Hilbert-space quantum mechanics; to derive general POVM theory; to derive full projection-valued-measure theory; to reconstruct the full operator algebra; to provide a general Kraus representation theorem; to reconstruct complete positivity; to derive the continuum Born rule; to derive universal physical decoherence theory; to introduce a new collapse dynamics; to prove that no physical collapse process occurs in nature; to prove physical branch selection; to establish interpretive truth; to classify every possible physical measurement mechanism. The absence of a hidden selector on the declared finite non-selective surfaces is therefore not a theorem that no physical collapse or selection process can occur elsewhere. It is the finite theorem that those declared surfaces do not themselves supply the required fine-record selector. Relation to quantum interpretations The result does not deny the practical success of quantum theory, decoherence, branch-relative reporting, instrumental updates, or decision-theoretic methods. A practice aimed only at prediction, branch-local reporting, or instrumental updating may be a different target from the construction-relative record use studied here. If a theory claims to underwrite retained, prospective, deliberative, and evidential reuse of the same record-bearing construction token, it must preserve the relevant kernel roles and admit a standing-bearing fixation regime. Bare Everettian dynamics, without additional dynamics, ontological privileging, or admissible restriction to one constructional class, supplies no fine-record selector on the declared target. A strategy that preserves non-selective physics while restricting admissible record-fixation assignments belongs to a restriction-to-one-constructional-class route. Instrumentalist and QBist strategies instead reduce or redirect the target explanatory burden. Role in the AASC programme This paper provides the record-fixation layer of the AASC Quantum Determinacy Pair. Its companion Bell-scope work addresses the compatibility and no-signaling side of quantum witness determinacy. Together, the pair treats quantum records and witnesses as kernel-governed standing structures rather than as automatically determinate physical occurrences. The paper’s principal contribution is to identify the first failure point in a physically non-selective measurement regime: The initial problem is not necessarily the production of branch-local outcomes. It is the admissible fixation of the record role through which outcomes are retained, reported, remembered, compared, and used as evidence. The public Lean 4 formalization is synchronized with the finite measurement-boundary release v0.9.1 and provides the finite artifact for the declared effect, projector, compatibility, closed-stack, boundary-certificate, and audit layers. Keywords AASC; measurement problem; quantum measurement; measurement-record fixation; physically non-selective regimes; Everettian non-selection; record-role determinacy; fixed-domain quotient; standing equivalence; boundary-trace fixation; selector exhaustion; decoherence; branch-local records; admissibility and irreversibility; Lean 4 formalization
Unlike classical software, where logging and runtime tracing can effectively reveal internal execution status, quantum circuits possess unique properties, such as the no-cloning theorem and measurement-induced collapse, that prevent direct observation or duplication of their states. These characteristics make it especially challenging to monitor the execution of quantum circuits, complicating essential tasks such as debugging and runtime monitoring. This paper presents QMon, a practical methodology that leverages mid-circuit measurements, reset operations, and causal-cone replay to monitor selected intermediate values of quantum circuits while preserving their original runtime behavior under explicit conditions. QMon enables the instrumentation of monitoring operators at selected locations within the circuit, allowing comparisons between expected and observed one-qubit outcome probabilities at those locations. Under an ideal noise-free model, we prove that QMon preserves the full circuit state when the monitored qubit is separable, replay is exact, and the measurement record does not control later operations. Across 310 benchmark circuits with a 24-qubit limit per run, QMon monitors 44.54% of gate-qubit locations and 89.75% of circuit qubits at least once, on average. On 2,860 simulated buggy circuits (mutated circuits that alter final outputs), it achieves a detection rate of 62.4%, remaining competitive with three assertion baselines while requiring a median of one planned run per circuit, compared with 21 for the assertion baselines. By collecting multiple checkpoint observations within continued executions, QMon combines practical efficiency with an exact preservation guarantee under explicit conditions.
Realizing a conceptual quantum algorithm on an actual physical device necessitates the algorithm's quantum circuit description to undergo certain transformations in order to adhere to all constraints imposed by the hardware. In this regard, the individual high-level circuit components are first synthesized to the supported low-level gate-set of the quantum computer, before being mapped to the target's architecture-utilizing several optimizations in order to improve the compilation result. Specialized tools for this complex task exist, e.g., IBM's Qiskit, Google's Cirq, Microsoft's QDK, or Rigetti's Forest. However, to date, the circuits resulting from these tools are hardly verified, which is mainly due to the immense complexity of checking if two quantum circuits indeed realize the same functionality. In this paper, we propose an efficient scheme for quantum circuit equivalence checking-specialized for verifying results of the IBM Qiskit quantum circuit compilation flow. To this end, we combine characteristics unique to quantum computing, e.g., its inherent reversibility, and certain knowledge about the compilation flow into a dedicated equivalence checking strategy. Experimental evaluations confirm that the proposed scheme allows to verify even large circuit instances with tens of thousands of operations within seconds or even less, whereas state-of-the-art techniques frequently time-out or require substantially more runtime. A corresponding open source implementation of the proposed method is publicly available at https://github.com/iic-jku/qcec.
This report introduces a novel class of reasoning architectures, termed Quantum Circuit Reasoning Models (QCRM), which extend the concept of Variational Quantum Circuits (VQC) from energy minimization and classification tasks to structured logical inference and reasoning. We posit that fundamental quantum mechanical operations, superposition, entanglement, interference, and measurement, naturally map to essential reasoning primitives such as hypothesis branching, constraint propagation, consistency enforcement, and decision making. The resulting framework combines quantum-inspired computation with differentiable optimization, enabling reasoning to emerge as a process of amplitude evolution and interference-driven selection of self-consistent states. We develop the mathematical foundation of QCRM, define its parameterized circuit architecture, and show how logical rules can be encoded as unitary transformations over proposition-qubit states. We further formalize a training objective grounded in classical gradient descent over circuit parameters and discuss simulation-based implementations on classical hardware. Finally, we propose the Quantum Reasoning Layer (QRL) as a differentiable hybrid component for composable reasoning models applicable to scientific, biomedical, and chemical inference domains.
Paper 5 of 11 — A General Theory of Answerability The eleven-paper TUS OS mathematical research programme Abstract This paper identifies and formalises a system-level phenomenon in exact quantum representation: an independently constituted deterministic native system can admit multiple exact quantum-operational views whose minimum representation resources can depend sharply on a precommitted access contract, while the native system itself remains unchanged. The quantum representation is therefore neither constitutive of the native system nor a post hoc encoding selected to reproduce a prescribed quantum target. It is an exact operational representation of behaviour exposed by a declared contract on an independently fixed structural target. We introduce two mathematical definitions. An Analog Quantum View (AQV) is the distinguished operational-equivalence class containing every exact permitted finite-dimensional quantum realisation of the behaviour exposed by a nonvacuous, precommitted access contract, under complete persistent-resource accounting. An Anchored Analog Quantum System (AAQS) is an independently constituted, provenance-bearing native system admitting a nonempty contract-indexed family of such views while preserving native identity, native quotient independence and protected provenance outside the quantum representation. The definition excludes circular construction, candidate-dependent post-selection, hidden side information and untyped resource comparisons; the additional properness criterion excludes recognition based solely on the universal orthogonal-sector embedding. TUS OS is proved to be a proper Anchored Analog Quantum System on its 64-input abstract canonical corpus. Its independently defined native structural quotient is canonically isomorphic, as a complete deterministic transition-output system, to deterministic predictive equivalence and to the canonical six-bit carrier, with exact deterministic predictive minimum 64. On this same carrier-faithful structural target, within a fixed no-persistent-side-memory quantum representation category, the minimum Hilbert dimension depends sharply on the permitted operational access. The complete static Atlas has exact minimum d_Atlas^min = 4, whereas recovery-complete LANDING selected-line instrument access and recovery-complete GUIDANCE selected-line readout each have exact minimum d_L,instr^min = d_G,read^min = 64. These yield two exact factor-16 fixed-target, fixed-category resource separations. Recovery-complete state-only common-CPTP access remains bounded by 32 ≤ d_CPTP^min ≤ 64. A separate exact classical–quantum construction retains the certified four-dimensional quantum component together with a 32-state complement-orbit memory. Under the declared componentwise resource order, this hybrid and the 64-sector no-persistent-memory construction are Pareto-incomparable rather than competing estimates of a single resource minimum. The resulting TUS OS Anchored Analog Quantum System Theorem composes native recognition, predictive identity, contract-indexed quantum representation and conservative downstream interpretation without collapsing their domains. Predictive Synthesis and Analog Quantum Views are sibling constructions from independently fixed native identity: neither constructs the other, and neither reconstructs the Native Witness. Provenance and receipt custody remain outside the quantum target, while lawful Domain Binding and downstream human, rules-engine or AI interpretation, operating under independently fixed interfaces and gates, preserve protected native identity and source authority and cannot strengthen the governing evidential ceiling. No claim is made of physical quantum execution, quantum ontology, encoding of question text as a quantum state, quantum advantage, unrestricted domain coverage or model-independent correctness. Realised-instance inheritance remains conditional and target-specific rather than an unrestricted theorem over all TUS OS executions. The paper reports a retrospective prior-art audit through 11 August 2026 that identified no earlier or contemporary public disclosure whose documented properties were found to satisfy the complete AAQS conjunction. Subject to that audited public-record scope, TUS OS is the first formally demonstrated Anchored Analog Quantum System identified in the record examined. This is a system-class priority claim rather than a claim that the constituent ideas—quantum representations of classical processes, predictive equivalence, provenance, resource orderings or noninterference—are themselves novel. Supporting General Theory Programme This paper is Paper 5 in the TUS OS quantum-operational and Answerability research programme. Building on Papers 1–4, it organises the established geometry, operational structure, complete-future theory, process closure, and native Triadic synthesis through the theory of Anchored Analog Quantum Systems, establishing TUS OS as a proper instance of that framework. Papers 6–7 extend the programme through contract-relative quantum realisation, resource separation, operational observability, and contract-induced resource transitions; Papers 8–9 develop generic Answerability theory and calculus; Paper 10 proves the protected and executable realisation of TUS OS; and Paper 11 closes the programme with A General Theory of Answerability, establishing Structural Identity, Recognition, the canonical mandatory protected core, and lawful Realisation Freedom. Paper 1 — Canonical Tetrahedral Qubit-State Geometry in the TUS OS TriadXOR Completion, Receipt Verification and the Qubit-Geometric Semantic WitnessEstablishes the canonical tetrahedral geometry, unique XOR completion, exact qubit-SIC representation and centred-face trine geometry. Paper 2 — The TUS OS Operational CalculusClassical Construction of Exact Qubit Prepare–Measure Behaviour from a Receipt-Custodied Engine ArchitectureEstablishes exact full-carrier qubit prepare–measure behaviour from the deterministic classical engine under the declared Coordinate-Incidence Operational Harness. For each lawful foundation, the 64 six-bit carriers map to exactly 27 anchor-relative qubit preparations under one foundation-defined tetrahedral-SIC Harness, while the separately declared face Harness gives the exact trine table. Paper 3 — From Finite Relational Structure to Qubit Operational FormAmbient Foundations, Canonical Subatlas, Exact Global Quantum Dimension, GUIDANCE Witness, Sequential Closure and Global Representation in TUS OSExtends the local prepare–measure construction to the complete family of completed foundations and the canonical TUS OS subatlas. Every completed foundation has the same 27-class qubit operational quotient; pair relations between charts provide exact carrier-reconstruction structure; the repeated-common-effect static Atlas has exact minimum complex Hilbert dimension 4; and the frozen complete principal future language has deterministic predictive-state minimum 64. Paper 4 — Technical Volume I — Formal Foundations and the Complete-Future CorpusNative Contract, Statistical Discrimination and the Invariant Probability ModuleFixes the formal native domain, complete principal terminal future-experiment language and one-common-word experiment class; establishes complete statistical separation of distinct carrier pairs and the exact parity-resolved pairwise total-variation optimum; determines complement reachability; and proves that the rational invariant probability module generated by the complete terminal probability language has dimension 33. Paper 4 — Technical Volume II — Orthogonality, Process Closure and Native Triadic SynthesisEstablishes universal complement-support orthogonality and its propagation under exact common-CPTP dynamics, giving the certified same-parity support graph and the bound 32 ≤ d_CPTP^min ≤ 64, while leaving cross-parity forcing and the exact state-only common-CPTP minimum unresolved. It further establishes recovery-complete LANDING and GUIDANCE process/readout results, exact 64-dimensional selected-line instrument/readout minima at their declared contracts, an exact four-dimensional-quantum-plus-32-state-classical hybrid construction, joint LANDING–GUIDANCE compatibility, and the native structural/predictive quotient correspondence. Paper 5 — TUS OS as an Anchored Analog Quantum SystemNative Witnesses, Predictive Synthesis, and Access-Contract Resource SeparationDefines Analog Quantum Views and Anchored Analog Quantum Systems and proves that TUS OS is a proper Anchored Analog Quantum System on its 64-input abstract canonical corpus. It elevates the inherited structural/predictive correspondence into the Predictive Synthesis Identity Theorem, organises the inherited exact quantum-operational representations through typed access contracts and resource accounting, and composes native recognition, predictive identity, contract-indexed quantum representation and conditional downstream claim-custody preservation into the TUS OS Anchored Analog Quantum System Theorem. The 64 inputs are an abstract canonical corpus, not 64 asserted receipt executions. Paper 6 — Contract-Relative Quantum Realisations of Classical ProcessesPredictive Compression, Vanishing Worst-Case Causal-State Transparency, and Finite-Dimensional BreakdownGeneralises the access-dependent resource phenomenon beyond the TUS-specific discovery corpus by formalising the contract-relative achievable-resource object (S,C,𝔐,ε) ⟼ Ach(S,C;𝔐,ε), and establishes three exact contract-relative regimes: strict finite separation, unbounded finite separation and finite-capacity breakdown. These are instantiated respectively by the TUS OS 4→64 separation, the periodically modulated decay 2→N exact prediction-to-transparency separation, and dual-Poisson finite-capacity breakdown for every positive uniform worst-case transparency threshold. Paper 7 — Operational O
This work establishes the Black-Hole Information Sector Connection of Return Theory (RT) in finite-dimensional quantum hosts. It applies RT’s typed observational roles—observer, host stage, validation reference, representation reference, access, record, and reconstruction—to black-hole information problems while retaining the supplied quantum dynamics. The central result is a three-level conditional classifier that locates an apparent conflict at its first failed level: host-state feasibility, same-run record and access compatibility, or equivalence between reconstructed images. In the Hayden–Preskill host, an old black hole is maximally entangled with early radiation, a one-qubit diary is scrambled by a fixed Haar unitary, and recovery is evaluated through two access channels on the same dynamics: emitted radiation R alone and the combined system ER. Classical diary content is assessed by exact binary minimax error, while coherent recovery is assessed separately by Petz entanglement fidelity. Across 36 fixed unitaries with total coherent register sizes of 8, 10, and 12 qubits, ER reaches both declared recovery thresholds after two emitted qubits in every run, whereas R reaches them only after complete emission. In the selected 12-qubit realization at k = 2, adding access to E changes the minimax error from 0.472087 to 0.031872 and the Petz fidelity from 0.252652 to 0.948306, with the unitary dynamics held fixed. The AMPS audit is evaluated under two explicit factorization declarations. With independent tensor factors E, b, and b̃, simultaneous exact Bell targets for Eb and bb̃ define an empty marginal-feasibility set. The conflict is therefore classified at the host-state level. When b̃ is instead declared as a logical algebra encoded in E by a [[4,1,2]] quantum error-correcting code, one consistent joint state exists and the issue moves to access, records, and reconstruction. Within the encoded realization, the disjoint logical-Z representatives Z₁Z₃ and Z₂Z₄ generate exact, order-independent records against a stable external validation reference and satisfy the declared RT operational-objectivity conditions on the binary logical-codeword ensemble. These objective classical records reduce logical coherence, while persistent coherent extraction transfers full logical fidelity to the first output and leaves only Bell fidelity 1/4 for a later E-only output. The calculation therefore distinguishes redundant objective records of commuting classical content from reconstruction of the complete logical quantum state. The finite connection further includes five modules: a sequential evaporation host that instantiates the RT Time role and distinguishes monotone admitted-record histories from observer accesses that lose records; an exact independent-factor Bell-fidelity frontier with symmetric optimum 3/4; a graded early-radiation-entanglement sweep that moves the ER and R recovery thresholds in opposite directions; a three-qutrit code whose two-share recoverability coexists with record redundancy one; and typing witnesses showing how verdicts change when minimax admission, joint realization, records, occupied order, or certified validation are replaced by inequivalent proxies. The resulting sector connection shows how factorization, observer-supported access, reference stability, record admission, and reconstruction jointly determine the consistent observational reading of a supplied black-hole information model. It provides formal statements, executable finite-dimensional witnesses, independent numerical verification, machine-readable results, complete source code, and cryptographic checksums.