Finite Certification of Quantum Subsystem Cuts from Unpartitioned Control Data

Oliver Tuma

Published Aug 27, 2026• 0 citations

Abstract

Version 1.2 presents a finite sound certification procedure for operationally exposed quantum subsystem cuts without supplying subsystem labels to the factor-search stage. An exact finite control presentation with empirically confirmed interchange squares is reduced to unlabelled control-direction classes. The algorithm searches used direction subsets, forms noncommutation components, and tests the generated effect algebras for commuting matrix-factor witnesses. It distinguishes a unique finest full cut, partial factor structure with explicit residual multiplicity, and the absence of a uniquely certified cut, including ambiguity between inequivalent embedded full frames. Unused controls are localized only after certification by algebraic support. Version 1.2 closes the uniqueness proof for the global finest-frame claim, gives an exact finite tomographic characterization of terminal equality in the interchange-square condition, explicitly distinguishes the framework from Achenbach et al.'s multimeter-map factorization, fixes and reports the floating-point reference tolerance at 1e-8, and adds an independent exact 120-trial audit comparing the component reduction with exhaustive set-partition search. Five Pauli stress tests remain independently verified by tolerance-free binary-symplectic arithmetic. The operator-algebraic factorization itself is treated as standard; the priority claim remains restricted to the reverse unlabelled witness-search and certificate architecture.

DOI: 10.5281/zenodo.22133053

Related papers

Finite-Shot Certification of Hidden Quantum Factor Structure from Calibration-Free Sequence Statistics

Oliver Tuma

This preprint studies finite-shot reconstruction of hidden quantum factor structure from global calibration-free sequence statistics without assuming an internal tensor-product cut in advance. A probability-only complex-projective 3-design self-test is used as an imported anchor for the active Hilbert/Jordan geometry. From this anchor, global control maps are reconstructed with explicit confidence bounds, including a weighted estimator for unequal shot counts and missing reference settings whenever the surviving frame remains full rank. The main certification result is a whole-commutant-energy lower bound. For reconstructed controls, the sum of the lowest commutator singular energies yields a basis-free lower bound on the aggregate projective Hilbert–Schmidt distance to every common hidden matrix factor of a specified multiplicity. Combined with exact Choi-to-projective-unitary conversion and finite-shot confidence balls, this produces a one-sided lower bound on distance to the complete common-factor model class. An explicit exact factor witness gives the complementary PROXIMAL-RECOVER certificate; otherwise the procedure returns ABSTAIN. The paper also proves that exact generated-algebra / tensor-product-structure type is not uniformly identifiable from finite samples without a structural separation margin. For the fixed two-qubit 60-state stabilizer benchmark, the paper provides an anchor-inclusive raw-count validation and an exact-rational / outward-rounded one-sided trust path from integer counts through anchor and control confidence radii to factor RECOVER/REJECT. The scope is deliberately operational: the result certifies active factor structure supported by the augmented data and does not claim identification of arbitrary inactive spectator degrees of freedom or a uniquely true microscopic decomposition.

Sep 5, 20260 citations

Relational Anchors for Quantum Subsystem Identification: Minimal Separation and Robust Rigidity

Oliver Tuma

Operational data can be complete inside a chosen subsystem frame while leaving the frame itself non-unique. A previous finite certification construction exhibits this phenomenon explicitly: an unpartitioned three-qubit Pauli presentation supports three inequivalent finest full tensor frames even though its generated observable algebra is all of M_8(\mathbb C). We ask what additional information can select one frame without treating that information as merely another unlabelled control direction. We introduce relational anchors: gauge-equivariant constraints on a finite refinement poset of direction-generated frames. A general finite-poset theorem characterizes exact anchor collapse and turns target certification into a hitting-set problem, while global frame identification becomes a test-cover problem. In the three-qubit presentation we enumerate the complete nontrivial full witness poset, prove that one two-direction locality anchor separates all three finest frames, and determine exactly twelve single anchors of this type that pass the full-poset test. For robustness, exact support is replaced by conditional-expectation signatures, yielding a sharp \gamma/2 separation criterion. We prove a zero-radius result for the exact witness poset under unrestricted raw perturbations and derive a sharp projective Pauli decoding radius. Six Hamiltonian-derivation squares reconstruct the projective Pauli geometry. A residual synchronization analysis separates ordinary graph cycles from gauge-invariant parity constraints, and four atomic Jordan–Lie anchors are necessary and sufficient, within the declared anchor class, to reduce the remaining scale and sign freedom to Clifford gauge. An explicit relative-defect rigidity modulus and a protocol-conditioned end-to-end error certificate are obtained. The result does not claim that probabilities alone determine a physical tensor-product structure. Rather, unpartitioned process data together with a finite relational anchor package robustly identify a subsystem frame up to the declared gauge.

Aug 28, 20260 citations

Relational Anchors for Quantum Subsystem Identification: Minimal Separation and Robust Rigidity Subtitle: Algebra rounding, synchronized separation, and finite-shot two-qubit certification

Oliver Tuma

