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

Finite-Count Certification of Joint Reference Transport: Ancilla-Orientation Safety and Isolated-Leg Obstructions

Qingchun Zhang

Published Nov 9, 2026• 0 citations
Publisher

Abstract

Finite local calibration does not by itself determine how a preparation and a detector are related through a joint physical transport. We study the ancilla-orientation family A_theta(rho) = (1-theta)rho + theta rho^Gamma for an arbitrary two-qubit state rho and binary effect E, followed by an unknown joint completely positive trace-preserving channel. Eight jointly transmitted product inputs, comprising the complete X tensor X and Z tensor Z bases, give a complementary-basis bound on the channel's Choi infidelity. A channel-distance estimate and the retained local calibration bound then yield the uniform selector enclosure b_E + sqrt(2 s_rho) + (1+theta)epsilon, including the generally nonpositive candidate. One physical compatibility set gives simultaneous inner and outer confidence intervals for the restricted safe class. A sufficient fixed allocation of 21,600,000 trials has coverage at least 0.99; an explicit integer rule has transpose-exclusion power at least 0.996 at a stated alternative and an accepted upper endpoint at most -0.000620. The construction consumes 43,200,000 prepared qubit instances. Conversely, an exact joint channel can fix every isolated-leg input with the other leg held in |0>, remain at maximal half diamond distance from identity, and change the safe interval while preserving the complete permitted record law. A one-basis phase-channel obstruction provides a second control. The result combines established process-verification methods with a finite-count safety certificate and precisely specified weaker-record obstructions. Compatible complex types, bounded controls, a common transport context, and declared drift remain explicit premises. The source-and-evidence companion preserves the paper-specific Lean sources and historical execution, exact numerical programs and receipts, the separate AI-assisted review return, and the release source/build/validation records. Formal support remains conditional on eleven analytic-law inputs and three acquisition contracts. No end-to-end formal verification, experimental validation, or external human peer review is claimed. Release rights are scoped by component: CC BY 4.0 for the article and author-owned documentation/data; a newly prepared MIT grant for original author-owned software and Lean sources; and the original licenses and notices for third-party or inherited material. The companion rights notice specifies the scope and exclusions.

DOI
10.5281/zenodo.24095421

Related papers

Finite-Count Calibration of Ancilla-Orientation Safe Maps A Bell-Apparatus Bound and a Reference-Link Obstruction

Qingchun Zhang

An exact operational selector specifies which candidate maps are nonnegative on declared preparation and effect resources. This paper studies finite-count calibration of that resource-dependent question for a qubit apparatus with an inert qubit reference, an arbitrary complex physical preparation, and an arbitrary physical binary detector, relative to a trusted common calibration frame. Two preparation-stabilizer settings and six separable detector probes control the statistic of the affine family (1 − θ)id + θT, 0 ≤ θ ≤ 1, uniformly over all compatible state–effect pairs. The explicit radius is 3h + √(2s), where h is a simultaneous detector calibration width and s is a one-sided bound on Bell infidelity. It yields simultaneous inner and outer confidence sets for a one-parameter slice of the declared safe-map class. A fixed allocation of 200,000 trials per calibration setting, totaling 1,600,000 calibration trials, gives false-implication probability at most 0.005 and transpose-exclusion power at least 0.996 at the specified physical alternative. The calibration confidence budgets are 0.001 for preparation and 0.004 for the detector. This exclusion calculation uses no target stream; the acquired calibration circuits can use identity wiring. Coverage and prospective power remain separate statements. The acquisition contract uses fixed-length iid Bernoulli streams with their stated physical means and permits coupling between whole streams. The numerical example sets external-reference systematic errors to zero, and its trial budget excludes establishing reference trust and accuracy. If the preparation and detector references are not linked, the paper constructs two physical identity-wired apparatus worlds with identical complete record laws under the specified independent acquisition construction but different safety conclusions on the fixed target cone pair. A secondary nearest-center theorem supplies unconditional error control for the joint event of a wrong and nonabstaining candidate label under an additional finite-context target-law contract. Its nonidentity candidates are not completely positive maps, and their ideal probabilities lie below the nominal detector’s ordinary positive-output floor. That target law is an explicit model assumption; the label theorem is not a conditional-correctness or posterior statement. The results are analytic and prospective. The number of settings and trial allocations are sufficient constructions, with no empirical success-rate, minimality, optimal sample-complexity, or general certified count-to-feasibility implementation claim. The scope is one declared qubit apparatus, target preparation ray and binary effect cone, and affine map slice. The common complex operator description, trusted reference relationship and physical calibration probability law are assumptions. Exact finite checks and an assessed supporting Lean subset accompany the manuscript. That subset covers 326 audited named declarations: 240 theorems and 86 definition/type interfaces. Analytic binomial coverage, concentration and acquisition bridges, independent-product-law construction and normalization, and the complete noisy-power chain remain outside the accepted Lean subset. That subset does not establish a certified numerical feasibility evaluator, a complete physical two-sector implementation, or an ordinary-channel realization. AI assistance and the dated review/correction provenance are disclosed in the manuscript and companion records. No experimental dataset, external human peer review, or end-to-end formal verification is claimed.

