Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite instruments can be coherently deferred

Statement

Let (Ia)a∈Ω be a finite instrument from a nonzero finite-dimensional complex inner-product space H to a finite-dimensional complex inner-product space K, with finite nonempty observed outcome set Ω. After observing a, suppose the circuit applies a specified finite unitary suffix Sa on K. For every finite-dimensional complex inner-product reference space R and every input operator X∈L(H⊗R), the measured circuit's unnormalized branch on K⊗R is Ja(R)(X):=(Sa⊗IR)(Ia(R)(X))(Sa†⊗IR), where, after choosing an ordered orthonormal basis of R, Ia(R) denotes the finite ancillary block amplification on L(H⊗R): if X=[Xkl], then Ia(R)(X)=[Ia(Xkl)]. This is the block extension in the complete-positivity definition. The coherent construction retains the observed label register until terminal readout. Its outcome-a branch, after tracing out the hidden Kraus and padding registers but retaining the label, is Ja(R)(X)⊗∣ea⟩⟨ea∣ on K⊗R and the label register (up to the canonical factor permutation); discarding the label gives the same data-reference branch map. Thus it preserves the complete outcome law and all correlations with R. This is an exact denotational statement: any newly used dilation or block operation must be listed and charged by a gate or oracle model; no same-alphabet synthesis or cost bound is asserted.

Facts & Assumptions

Given: The finite instrument, finite outcome set, branch-specific unitary suffixes, and arbitrary finite-dimensional reference space R.

[F1]

A finite instrument has an isometric coherent record: there are common-length finite branch Kraus families Ma,j with ∑a,jMa,j†Ma,j=IH and an isometry Vx=∑a,jMa,jx⊗ea⊗fj whose observed-label branch recovers Ia after the hidden record is traced.

[F2]

A finite isometry extends after finite ancilla padding: after finite ancilla padding, an isometry V:H→K⊗E is the restriction of a surjective isometry W on equal-dimensional input and output registers with a fixed zero ancilla.

[F3]

Finite measurement branches and classical control: an observed label selects its specified unitary suffix; its block operation is an explicit model capability or a separately constructed and charged operation.

[F4]

Completely positive maps: for each finite reference register R=Cr, the amplified map sends a block matrix [Xkl] to the block matrix [Ia(Xkl)].

[F5]

Finite Kraus representation: a finite family (Ma,j)j represents Ia when Ia(Y)=∑jMa,jYMa,j† for every Y∈L(H).

[F6]

Tensor products of finitely many linear maps and Tensor maps preserve composition, identities, and adjoints: tensor maps act on elementary tensors factorwise, preserve compositions, and satisfy (M⊗IR)†=M†⊗IR.

[F7]

Ordered tensor registers, their inner product, and wire permutations: factor permutations are defined on the ordered product basis and preserve the product inner product.

[F8]

Partial trace over a finite tensor factor: tracing a finite register factor sums its diagonal basis coordinates.

[F9]

The outcome law and outputs of a measured circuit: branch weights are instrument output traces; only positive-weight branches are normalized, and hidden Kraus indices are not outcomes.

[F10]

Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis and Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional R has dimension r≥0 and an ordered orthonormal basis of that length; dimension zero means R=0.

[F11]

Dirac Notation Conversion: ∣ea⟩⟨ea∣ is the rank-one map z↦⟨z,ea⟩ea for a unit label vector ea.

[F12]

A finite instrument with nonzero input has nonzero output space: a finite instrument from nonzero H has nonzero output space K, as required by the finite unitary-extension lemma.

[F13]

The computational basis is orthonormal: every specified computational basis vector of a positive-level register has norm one.

Proof

1.1givenF1F2F12construct

By [F12], K is nonzero. By [F1], choose finite branch Kraus families, pad them to a common positive length, and form the coherent record isometry V:H→K⊗E. By [F2], pad the input by a finite clean register and extend V to a surjective isometry W satisfying W(x⊗a0)=Vx⊗b0.

1.2givenF3F7construct

Reorder K⊗E so the observed label register is first, followed by K, the hidden register, and the padding register; this is the canonical basis permutation of [F7]. Apply the block operation from [F3] on the observed label and K, acting identically on the hidden register, padding register, and reference, then undo the permutation. On the label-a subspace this applies Sa and leaves the two environment registers unchanged.

2.1step 1.1F6algebra

Let Jx=x⊗a0 be the input-padding inclusion. Checking on each elementary vector x⊗r gives (W⊗IR)(J⊗IR)(x⊗r)=Vx⊗b0⊗r; these vectors span, and [F6] makes the tensor extensions well-defined. Hence the inclusion maps agree on all vectors, and conjugating any operator X by them gives the corresponding equality of extended output operators. This remains true for vectors and operators entangled across H and R.

2.2givenstep 1.1F4F5F6F10choose

Put r=dim⁡R. If r=0, [F10] gives R=0, hence X=0 and the amplification identity is immediate. Otherwise choose an ordered orthonormal basis (ck)k<r of R by [F10] and use it to identify the reference with Cr. Write X=[Xkl] in blocks. By [F4], block (k,l) of Ia(R)(X) is Ia(Xkl)=∑jMa,jXklMa,j† by [F5]. By [F6], the same is block (k,l) of ∑j(Ma,j⊗IR)X(Ma,j†⊗IR). Equality of all blocks proves this finite-Kraus formula for every X.

3.1step 1.1step 2.1step 2.2step 1.2F1F5F6F8F11F13algebra

For each a, the observed-label projection keeps only the terms with label a in the coherent isometry. Retain that label and take the partial trace [F8] only over the hidden Kraus register and the padding register; the trace keeps equal hidden indices j, and [F13] gives ⟨b0,b0⟩=1 for the returned padding. The label factor is ∣ea⟩⟨ea∣ by [F11]. Thus, after canonical factor permutation, the label-resolved branch operator is (∑j(SaMa,j⊗IR)X(SaMa,j⊗IR)†)⊗∣ea⟩⟨ea∣=(Sa⊗IR)Ia(R)(X)(Sa†⊗IR)⊗∣ea⟩⟨ea∣. This equals Ja(R)(X)⊗∣ea⟩⟨ea∣ by step 2.1 and step 2.2 and [F6]. Taking the partial trace of the label factor gives exactly Ja(R)(X) because ea is unit by [F13].

4.1givenstep 3.1F9algebra∎

Taking traces of equal branch operators gives the same outcome probabilities. Division gives the same conditional operator only when the shared branch weight is positive; when it is zero both descriptions assign ⊥ by [F9]. Equality for arbitrary X on H⊗R preserves all reference correlations. The finite-dimensional operator construction asserts no additional implementation or cost.

Depends on

Used by

Dependency tree · two levels

66 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources