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

Teleportation outcomes are equiprobable

Statement

For every normalized input qubit vector ∣ψ⟩, the projective measurement of the first two wires after the pre-measurement gates in Qubit teleportation procedure has Pr⁡[(a,b)]=1/4 for each (a,b)∈{0,1}2.

Facts & Assumptions

Given: A normalized input vector ∣ψ⟩ and the ordered wires A,B,C of the teleportation procedure.

[A1]

⟨ψ,ψ⟩=1.

[F1]

Teleportation Bell-basis expansion gives the post-gate vector as 12∑a,b∣ab⟩AB⊗XbZa∣ψ⟩C.

[F2]

Finite projective measurements defines finite orthogonal projectors summing to the identity and assigns outcome weight pρ(a)=tr⁡(ρPa) to a density operator.

[F3]

Projective measurement outcome weights are probabilities states that these weights lie in [0,1] and sum to one.

[F4]

Ordered tensor registers, their inner product, and wire permutations fixes the lexicographic product-basis order for the three qubit wires.

[F5]

Finite registers and their ordered computational bases defines each qubit register as Q2=C2 with ordered basis ∣0⟩,∣1⟩.

[F6]

The Pauli matrices gives the exact matrices X=(0110) and Z=(100−1).

[F7]

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

[F8]

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

[F9]

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

Proof

1.1givenF2F4F5F8algebra

For each (a,b), let Pab be the diagonal projection onto the two basis vectors ∣ab0⟩,∣ab1⟩ of the ordered three-wire register. These four projections are self-adjoint idempotents, their ranges are pairwise orthogonal, and their sum is the identity because the eight orthonormal computational basis vectors from [F8] are partitioned by their first two bits. Hence they form a projective measurement as in [F2].

1.2givenA1F1F2F4F6F7F9algebra

Write the post-gate vector in [F1] as Ω=∑iciei in the orthonormal basis [F4]. For the matrix ρ with entries ρij=cicj‾, self-adjointness is immediate; for any coordinate vector z, ⟨ρz,z⟩=∣∑jzjcj‾∣2≥0. The matrix [F6] sends (α,β) to (β,α) under X and to (α,−β) under Z, so each preserves ∣α∣2+∣β∣2 and every XbZa preserves norm. The branch vectors in [F1] have orthogonal AB labels, hence tr⁡(ρ)=∑i∣ci∣2=∥Ω∥2=∥ψ∥2=1 by [A1] and [F7]. Thus ρ is a density operator by [F9], since the preceding calculation establishes nonnegativity and trace one.

2.1step 1.1step 1.2F1F2F7algebra

By [F2] and [F7], the probability weight of label (a,b) is tr⁡(ρPab)=∣cab0∣2+∣cab1∣2, the sum of the two diagonal entries selected by Pab. The branch vector in [F1] has these two coefficients equal to those of 12XbZa∣ψ⟩, so this sum is 14∥XbZaψ∥2.

3.1A1step 2.1F3F6algebra∎

The matrices in [F6] are unitary: direct multiplication gives X∗X=I and Z∗Z=I. Hence ∥XbZaψ∥2=∥ψ∥2=1, so every weight in step 2.1 is 1/4. By [F3] these are the outcome probabilities, and the four weights sum to one.

Depends on

Used by

Dependency tree · two levels

43 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