•Nov 8, 2026•0 citations

Finite-Count Power for Target-Centered Instrument Certification

Qingchun Zhang

RTCG-P5, version 1.0, establishes finite-count passing guarantees for a target-centered certificate of a prescribed quantum instrument on a specified family of imperfect preparations. Six rank-two states share one signed, support-preserving parameter epsilon in [-10^(-6),10^(-6)]. The diagnostic instrument is fixed; actual readouts and trusted references remain nominal. Both the new rule and the old scalar rule use the same acquired preparation allowances. An explicit doubled fixed allocation of 636776064000000000000 attempted trials yields the upward-reported sufficient upper 0.000098454319447, strictly below 10^(-4). For every fixed parameter in the family and every allowed coupling between settings, the new rule passes with probability at least 1 - 873 exp(-12), approximately 0.994636102615544. Trials are iid within each setting; independence across settings is not assumed. The original allocation's sufficient envelope is 0.000108332505187 and does not close. This does not establish failure of the actual rule or a necessary acquisition cost. A separate single-analyzer argument proves an actual-output obstruction for the unchanged scalar preparation-penalty rule. At either signed endpoint, its reported upper is at least 0.00672 except on an event of probability at most 2 exp(-12), for every fixed valid allocation retaining that conversion. The obstruction is specific to this rule. It is not an information-theoretic lower bound or a lower bound on the physical instrument error. The universal false-certification bound, 889 exp(-12), remains a separate inherited guarantee for complete complex CP competitors under the stated trusted-reference and shared-world contract. The family-specific power guarantee does not restrict that competitor class, and the two probability statements are not combined into one 99-percent event or a posterior correctness assertion. The manuscript and mathematical supplement provide the physical construction, concentration proofs, all signed response coefficients, whole-interval argument and exact arithmetic. The companion provides editable sources, byte-preserved numerical programs and data, supporting Lean sources, actual execution/type/axiom evidence and reader instructions. The retained Lean 4.19.0 execution supports the stated deterministic and conditional probability implications. Physical-source realization, concentration/Holder arguments, inherited unrestricted physical coverage, complete raw-count linkage and general Python refinement retain their explicit formal boundaries. Packaging the public release is not a new Lean execution. This is a new finite-count extension of RTCG-P4, Target-Centered Preparation Calibration for Outcome-Resolved Instrument Certification (10.5281/zenodo.23789860). No experimental acquisition, practical sample efficiency, fewer-shot result or optimal acquisition cost is claimed. Manuscript, supplement, documentation and author-owned mathematical data use CC BY 4.0; original numerical, checking, build and Lean code use MIT. Inherited and third-party notices remain authoritative for their material.

•Oct 31, 2026•0 citations