We develop a finite-dimensional reconstruction framework for identifying tensor-product structure (TPS) from noisy relational localization data without assuming exact local algebras. A unital completely positive localizer is rounded to a nearby exact algebra using explicit idempotent spectral rounding plus finite-dimensional C*-algebra stability; a central-derivation-gap criterion certifies matrix-factor structure, and near-commuting complementary factors are rectified to an exact TPS. Relational uniqueness is formulated with a single synchronized residual gauge across all anchor coordinates, turning minimal robust experiment selection into a test-cover problem on candidate-alignment triples. For D=4 we give an explicit Pauli-specialized branch and finite-shot confidence theorems. Independent multi-context pilot data recover a rank-four Choi support and an exact candidate factor, while a three-setting validation test treats the discarded-subsystem state as a nuisance parameter and certifies proximity to the full family of UCP retractions onto that factor. The resulting split-sample theorem gives radius-valued RECOVER/ABSTAIN/REJECT guarantees for a declared localizer/anchor interface. The result does not infer a TPS from a Hilbert space, Hamiltonian and state alone, nor does it construct localizer channels from arbitrary structure-free laboratory records.

Sep 5, 20260 citations

Spectral Relational Anchors for Quantum Subsystem Identification: A\-posteriori Factor Certificates, Recover\-Abstain\-Reject Logic, and Dimension\-Stable Expander Designs

Oliver Tuma

Version 1.1 of a finite-dimensional mathematical preprint on robust quantum subsystem identification from relational operator estimates in a common physical matrix-algebra gauge. The paper gives spectral obstruction and localization certificates from a normalized commutator Laplacian, simple matrix-factor discrimination, generic matrix-unit witness construction, a witness-producing REJECT/ABSTAIN/RECOVER procedure using one uncertainty set throughout, explicit finite-error ambiguity radii, outward-rounded post-gap certification, a one-sided relative-expander robustness design principle, a Weyl-versus-expander asymptotic separation, and a first-order tangency theorem explaining quadratic normal distance to the matrix-factor orbit. Standard commutant, JBD, approximate-C*-algebra, TPS-geometry, and expander ingredients are not claimed as new individually.

Sep 4, 20260 citations

Finite Certificates for Exact Uniqueness of Preferred Decomposition on Deletion-Robust Graphs

Patrick Panella

A finite-dimensional Hilbert space admits many inequivalent tensor-product decompositions, so exact uniqueness of subsystem structure must be formulated on a specified class of Hamiltonians and graphs. In the graph-local setting, exact zero-set identifiability means that the static selector vanishes on a single physical quotient class, or equivalently that the Hamiltonian has a unique admissible-support realization modulo local basis changes and subsystem permutation. On the deletion-robust graph class, defined by the requirement that deleting any vertex leave no isolated vertex component, the analysis gives a finite-certificate description of that question. The reference complement-generation locus in exact graph-local coefficient space is nonempty exactly on this graph class, and an explicit family of one-site fields and mixed edge couplings realizes it. Two finite certificates are then introduced on the reference exact slice: a bounded-length omitted-site word-algebra rank test and a quadratic-rigidity determinant for the first forbidden-support quadratic form. On deletion-robust graphs the resulting reference-regular locus is nonempty, Zariski-open, and Euclidean dense. Assuming the exact zero set of a base Hamiltonian is finite, each competitor exact zero determines a local branch whose intersection with the reference exact slice is governed by an explicit Jacobian-rank criterion. Near a regular-transverse base point, exact zero-set identifiability is therefore controlled by finitely many explicit obstruction manifolds. The graph boundary, the reference certificates, and the structural failure modes are all explicit within this nondegenerate exact-uniqueness framework.

Apr 20, 20260 citations

Operational Subsystem Identification from Global Quantum Processes: Similarity Obstructions, Two-Loop Rigidity, and Finite-Data Guarantees

Oliver Tuma

This preprint develops an operational identifiability theory for bipartite quantum subsystem structure without presupposing an embedded tensor-product structure. It first proves a strict boundary between simultaneous-similarity information obtainable from self-consistent global process probabilities and the multiplication, adjoint, positivity, and order structure required for physical quantum subsystems. For finite-dimensional unitary return processes, the paper establishes a sharp zero/one/two-loop hierarchy. A tree leaves the full tensor-product-structure manifold unconstrained; one compatible return process leaves a continuous ambiguity of dimension (m-1)(n-1); and two Haar-generic compatible returns identify the common factor algebra up to exchange of equal-dimensional factors. From informationally complete probability tables, the construction M_s=G^{-1}P^{(s)} yields a calibration-free common-commutant obstruction. A finite-data singular-value certificate can rule out every nontrivial bipartition of the global dimension simultaneously. In the exact generic compatible case, the ranks of the primitive commutant idempotents also determine the previously unknown factor dimensions. After an independently justified physicality lift and explicit C^*-factor tests, the framework provides local reconstruction and finite-shot error guarantees. An exact two-qubit example demonstrates that two processes may each be factorizable in some tensor-product structure while admitting no common factorization.

Aug 27, 20260 citations