Quantum instruments describe the full statistics of a measurement together with theconditional post-measurement state, and they form the building blocks of adaptive protocolsand quantum networks. We study the geometry of the set of all n-outcome instrumentsacting between two finite-dimensional quantum systems, and we ask how many continuousreal parameters must be retained in order to encode an arbitrary instrument and later re-construct it with uniformly small error, under the convention of continuous encoding andunrestricted decoding. The geometry of the instrument body is determined exactly: itsaffine dimension is d2A(nd2B − 1); the largest diamond-norm ball contained in the body hasradius 2/(ndB min{dA, dB }) and is centred at the uniform depolarising instrument, whichis optimal among all centres; and the same instrument is optimal for the covering problem,with an exact covering radius linked to the in-radius by a complementarity identity. Everyradius and width carries a single-shot operational meaning through the optimal discrimi-nation error. On the compression side, antipodal constructions — output preparation, aninput-dependent observable sphere, and a full-direction section — produce a certified lowerenvelope on the optimal error; constructive upper bounds from constant codes, convex pro-jection, and balanced pinching meet the envelope exactly at zero latent dimension (whereboth equal the exact constant-code width), in the collapse case, and from the affine dimen-sion on, and bracket it in the intermediate regime; the zero-error threshold equals the affinedimension. For the input-independent case the flat-width classification is complete: the flatvalue one holds exactly on the classical n ≤ 4 and qubit n ≤ 2 bodies and fails at least4/3 on every other, including every state space of dimension ≥ 3 at the bottom and secondlatent dimensions alike, the qutrit exactly 4/3 at both, the second-index result resting on theintegral cohomology of the cyclic flag quotient. The single-outcome case recovers quantumchannels, and the one-dimensional-output case recovers finite-outcome measurements; thetrade-off between the number of outcomes and the robustness of the uniform instrument ismade explicit.
Quantum instruments describe the full statistics of a measurement together with theconditional post-measurement state, and they form the building blocks of adaptive protocolsand quantum networks. We study the geometry of the set of all n-outcome instrumentsacting between two finite-dimensional quantum systems, and we ask how many continuousreal parameters must be retained in order to encode an arbitrary instrument and later re-construct it with uniformly small error, under the convention of continuous encoding andunrestricted decoding. The geometry of the instrument body is determined exactly: itsaffine dimension is d2A(nd2B − 1); the largest diamond-norm ball contained in the body hasradius 2/(ndB min{dA, dB }) and is centred at the uniform depolarising instrument, whichis optimal among all centres; and the same instrument is optimal for the covering problem,with an exact covering radius linked to the in-radius by a complementarity identity. Everyradius and width carries a single-shot operational meaning through the optimal discrimi-nation error. On the compression side, antipodal constructions — output preparation, aninput-dependent observable sphere, and a full-direction section — produce a certified lowerenvelope on the optimal error; constructive upper bounds from constant codes, convex pro-jection, and balanced pinching meet the envelope exactly at zero latent dimension (whereboth equal the exact constant-code width), in the collapse case, and from the affine dimen-sion on, and bracket it in the intermediate regime; the zero-error threshold equals the affinedimension. For the input-independent case the flat-width classification is complete: the flatvalue one holds exactly on the classical n ≤ 4 and qubit n ≤ 2 bodies and fails at least4/3 on every other, including every state space of dimension ≥ 3 at the bottom and secondlatent dimensions alike, the qutrit exactly 4/3 at both, the second-index result resting on theintegral cohomology of the cyclic flag quotient. The single-outcome case recovers quantumchannels, and the one-dimensional-output case recovers finite-outcome measurements; thetrade-off between the number of outcomes and the robustness of the uniform instrument ismade explicit.
Quantum channels with fixed finite-dimensional input and output form a compact convexbody. We ask how many continuous latent parameters are needed to encode an arbitrarychannel and reconstruct it with uniformly small diamond-norm error, when the encoder iscontinuous and the decoder is unrestricted. This is a continuous analogue of nonlinear width,distinct from tomography, which counts channel uses, and from programmable processors,which fix a decoding device. For a compact source the optimal error equals the minimalworst-case radius of the encoder’s fibers. Lower bounds follow from antipodal pairs in thesource and from latent collision topology via Borsuk–Ulam and the deleted-product coindex.Even input-independent output preparation forces error one below the output-state dimen-sion, with a Clifford analogue inside the unitary channels. We determine the largest diamondball contained in the channel body: it is centred at the completely depolarizing channel, isoptimal among all centres, and, together with a full-direction section, certifies the interme-diate lower envelope; the same channel is the optimal constant decoder, with exact coveringradius, so the two envelopes meet at the exact width at zero latent dimension. Constructiveupper bounds from convex projection and balanced pinching bracket the intermediate widths,and meet the lower envelope in the degenerate collapse case and from the affine dimensionon. Every finite-query adaptive network induces a continuous final code containing all sideinformation, so the same bottlenecks hold uniformly in the number of queries, for uniformlysuccessful postselection, and for sampled transcripts; a one-query informationally completemeasurement achieves the injective threshold, and repetition gives an O(N −1/2) expected-error bound. In the input-independent case the widths are governed by the companion’sflatness dichotomy: the flat value one fails for every output dimension at least three at thebottom two latent dimensions, the qutrit sitting exactly at 4/3 there, through a flag-quotientcohomology computation.
Physical Sources, Finite Detectors, Persistent Records, and Actual Events This paper develops a unified account of quantum measurement under the Admissibility and Standing Constraint (AASC) framework, connecting constructed physical sources, quantum instruments, material amplification, finite record retention, event probabilities, and the actuality of measurement outcomes. The paper distinguishes three separate objects: a complete quantum instrument containing all outcome operations, including unresolved and failed outcomes; a material record carried by a physical system whose acquisition and retention can be analyzed; an actual history describing which occurrences belong to one original experimental run. A complete instrument and a persistent material record can be constructed without assuming that linear quantum dynamics alone selects one globally definite original-run history. Conversely, the admission of an actual event does not by itself determine its probability law or conditional quantum state. The physical construction contains two complementary measurement targets: a regulated interacting gauge–Higgs–fermion source with its full source Hamiltonian retained during finite receiver pulses; an explicitly parameterized six-mode cosine circuit with source and pump interfaces, losses, distinguishable outputs, a two-polarization intrinsic-spin receiver, and a finite energy-resolving thermal amplifier. The material-registration chain includes source-code loading, driven conversion, output registration, pump-displacement removal, transfer to an intrinsic material spin, finite Gibbs-collision amplification, endpoint reading, and quiet record retention. Electronic display labels, material flags, missed counts, dark displays, blanks, and unreadable outcomes remain distinct and are retained in the joint error ledger. The paper establishes: informative bounded receivers on an interacting quantum source; finite-pulse calibration with the complete source Hamiltonian retained; a complete monitored detector model; finite preparation and amplification bounds; coherent composition of instruments and records; adaptive record composition; local-instrument compatibility; calibrated affine probability uniqueness; sharp coherent calibration limits; sequential probability laws and compatible conditional states; explicit actual-history requirements. A finite Fourier residual certificate bounds the complete monitored detector instrument over its full 35.587ms interval by 0.063241 in restricted diamond norm. Exact interval arithmetic gives seeded amplifier endpoint fidelity greater than 0.9999235242 after 1,024 finite collisions, together with an explicit conditional survival bound for a subsequent 100ms quiet hold. The probability analysis shows that positivity, density-operator dependence, affinity under classical mixtures, and calibration fix the trace probability rule for the declared readout. Approximate sector calibration alone permits coherent deviations of order the square root of the calibration error; stronger linear bounds require additional structure. The paper’s central measurement-theoretic conclusion is deliberately separated from its successful detector construction. A complete instrument admits an exclusive-history completion, but linear quantum dynamics alone does not select one such history. Source-specific preparation, reader analysis, and a bounded counting-law completion supply the additional physical input required to select an actual history. The resulting framework substantially develops the material and probabilistic parts of quantum measurement while isolating apparatus errors, actual-history law, and event-selection assumptions as explicit obligations. The work does not claim to solve every interpretation of the measurement problem, derive a universal collapse law, establish unrestricted detector accuracy, or identify a finite calibration certificate with an experimental calibration. Principal contributions A unified source-to-detector account of quantum measurement. Constructed interacting quantum sources with finite receivers. Six-mode cosine-circuit detector realization. Material registration and finite amplification chain. Two-polarization intrinsic-spin receiver. Finite thermal collision and endpoint-reading model. Full-duration restricted diamond-norm detector bound. Interval-certified amplifier fidelity. Conditional quiet-hold survival bound. Retention of blanks, wrong, unreadable, and missed outcomes. Calibrated affine probability uniqueness. Sequential instruments and compatible conditional states. Explicit separation of complete instruments, material records, and actual histories. Source-specific conditions for actual-event selection. Complete physical error and assumption ledger.
Measurement compatibility asks whether a family of quantum measurements can be simulated by one parent measurement followed by classical post-processing. We extend this measurement compatibility to the notion of \emph{d-compatibility} for measurements, channels, and instruments whose parent passes a d-dimensional quantum system and unlimited classical information to the post-processing. We formulate d-compatibility as a common linear factorization of operator spaces and operator systems and show that d-compatible families form a closed set, even with infinitely many settings and a separable infinite-dimensional input. To certify d-incompatibility, we define the compatibility functional as the smallest product of completely bounded norms over common factorizations through a d-dimensional register. Using factorization theory of operator spaces, we show that measure-and-prepare channels defined in terms of mutually unbiased bases and pinching channels defined in terms of Heisenberg-Weyl operators are d-incompatible in certain regimes of d. We also link d-compatibility of multi-instruments to the preparability of Choi assemblages using channel-state duality, and use this connection to show that for bipartite states the (in)compatibility of instruments can be used to certify Schmidt numbers and the implementability of the instrument using one-way LOCC protocols. Finally, our compatibility functional also bounds the generalized robustness of compatibility, which we interpret through a memory-bounded nontransient preparation game.
Calibrated support observations can constrain a complete quantum instrument without identifying its action by unrestricted tomography. We study what those observations guarantee when the noise law is not supplied. On a fixed four-dimensional incidence-record experiment, we define the set of all complete two-outcome completely positive instruments compatible with the exact raw rejection and outcome probabilities, retaining the classical flags. Exact ideal data identify the target, but an explicit family of complete instruments reproduces the nonzero-data category laws of a low-error contamination device while admitting coherent error of square-root order. A target-ray mass certificate and a common complete-dilation comparison give a universal upper, while an exactly feasible rational instrument supplies a stronger lower witness. At the diagnostic parameter r = 1/300000000, the unhalved target-relative worst-case radius lies between 0.000258065115532250 and 0.000951566242566. The result separates avoidable inequality conservatism from information absent from the measured data. Fixed-functional and fixed-map optimizations have separately certified scopes; they do not solve the global radius. The conclusions are conditional on the supplied carrier, calibration and common-device model. They do not establish an apparatus, device-independent certification, a finite-sample power guarantee or complete formal verification. Selected supporting declarations have one recorded successful Lean 4.19.0 macOS execution and declaration-specific source, type and axiom review; this is not an end-to-end formalization.
The observations available for a quantum instrument need not guarantee the accuracy of the device that generated them. On a fixed four-dimensional incidence-record benchmark, the paper compares two readout augmentations retaining six mixed preparations, both instrument outcomes, all attempts and shared completeness. Each adds three four-outcome bases and eighteen preparation/readout pairs. At r = 1/300000000, the 123 design admits a complete compatible instrument with unhalved prescribed-target diamond error at least 0.000103738856511, above the prospective 10^(-4) threshold. Replacing one basis gives the 124 design and a uniform upper 396319/8640000000 = 0.0000458702546296296... for every compatible complete instrument. The diagnostic generates data; its noise law and a Choi-rank bound are not imposed on the unknown device. The added basis effects observe ten Hermitian output directions, while original destination tests supply the leakage control. Five triples in the fixed finite menu are sufficient, one has a complete counterexample, and four remain unresolved. The paper claims neither a general measurement minimum, optimal radius, experimental certification, finite-sample power, calibrated hardware nor a general small-noise rate classification. Exact instrument identification remains obstructed on the unchanged preparations. Scientific cutoff: AUG04, 15 October 2026; AUG05 remains unexecuted. The companion contains editable manuscript sources, complete exact scientific arrays, the unchanged standalone reader, and accepted returned Mac Lean evidence for a supporting subset: 83 supporting theorems, 37 definitions and one abbreviation, with all 121 source/type/axiom correspondences. The complete-instrument theorems are not formalized end to end. Public execution views have documented path-only redactions; this preparation does not add a kernel run or external human peer review.
Paper 1 of 11 — A General Theory of Answerability The eleven-paper TUS OS mathematical research programme Abstract This paper establishes an exact tetrahedral qubit-state geometry within the deterministic six-bit construction underlying the TUS OS Triad. For every lawful six-bit anchor A, the full-state-space maximin construction selects companions B,C such that the resulting triple has exact pairwise Hamming separation (4,4,4). Every such triple has a unique equidistant completion in the same six-bit state space, given by D = A ⊕ B ⊕ C. Under the normalised sign embedding, the four completed states have unit norm, pairwise inner product −1/3, zero centroid and rank three. They therefore form the vertices of a regular tetrahedron. The paper constructs an exact isometric representation of this geometry as four qubit Bloch vectors forming a tetrahedral symmetric informationally complete structure, while affine centring and common renormalisation of the original three-state face yield exact qubit-trine geometry. The analytical construction is verified exhaustively over the complete finite state space. The census covers all 64 six-bit anchors, 249,984 ordered anchor-conditioned candidate pairs, 41,664 unordered triples, 960 mutual-distance-four triples, and 240 completed four-state sets. The same geometric recovery is demonstrated in two frozen public TUS receipt packages. The result separates the mathematical completion from the protocol object. Only the three states (A,B,C) are emitted as active Triad starts; the fourth state (D) is a uniquely determined mathematical completion and does not become an additional receipt-bearing protocol member. The tetrahedral and trine constructions therefore provide exact qubit-geometric representations of an already-fixed finite classical structure rather than additional states or operations in the native TUS OS protocol. The claim boundary is explicit. The paper does not claim that TUS OS physically prepares qubits, performs SIC or trine measurements, exhibits contextuality or other nonclassical behaviour, or obtains quantum computational advantage. Its result is an exact finite geometric correspondence and protocol linkage between the completed six-bit Triad structure and canonical qubit tetrahedral and centred-face trine geometry. Supporting General Theory Programme This paper is Paper 1 and the opening theorem paper in the TUS OS quantum-operational and Answerability research programme. It proves that the canonical six-bit TUS OS Triad has exact (4,4,4) Hamming geometry, a unique XOR completion, regular-tetrahedral geometry, an exact qubit-SIC representation, and centred-face trine geometry. Paper 2 develops the exact operational calculus and full-carrier qubit prepare–measure representation. Paper 3 extends the result to the complete relational Atlas and exact global static quantum dimension. Paper 4 develops the complete-future, orthogonality, process, LANDING/GUIDANCE, and native Triadic synthesis theory. Paper 5 introduces the Anchored Analog Quantum System framework, while Papers 6–7 generalise the contract-relative resource and operational-observability structure. Papers 8–9 then develop generic Answerability theory, Paper 10 proves the complete protected and executable realisation of TUS OS in the Answerability Calculus, 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 therefore provides the mathematical starting point for the complete programme. Paper 1 — Canonical Tetrahedral Qubit-State Geometry in the TUS OS Triad XOR Completion, Receipt Verification and the Qubit-Geometric Semantic WitnessEstablishes the canonical tetrahedral geometry, unique XOR completion and exact qubit-SIC representation. The canonical maximin construction yields a unique same-space completion whose normalised sign embedding forms a regular tetrahedron, while the centred and commonly renormalised emitted face has exact qubit-trine geometry. The emitted three-state face itself is not asserted to be a trine before that affine centring and normalisation. Paper 2 — The TUS OS Operational CalculusClassical Construction of Exact Qubit Prepare–Measure Behaviour from a Receipt-Custodied Engine ArchitectureExtends the Paper 1 geometry to 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, 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 construction to the completed-foundation family and canonical TUS OS subatlas, establishes exact carrier-reconstruction structure, proves that the repeated-common-effect static Atlas has exact minimum complex Hilbert dimension 4, and establishes deterministic predictive-state minimum 64 for the frozen complete principal future language. 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, exact parity-resolved discrimination results and complement reachability; and proves that the rational invariant probability module 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, yielding the certified same-parity support graph and the bound 32 ≤ d_CPTP^min ≤ 64, with cross-parity forcing and the exact state-only common-CPTP minimum remaining unresolved. It further establishes recovery-complete LANDING and GUIDANCE results, exact 64-dimensional selected-line instrument/readout minima at their declared contracts, an exact classical–quantum hybrid construction, 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, proves that TUS OS is a proper Anchored Analog Quantum System on its 64-input abstract canonical corpus, elevates the inherited structural/predictive correspondence into the Predictive Synthesis Identity Theorem, organises the inherited exact quantum-operational results through a typed access-contract resource law, and composes the recognition, predictive, resource and downstream-conservation results into the TUS OS Anchored Analog Quantum System Theorem. 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 Observability and Contract-Induced Resource Transitions in Quantum RealisabilityStructural Classification, Family Scaling, and Finite-Resource BreakdownDevelops a structural classification theory for contract-induced representation-resource transitions, introducing the Contract Distinction System (CDS), CRC cofinal/refinement equivalence, and Certified Observability Transport Theory (COTT). It separates internal divergence from family divergence, classifies baseline-feasible strengthenings as resource-neutral, strict finite, finite-resource breakdown, or UNRESOLVED, and proves exact and asymptotic witnesses including an interface-induced 2→3 separation, the TUS OS 4→64 transition, incrementally unbounded finite separation for periodically modulated decay processes, and finite-resource breakdown for positive-threshold dual-Poisson transparency. Paper 8 — The Resource Geometry of Answerable InferenceIrreducible Answerability Structure, Minimal Sufficient Cores, and Certified Inference-Resource BoundariesDevelops the resource geometry of answerable inference. It formalises lawful-discharge semantics, source-level inferential obligations, answerability-sufficient reductions and irreducible sufficient cores, while keeping semantic structure, certified lower bounds and operational feasibility independently constituted. Gate E establishes a local answerability-to-resource threshold result; globally, exact closure identifies the Pareto-minimal inference-resource boundary. On the generated exact branch, L = ↑F, and under well-partial-order conditions the resulting lower-resource geometry has a unique finite canonical antichain normal form. Paper 9 — The Answerability CalculusLawful Reduction, Contract–Resource Representation, Composition and ActivationDevelops a general mathematical calculus of Answerability as a constituted, typed relation. Its Base Theorem states that no terminal proposition counts as an answer unless it lawfully discharges the independently constituted contract. The paper develops lawful reduction, contract–resource geometry, extremal representation, repai