Coherence-Sensitive Preparation Calibration for Complete-Instrument Certification

Qingchun Zhang

RTCG-P6, version 1.0, gives a coherence-sensitive preparation-calibration interface for complete-instrument certification on the fixed four-dimensional protocol-124 carrier. The theorem separates displacement within the nominal rank-two support from coherence across its complement. For the six fixed preparations, the cross-support Frobenius allowance is obtained from eight anticommuting Pauli expectations already present in the existing preparation calibration. No new setting, trusted device, confidence functional, or allocation search is introduced. The bound is propagated through uncertain shared readouts, the positive Choi remainder, the full complex tangent estimate, signed target corrections, and all 144 feedback ratios. On the same support-preserving performance family used in RTCG-P5, the upward-reported sufficient upper is 0.000079530194143 at 318388032000000000000 attempts and 0.000069761151302 at twice that schedule. The pointwise family-power guarantee is at least 1-873 exp(-12)>0.99. Universal false-certification control remains the separate bound 889 exp(-12). The result is a sufficient certificate comparison, not an optimal, necessary, or practical sample-complexity theorem. It does not establish robustness over an arbitrary preparation-error ball, uncertain-reference robustness, or memory robustness. The public files are the main manuscript, mathematical supplement, and reproducibility companion. The companion contains editable LaTeX, the frozen exact scientific study, source bindings, the accepted scoped Lean source and execution evidence, a self-contained accepted-source replay, and the completed AI-assisted technical-review records. The formal evidence is supporting rather than end to end; the manuscript and supplement state the remaining written and source-correspondence obligations. Manuscript, supplement, documentation, and author-owned mathematical data are licensed under CC BY 4.0. Original numerical, checking, build, and Lean software is licensed under MIT. Inherited and third-party notices remain authoritative for their material.

•Nov 1, 2026•0 citations

Finite Quantum Records and Source-Inclusive Coherence Tests

Qingchun Zhang

A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.

•Oct 15, 2026•0 citations

Orientation-Twisted Quantum Composition: Associativity, Monoidal Trivialization, and a Reference-Sensitive Z2 Residual

Qingchun Zhang

A partial-transpose image of the positive-semidefinite cone supplies an established alternative ordered presentation on a fixed composite carrier. Transporting both the cone and the processes preserves an abstract equivalence, whereas fixing the process representation can discriminate the two orders. We study the iteration of one specified right-argument transpose rule on supplied finite qubit carriers. With three standard leaves, its two bracketings have different cones, so no linear identification fixing every product operator pointwise can make them agree. Subset-orientation labels give an explicit repair. Relative to a separately supplied tensor-closed standard process category, we construct the raw tensor of arrows, associator, symmetry, asymmetric unit maps, and quasi-inverse tensorator, and prove symmetric monoidal equivalence by faithful transport. Complementary subsets define the same isolated cone, but their identification is not a congruence for the raw tensor product. At fixed rank, a precisely defined two-lift groupoid is a split central Z₂ extension; its odd lift is not an ordinary completely positive endomorphism at fixed representatives. A five-qubit example then separates matched reference transport, a fixed calibrated anchor, and an effect-based quotient. The latter loses a linear subspace rather than only a two-point transpose orbit and is preserved only by histories satisfying the standard kernel-invariance condition. A named real local unitary connects the anchor pair, while a real controlled-NOT (CNOT) gate exposes the limitation of an enlarged single-anchor history class. The contribution is an assumption-controlled analysis of one finite composition rule and its interfaces, not a new general coherence, orientation, or resource theorem, and not a derivation of quantum theory from primitive complementarity. Selected supporting statements and finite witnesses are accompanied by a partial Lean 4.19.0 formalization. A recorded local build and type/axiom audit accepted 117 theorem declarations and 57 definitions or abbreviations. The full symmetric monoidal category and equivalence in Theorems 4.5 and 4.6, and other explicitly listed manuscript links, remain incompletely formalized. The public source supplement also includes three preserved exact Python implementations, expected results, pinned dependencies and claim-to-code maps. Packaging and source/log audits are not another Lean compiler run or external peer review. The public evidence selection preserves the successful type/axiom output and the failure/success chronology. Machine-local account paths are omitted from derived run summaries, and one failed-build diagnostic has an explicitly normalized home-directory prefix. Accepted Lean proof sources remain unchanged; private review archives and original machine-local receipts are not public upload files.

