A transpose-twisted presentation can preserve every single-system positive state while failing under inert extension by a reference system. This paper asks which finite preparation, effect, and reference resources select a common relative ancilla orientation without assuming the completely positive process category in advance. It proves an exact dual-cone selector criterion, gives a product/separable countermodel and a Bell/singlet selector for transpose, establishes a two-sided Schmidt-resource bottleneck, organizes the CP/DEC/POS apparatus hierarchy, and derives a reference-indexed simultaneous-PPT criterion. It also separates count-vector sufficiency from completeness for center-coarse apparatuses and gives an exact classification under an explicitly orientation-separating preparation-effect pair. Exact qutrit and center-count regressions and accepted scoped Lean evidence support named finite statements; no complete formalization, empirical realization, absolute chirality, or external peer review is claimed.
A transpose-twisted presentation can preserve every single-system positive state while failing under inert extension by a reference system. This paper asks which finite preparation, effect, and reference resources select a common relative ancilla orientation without assuming the completely positive process category in advance. It proves an exact dual-cone selector criterion, gives a product/separable countermodel and a Bell/singlet selector for transpose, establishes a two-sided Schmidt-resource bottleneck, organizes the CP/DEC/POS apparatus hierarchy, and derives a reference-indexed simultaneous-PPT criterion. It also separates count-vector sufficiency from completeness for center-coarse apparatuses and gives an exact classification under an explicitly orientation-separating preparation-effect pair. Exact qutrit and center-count regressions and accepted scoped Lean evidence support named finite statements; no complete formalization, empirical realization, absolute chirality, or external peer review is claimed.
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.
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.
Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is 1-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of 1-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any 1-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.
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.
Positive but not completely positive maps provide one of the most direct ways to detect entanglement beyond the positive-partial-transpose (PPT) criterion. We introduce and analyze an exactly solvable two-parameter family of sparse bistochastic positive maps on qutrits, in which two coherence channels are independently tuned by parameters w and z. The sparse structure makes the full phase diagram analytic: positivity holds exactly on the square 0≤w,z≤2/3, complete positivity on the smaller square 0≤w,z≤1/3, and decomposability is lost precisely outside a quarter circle in the corner w,z≥1/3. The indecomposable region is certified by explicit PPT entangled state adapted to the same witness geometry. At the endpoint W∗=W(2/3,2/3) we construct a four-parameter family of PPT edge states of rank type (5,5), derive their analytic detection region, and show that the corresponding rays are exposed faces of the PPT cone. Finally, although W∗ is not optimal, we give an explicit optimal refinement whose detection region on this family is strictly larger. The result is an analytically tractable qutrit setting in which positivity, indecomposability, PPT entanglement, optimality, and exposed convex geometry can be studied in a single framework.
A supplied rank-two Complementarity-First carrier has a positive duality h and a canonical complement #. The companion time paper used the local twist h(x,y^#) to obtain an index-one form. Here the same complement acts on one leg of the identity-pairing tensor, Γ_# = e ⊗ e - Σ_{i=1}^m e_i ⊗ e_i, with ω_# = (1/4)Γ_#. Relative to the supplied duality this construction is basis independent, product-positive, and normalized by the rank-two deterministic effect. It gives P(a,b | n,m) = (1/4)(1 - ab n·m). The m = 1 branch is separable; for m ≥ 2, physical admission with the sharp product interface gives CHSH magnitude 2√2. On the selected complex-qubit carrier, ω_# is the Bell singlet projector. The structural complement is positive but not completely positive. For a separately supplied exchange generator we derive G(X) = 2i[ω_#,X]. A partial-swap witness rejects one specific statically self-dual partial-transpose-image cone under the frozen process representation; the stronger carrier-relative PSD closure remains an inherited result. Entangled extensions of Euclidean-ball systems and canonical maximally entangled cone tensors are established prior art. The contribution claimed here is the typed local/tensor/process synthesis, not priority for singlet correlations, maximally entangled tensors, probability, or the physical composite.