Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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.

Teleportation preserves a finite reference

Statement

Let R be any finite-dimensional complex inner-product space and let ∣Ψ⟩AR be any normalized vector on Q2⊗R, with no product-state assumption. Run teleportation on A using a shared ∣Φ+⟩BC, keeping the global wire order A,B,C,R and applying the canonical ordered tensor identifications. For every measured label (a,b), the corrected joint vector on C⊗R is exactly ∣Ψ⟩CR, with A relabelled as the output wire C.

Facts & Assumptions

Given: A finite-dimensional reference space R, a normalized vector ∣Ψ⟩AR, the Bell resource on B,C, and the teleportation measurement and correction.

[A1]

∣Ψ⟩AR is an arbitrary normalized vector; it need not factor as a vector on A times one on R.

[F1]

Ordered tensor registers, their inner product, and wire permutations defines the ordered product basis and the wire-permutation map for finite tensor registers.

[F2]

Tensor products of finitely many linear maps defines T⊗S on elementary tensors by (T⊗S)(x⊗y)=Tx⊗Sy and extends it linearly.

[F3]

Teleportation Bell-basis expansion gives the branch expansion 12∑a,b∣ab⟩⊗XbZa∣ψ⟩ for every qubit vector.

[F4]

Teleportation Pauli correction identity proves ZaXbXbZa=I for each pair of bits.

[F5]

Finite projective measurements defines finite projective measurement weights by pρ(a)=tr⁡(ρPa).

[F6]

Projective measurement outcome weights are probabilities states that the weights of a finite projective measurement are probabilities.

[F7]

Conditional state for a projective measurement states that when pa>0, the conditional state is PaρPa/pa.

[F8]

The basis-independent trace of an endomorphism of a finite-dimensional vector space defines trace as the sum of diagonal entries in a basis.

[F9]

The Pauli matrices gives the exact X,Z matrices, which preserve the qubit norm.

[F10]

The computational basis is orthonormal proves that the ordered computational basis of each qubit factor is orthonormal.

[F11]

Since R is finite-dimensional, it has a finite ordered orthonormal basis by Every finite-dimensional real or complex inner product space has an orthonormal basis. If R={0}, no normalized vector on Q2⊗R exists, so the theorem has no instance in that case.

[F12]

Density operator defines a density operator as a non-negative operator with trace one.

Proof

1.1A1F1F2F3F11algebra

For any instance of the theorem, choose an ordered orthonormal basis ER=(ej)j<d of R using [F11]. This supplies the reference-factor basis required by [F1]; together with the qubit computational bases, it gives product bases for the initial order A,R,B,C and the stated global order A,B,C,R. Write ∣Ψ⟩AR=∑j<d∣ψj⟩A⊗ej, where ∣ψj⟩=αj∣0⟩+βj∣1⟩. The canonical wire permutation in [F1] sends the initial vector to ∑j∣ψj⟩A⊗∣Φ+⟩BC⊗ej. By [F3], for each (not necessarily normalized) qubit vector ∣ψj⟩, the pre-measurement gates give 12∑a,b∣ab⟩AB⊗XbZa∣ψj⟩C. Tensoring these identities with ej using [F2] and summing yields ∣Ω⟩ABCR=12∑a,b∣ab⟩AB⊗(XbZa⊗IR)∣Ψ⟩CR.

2.1A1step 1.1F1F5F6F8F9F10F12algebra

Define Pab on A,B,C,R as the diagonal projection onto product-basis vectors whose first two bits are ab. These four projections form a PVM because they partition the product basis from step 1.1; that product basis is orthonormal by [F1] and [F10]. Write ∣Ω⟩=∑iciei in this basis and define ρij=cicj‾. This rank-one matrix is self-adjoint and has nonnegative quadratic form ⟨ρz,z⟩=∣∑jzjcj‾∣2. For each label, write ∣χab⟩=(XbZa⊗IR)∣Ψ⟩. The product inner product and the chosen basis of R give ∥χab∥2=∑j<d∥XbZa∣ψj⟩∥2=∑j<d∥ψj∥2=∥Ψ∥2=1, since [F9] shows that X and Z each preserve the qubit norm. The four AB labels in step 1.1 are orthogonal, so ∥Ω∥2=14∑a,b∥χab∥2=1. Thus [F8] gives tr⁡(ρ)=∑i∣ci∣2=1, and ρ is a density operator by [F12]. The weight tr⁡(ρPab) is the sum of the diagonal entries selected by Pab, equal to ∥Pab∣Ω⟩∥2=14; by [F6] these weights are probabilities.

3.1step 1.1step 2.1F7algebra

Applying Pab to step 1.1 gives 12∣ab⟩⊗∣χab⟩. Since ∥χab∥=1 by step 2.1, this projected vector has norm 1/2 and its normalized branch vector is exactly ∣ab⟩⊗∣χab⟩. Equivalently, [F7] gives conditional density ∣ab⟩⟨ab∣AB⊗∣χab⟩⟨χab∣CR after division by the outcome weight 1/4. Thus the conditional vector on C⊗R before Bob's correction is ∣χab⟩.

4.1step 3.1F1F2F4algebra∎

Bob's correction acts on the C factor as ZaXb. By [F2] and [F4], on every elementary tensor xC⊗rR its composition with XbZa⊗IR is xC⊗rR; elementary tensors span by [F1], so it fixes the whole joint vector ∣Ψ⟩CR. The corrected normalized branch vector is therefore ∣ab⟩AB⊗∣Ψ⟩CR, whose C⊗R factor is exactly the original input vector for every label.

Depends on

Used by

Dependency tree · two levels

45 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