•Sep 26, 2026•0 citations

Calibrated Discrimination of Dynamics in Source-Tagged Quantum Records

Qingchun Zhang

We construct a source-matched reference calibration for distinguishing the coherent law h = 0 from the specified added generator h = J/25 in a finite quantum-record model. A complete-carrier transfer bound connects an accessible reference contrast to a delayed target contrast while retaining the original drift and actual law. On reference coverage and measured admission, restricting both hypotheses by the same observed reference band yields a directed target-set separation of at least 0.0071230619 whenever both compatible classes are nonempty. Rival worlds may have different admitted nuisance parameters. The constants are uniform over independently known finite lengths m >= 65, with tag 65, access prefix 1:32 and target deadline 25.02/J. Finite reference preparation and work/source reset satisfy the declared response budgets. Reset acts on the actual joint input and consumed supply, with the retained reference R exactly inert. It does not assign a universal reduced channel to correlated supplies. Under almost-sure conditional resource and supply bounds, the comparison extends to history-dependent acquisition. A prespecified rule, including abstention below the calibration threshold, has each-law unconditional wrong-declaration probability at most 2 exp(-6) + exp(-85/16) < 0.01. This is neither a posterior probability nor an error bound conditional on admission. The statistical step uses standard bounded-martingale concentration. Global target states and specified auxiliary supplies remain resources. Reset requires additional globally conditioned controls and has very large finite costs. The result is a conditional theorem for the two declared laws; it does not establish practical implementation or a unique diagnosis of fundamental collapse. A supporting Lean 4 companion contains 85 theorem declarations and 30 supporting definitions across Calibration, Operations and Risk. It provides checked scalar, sufficient-bound, resource-arithmetic and finite-history risk consequences under explicit premises. The companion has an executed Linux preflight and accepted returned macOS compilation, named-type and transitive-axiom evidence. The quantum constructions and conditional moment, filtration, tower and tail derivations remain written proofs or external premises; this is not an end-to-end formalization of the physical theorem chain. The original checked companion targeted author v0.4 and is carried forward unchanged, with its scope and execution chronology preserved.

•Oct 25, 2026•0 citations
Finite local calibration does not by itself determine how a preparation and a detector are related through a joint physical transport. We study the ancilla-orientation family A_theta(rho) = (1-theta)rho + theta rho^Gamma for an arbitrary two-qubit state rho and binary effect E, followed by an unknown joint completely positive trace-preserving channel. Eight jointly transmitted product inputs, comprising the complete X tensor X and Z tensor Z bases, give a complementary-basis bound on the channel's Choi infidelity. A channel-distance estimate and the retained local calibration bound then yield the uniform selector enclosure b_E + sqrt(2 s_rho) + (1+theta)epsilon, including the generally nonpositive candidate. One physical compatibility set gives simultaneous inner and outer confidence intervals for the restricted safe class. A sufficient fixed allocation of 21,600,000 trials has coverage at least 0.99; an explicit integer rule has transpose-exclusion power at least 0.996 at a stated alternative and an accepted upper endpoint at most -0.000620. The construction consumes 43,200,000 prepared qubit instances. Conversely, an exact joint channel can fix every isolated-leg input with the other leg held in |0>, remain at maximal half diamond distance from identity, and change the safe interval while preserving the complete permitted record law. A one-basis phase-channel obstruction provides a second control. The result combines established process-verification methods with a finite-count safety certificate and precisely specified weaker-record obstructions. Compatible complex types, bounded controls, a common transport context, and declared drift remain explicit premises. The source-and-evidence companion preserves the paper-specific Lean sources and historical execution, exact numerical programs and receipts, the separate AI-assisted review return, and the release source/build/validation records. Formal support remains conditional on eleven analytic-law inputs and three acquisition contracts. No end-to-end formal verification, experimental validation, or external human peer review is claimed. Release rights are scoped by component: CC BY 4.0 for the article and author-owned documentation/data; a newly prepared MIT grant for original author-owned software and Lean sources; and the original licenses and notices for third-party or inherited material. The companion rights notice specifies the scope and exclusions.
An exact operational selector specifies which candidate maps are nonnegative on declared preparation and effect resources. This paper studies finite-count calibration of that resource-dependent question for a qubit apparatus with an inert qubit reference, an arbitrary complex physical preparation, and an arbitrary physical binary detector, relative to a trusted common calibration frame. Two preparation-stabilizer settings and six separable detector probes control the statistic of the affine family (1 − θ)id + θT, 0 ≤ θ ≤ 1, uniformly over all compatible state–effect pairs. The explicit radius is 3h + √(2s), where h is a simultaneous detector calibration width and s is a one-sided bound on Bell infidelity. It yields simultaneous inner and outer confidence sets for a one-parameter slice of the declared safe-map class. A fixed allocation of 200,000 trials per calibration setting, totaling 1,600,000 calibration trials, gives false-implication probability at most 0.005 and transpose-exclusion power at least 0.996 at the specified physical alternative. The calibration confidence budgets are 0.001 for preparation and 0.004 for the detector. This exclusion calculation uses no target stream; the acquired calibration circuits can use identity wiring. Coverage and prospective power remain separate statements. The acquisition contract uses fixed-length iid Bernoulli streams with their stated physical means and permits coupling between whole streams. The numerical example sets external-reference systematic errors to zero, and its trial budget excludes establishing reference trust and accuracy. If the preparation and detector references are not linked, the paper constructs two physical identity-wired apparatus worlds with identical complete record laws under the specified independent acquisition construction but different safety conclusions on the fixed target cone pair. A secondary nearest-center theorem supplies unconditional error control for the joint event of a wrong and nonabstaining candidate label under an additional finite-context target-law contract. Its nonidentity candidates are not completely positive maps, and their ideal probabilities lie below the nominal detector’s ordinary positive-output floor. That target law is an explicit model assumption; the label theorem is not a conditional-correctness or posterior statement. The results are analytic and prospective. The number of settings and trial allocations are sufficient constructions, with no empirical success-rate, minimality, optimal sample-complexity, or general certified count-to-feasibility implementation claim. The scope is one declared qubit apparatus, target preparation ray and binary effect cone, and affine map slice. The common complex operator description, trusted reference relationship and physical calibration probability law are assumptions. Exact finite checks and an assessed supporting Lean subset accompany the manuscript. That subset covers 326 audited named declarations: 240 theorems and 86 definition/type interfaces. Analytic binomial coverage, concentration and acquisition bridges, independent-product-law construction and normalization, and the complete noisy-power chain remain outside the accepted Lean subset. That subset does not establish a certified numerical feasibility evaluator, a complete physical two-sector implementation, or an ordinary-channel realization. AI assistance and the dated review/correction provenance are disclosed in the manuscript and companion records. No experimental dataset, external human peer review, or end-to-end formal verification is claimed.
RTCG-P5, version 1.0, establishes finite-count passing guarantees for a target-centered certificate of a prescribed quantum instrument on a specified family of imperfect preparations. Six rank-two states share one signed, support-preserving parameter epsilon in [-10^(-6),10^(-6)]. The diagnostic instrument is fixed; actual readouts and trusted references remain nominal. Both the new rule and the old scalar rule use the same acquired preparation allowances. An explicit doubled fixed allocation of 636776064000000000000 attempted trials yields the upward-reported sufficient upper 0.000098454319447, strictly below 10^(-4). For every fixed parameter in the family and every allowed coupling between settings, the new rule passes with probability at least 1 - 873 exp(-12), approximately 0.994636102615544. Trials are iid within each setting; independence across settings is not assumed. The original allocation's sufficient envelope is 0.000108332505187 and does not close. This does not establish failure of the actual rule or a necessary acquisition cost. A separate single-analyzer argument proves an actual-output obstruction for the unchanged scalar preparation-penalty rule. At either signed endpoint, its reported upper is at least 0.00672 except on an event of probability at most 2 exp(-12), for every fixed valid allocation retaining that conversion. The obstruction is specific to this rule. It is not an information-theoretic lower bound or a lower bound on the physical instrument error. The universal false-certification bound, 889 exp(-12), remains a separate inherited guarantee for complete complex CP competitors under the stated trusted-reference and shared-world contract. The family-specific power guarantee does not restrict that competitor class, and the two probability statements are not combined into one 99-percent event or a posterior correctness assertion. The manuscript and mathematical supplement provide the physical construction, concentration proofs, all signed response coefficients, whole-interval argument and exact arithmetic. The companion provides editable sources, byte-preserved numerical programs and data, supporting Lean sources, actual execution/type/axiom evidence and reader instructions. The retained Lean 4.19.0 execution supports the stated deterministic and conditional probability implications. Physical-source realization, concentration/Holder arguments, inherited unrestricted physical coverage, complete raw-count linkage and general Python refinement retain their explicit formal boundaries. Packaging the public release is not a new Lean execution. This is a new finite-count extension of RTCG-P4, Target-Centered Preparation Calibration for Outcome-Resolved Instrument Certification (10.5281/zenodo.23789860). No experimental acquisition, practical sample efficiency, fewer-shot result or optimal acquisition cost is claimed. Manuscript, supplement, documentation and author-owned mathematical data use CC BY 4.0; original numerical, checking, build and Lean code use MIT. Inherited and third-party notices remain authoritative for their material.
RTCG-P6, version 1.0, gives a coherence-sensitive preparation-calibration interface for complete-instrument certification on the fixed four-dimensional protocol-124 carrier. The theorem separates displacement within the nominal rank-two support from coherence across its complement. For the six fixed preparations, the cross-support Frobenius allowance is obtained from eight anticommuting Pauli expectations already present in the existing preparation calibration. No new setting, trusted device, confidence functional, or allocation search is introduced. The bound is propagated through uncertain shared readouts, the positive Choi remainder, the full complex tangent estimate, signed target corrections, and all 144 feedback ratios. On the same support-preserving performance family used in RTCG-P5, the upward-reported sufficient upper is 0.000079530194143 at 318388032000000000000 attempts and 0.000069761151302 at twice that schedule. The pointwise family-power guarantee is at least 1-873 exp(-12)>0.99. Universal false-certification control remains the separate bound 889 exp(-12). The result is a sufficient certificate comparison, not an optimal, necessary, or practical sample-complexity theorem. It does not establish robustness over an arbitrary preparation-error ball, uncertain-reference robustness, or memory robustness. The public files are the main manuscript, mathematical supplement, and reproducibility companion. The companion contains editable LaTeX, the frozen exact scientific study, source bindings, the accepted scoped Lean source and execution evidence, a self-contained accepted-source replay, and the completed AI-assisted technical-review records. The formal evidence is supporting rather than end to end; the manuscript and supplement state the remaining written and source-correspondence obligations. Manuscript, supplement, documentation, and author-owned mathematical data are licensed under CC BY 4.0. Original numerical, checking, build, and Lean software is licensed under MIT. Inherited and third-party notices remain authoritative for their material.
A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.
A partial-transpose image of the positive-semidefinite cone supplies an established alternative ordered presentation on a fixed composite carrier. Transporting both the cone and the processes preserves an abstract equivalence, whereas fixing the process representation can discriminate the two orders. We study the iteration of one specified right-argument transpose rule on supplied finite qubit carriers. With three standard leaves, its two bracketings have different cones, so no linear identification fixing every product operator pointwise can make them agree. Subset-orientation labels give an explicit repair. Relative to a separately supplied tensor-closed standard process category, we construct the raw tensor of arrows, associator, symmetry, asymmetric unit maps, and quasi-inverse tensorator, and prove symmetric monoidal equivalence by faithful transport. Complementary subsets define the same isolated cone, but their identification is not a congruence for the raw tensor product. At fixed rank, a precisely defined two-lift groupoid is a split central Z₂ extension; its odd lift is not an ordinary completely positive endomorphism at fixed representatives. A five-qubit example then separates matched reference transport, a fixed calibrated anchor, and an effect-based quotient. The latter loses a linear subspace rather than only a two-point transpose orbit and is preserved only by histories satisfying the standard kernel-invariance condition. A named real local unitary connects the anchor pair, while a real controlled-NOT (CNOT) gate exposes the limitation of an enlarged single-anchor history class. The contribution is an assumption-controlled analysis of one finite composition rule and its interfaces, not a new general coherence, orientation, or resource theorem, and not a derivation of quantum theory from primitive complementarity. Selected supporting statements and finite witnesses are accompanied by a partial Lean 4.19.0 formalization. A recorded local build and type/axiom audit accepted 117 theorem declarations and 57 definitions or abbreviations. The full symmetric monoidal category and equivalence in Theorems 4.5 and 4.6, and other explicitly listed manuscript links, remain incompletely formalized. The public source supplement also includes three preserved exact Python implementations, expected results, pinned dependencies and claim-to-code maps. Packaging and source/log audits are not another Lean compiler run or external peer review. The public evidence selection preserves the successful type/axiom output and the failure/success chronology. Machine-local account paths are omitted from derived run summaries, and one failed-build diagnostic has an explicitly normalized home-directory prefix. Accepted Lean proof sources remain unchanged; private review archives and original machine-local receipts are not public upload files.
We construct a source-matched reference calibration for distinguishing the coherent law h = 0 from the specified added generator h = J/25 in a finite quantum-record model. A complete-carrier transfer bound connects an accessible reference contrast to a delayed target contrast while retaining the original drift and actual law. On reference coverage and measured admission, restricting both hypotheses by the same observed reference band yields a directed target-set separation of at least 0.0071230619 whenever both compatible classes are nonempty. Rival worlds may have different admitted nuisance parameters. The constants are uniform over independently known finite lengths m >= 65, with tag 65, access prefix 1:32 and target deadline 25.02/J. Finite reference preparation and work/source reset satisfy the declared response budgets. Reset acts on the actual joint input and consumed supply, with the retained reference R exactly inert. It does not assign a universal reduced channel to correlated supplies. Under almost-sure conditional resource and supply bounds, the comparison extends to history-dependent acquisition. A prespecified rule, including abstention below the calibration threshold, has each-law unconditional wrong-declaration probability at most 2 exp(-6) + exp(-85/16) < 0.01. This is neither a posterior probability nor an error bound conditional on admission. The statistical step uses standard bounded-martingale concentration. Global target states and specified auxiliary supplies remain resources. Reset requires additional globally conditioned controls and has very large finite costs. The result is a conditional theorem for the two declared laws; it does not establish practical implementation or a unique diagnosis of fundamental collapse. A supporting Lean 4 companion contains 85 theorem declarations and 30 supporting definitions across Calibration, Operations and Risk. It provides checked scalar, sufficient-bound, resource-arithmetic and finite-history risk consequences under explicit premises. The companion has an executed Linux preflight and accepted returned macOS compilation, named-type and transitive-axiom evidence. The quantum constructions and conditional moment, filtration, tower and tail derivations remain written proofs or external premises; this is not an end-to-end formalization of the physical theorem chain. The original checked companion targeted author v0.4 and is carried forward unchanged, with its scope and execution chronology preserved.