Alphabeta Math
Pipeline-generated
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.

✓ 7 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Bell States, Teleportation, and Dense Coding

1 · Prerequisites

2 · Summary

Objective

This page defines the four ordered Bell vectors, proves their preparation by Hadamard followed by control-first CNOT and their decoding by the reverse map, then gives complete teleportation and dense-coding procedures and proofs. The teleportation branch labels use first bit for phase and second for flip. Bell resources are mathematical inputs; resource counts make no optimality or physical-realization claim.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

The Bell vectors

Definition

Let Q2=C2 be the ordered qubit register with computational basis (∣0⟩,∣1⟩), and use the ordered two-factor register Q2⊗Q2 from Ordered tensor registers, their inner product, and wire permutations. Define the four Bell vectors by

∣Φ+⟩:=∣00⟩+∣11⟩2,∣Φ−⟩:=∣00⟩−∣11⟩2,∣Ψ+⟩:=∣01⟩+∣10⟩2,∣Ψ−⟩:=∣01⟩−∣10⟩2.

The ordered label convention is ∣00⟩↦∣Φ+⟩, ∣01⟩↦∣Ψ+⟩, ∣10⟩↦∣Φ−⟩, and ∣11⟩↦∣Ψ−⟩. Thus the first label is the phase/sign bit and the second is the bit-flip bit. The next theorem verifies that these vectors form an orthonormal basis and gives the corresponding preparation and decoding maps.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Bell preparation transform and inverse

Statement

On the ordered two-qubit register, let B:=CNOT⁡1→2(H⊗I), where operator products act right-to-left. For a,b∈{0,1},

B∣ab⟩=∣0,b⟩+(−1)a∣1,b⊕1⟩2=(I⊗Xb)(Za⊗I)∣Φ+⟩.

In the label order 00,01,10,11, these are respectively ∣Φ+⟩,∣Ψ+⟩,∣Φ−⟩,∣Ψ−⟩. They form an orthonormal basis of Q2⊗Q2, and B†=(H⊗I)CNOT⁡1→2 maps those four vectors back to their labels.

Facts & Assumptions

Given: The ordered two-qubit computational basis, a,b∈{0,1}, and the operators in the Statement.

[A1]

a and b are bits; ⊕ is addition modulo 2.

[F1]

The Bell vectors defines ∣Φ+⟩,∣Φ−⟩,∣Ψ+⟩,∣Ψ−⟩ and fixes the label order 00,01,10,11 as phase bit then flip bit.

[F2]

Exact one-qubit gates and rotations gives H=2−1/2(111−1) and verifies H∗=H and H2=I.

[F3]

CNOT and Control-Target Order defines CNOT⁡1→2∣a,t⟩=∣a,t⊕a⟩ in control-first order.

[F4]

Ordered tensor registers, their inner product, and wire permutations makes the ordered product basis lexicographic in the factor indices; for Q2⊗Q2 it consists of ∣00⟩,∣01⟩,∣10⟩,∣11⟩.

[F5]

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

[F6]

Tensor products of finitely many linear maps defines H⊗I by (H⊗I)(x⊗y)=Hx⊗y and extends this rule linearly.

[F7]
[F8]

In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix identifies the matrix of an adjoint in orthonormal bases with the conjugate transpose.

Proof

1.1givenA1F2F6algebra

The matrix in [F2] gives H∣a⟩=(∣0⟩+(−1)a∣1⟩)/2 for each bit a. By [F6], (H⊗I)∣ab⟩=(∣0,b⟩+(−1)a∣1,b⟩)/2.

1.2F2F3F4F5F6algebra

From [F3], applying CNOT twice fixes every basis vector because (t⊕a)⊕a=t. Its matrix permutes the orthonormal basis [F4], so its inverse is its transpose and equals itself. The matrix of H⊗I in [F4] is real symmetric and its square is the identity by [F2]. Thus both factors are self-adjoint involutions, and direct composition gives (H⊗I)CNOT⁡1→2B=I=B(H⊗I)CNOT⁡1→2.

2.1step 1.1F3algebra

Apply the control-first action in [F3] to the two terms of step 1.1. The control-zero term is fixed, while the control-one term changes its target from b to b⊕1. Therefore B∣ab⟩=(∣0,b⟩+(−1)a∣1,b⊕1⟩)/2.

3.1step 2.1F1F5algebra

Substituting 00,01,10,11 into step 2.1 gives Φ+,Ψ+,Φ−,Ψ− in that order, exactly as defined in [F1]. Each has norm one because it is a signed sum of two distinct orthonormal computational basis vectors from [F5], divided by 2. The inner product of Φ+ with Φ− and of Ψ+ with Ψ− is (1−1)/2=0; cross-pair inner products are zero because their computational supports are disjoint.

4.1step 3.1F4F5algebra

The four vectors in step 3.1 are an orthonormal set of four vectors in the four-dimensional space whose product basis is listed in [F4]; hence they are an orthonormal basis.

5.1step 3.1step 1.2F2F3F6F7F8algebra∎

In matrices, (AB)ij=∑kAikBkj, so conjugating and transposing this finite sum gives (AB)†=B†A†. By [F7]–[F8] this is the adjoint product rule in the register pairing. Since both factors in [F6] and [F3] are self-adjoint by step 1.2, B†=(H⊗I)CNOT⁡1→2. Applying CNOT sends the four Bell vectors to ∣0⟩+∣1⟩2⊗∣0⟩, ∣0⟩+∣1⟩2⊗∣1⟩, ∣0⟩−∣1⟩2⊗∣0⟩, and ∣0⟩−∣1⟩2⊗∣1⟩, respectively. By the matrix in [F2], H sends the first factors in these expressions to ∣0⟩,∣0⟩,∣1⟩,∣1⟩, respectively, so the reverse sequence recovers 00,01,10,11.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Qubit teleportation procedure

Definition

The teleportation procedure has input a normalized qubit vector ∣ψ⟩A∈Q2 and a preshared resource ∣Φ+⟩BC, with Alice holding wires A,B and Bob holding C. The wire order is A,B,C. It uses ∣Φ+⟩ from The Bell vectors, CNOT with A control and B target from CNOT and Control-Target Order, the Hadamard H from Exact one-qubit gates and rotations, the Pauli matrices from The Pauli matrices, and the finite projective measurement convention of Finite projective measurements.

  1. Alice applies CNOT⁡A→B and then HA, so the combined operator is VAB=(HA⊗IBC)CNOT⁡A→B, with the rightmost gate applied first.
  2. Alice measures A,B in their ordered computational basis and records the pair (a,b)∈{0,1}2, in that wire order.
  3. Alice sends the two classical bits a,b to Bob.
  4. Bob applies XCb and then ZCa, whose operator product is ZCaXCb.

The output is the corrected state on Bob's wire C. The shared Bell pair is an input resource; its preparation and physical realization are outside this procedure. A zero-probability measurement label has no conditional state and is assigned no branch output; the normalized-input hypotheses here are later shown to make all four labels positive.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Teleportation Bell-basis expansion

Statement

For arbitrary α,β∈C, put ∣ψ⟩=α∣0⟩+β∣1⟩ and VAB=(HA⊗IBC)CNOT⁡A→B, in wire order A,B,C. Then

VAB(∣ψ⟩A⊗∣Φ+⟩BC)=12∑a,b∈{0,1}∣ab⟩AB⊗XCbZCa∣ψ⟩C.

No normalization assumption on ∣ψ⟩ is needed for this vector identity.

Facts & Assumptions

Given: α,β∈C, the ordered wires A,B,C, and the operators in the Statement.

[A1]

∣ψ⟩=α∣0⟩+β∣1⟩ is an arbitrary vector; it need not be normalized.

[F1]

Qubit teleportation procedure specifies initial input ∣ψ⟩A, shared resource ∣Φ+⟩BC, wire order A,B,C, CNOT followed by HA, and measurement-record order (a,b).

[F2]

The Bell vectors defines ∣Φ+⟩=(∣00⟩+∣11⟩)/2.

[F3]

Exact one-qubit gates and rotations gives H=2−1/2(111−1).

[F4]

CNOT and Control-Target Order gives CNOT⁡1→2∣x,t⟩=∣x,t⊕x⟩ with the first wire as control.

[F5]

The Pauli matrices gives X∣0⟩=∣1⟩, X∣1⟩=∣0⟩, Z∣0⟩=∣0⟩, and Z∣1⟩=−∣1⟩.

[F6]

Tensor products of finitely many linear maps extends the rule H⊗I:x⊗y↦Hx⊗y linearly to the three-wire register.

Proof

1.1givenA1F1F2algebra

By [F2], the initial vector is 2−1/2(α∣000⟩+α∣011⟩+β∣100⟩+β∣111⟩) in wire order A,B,C.

2.1step 1.1F4algebra

Applying [F4] to the four basis vectors gives 2−1/2(α∣000⟩+α∣011⟩+β∣110⟩+β∣101⟩) after CNOT: the first two terms have control bit 0 and are fixed, while the last two have control bit 1 and their target bits flip.

3.1step 2.1F3F6algebra

By [F3] and [F6], HA sends each first-wire ∣0⟩ to (∣0⟩+∣1⟩)/2 and each ∣1⟩ to (∣0⟩−∣1⟩)/2. Regrouping the resulting eight terms by the first two wires gives 12(∣00⟩(α∣0⟩+β∣1⟩)+∣01⟩(α∣1⟩+β∣0⟩)+∣10⟩(α∣0⟩−β∣1⟩)+∣11⟩(α∣1⟩−β∣0⟩)).

4.1A1step 3.1F5algebra∎

The four receiver vectors in step 3.1 are respectively ∣ψ⟩, X∣ψ⟩, Z∣ψ⟩, and XZ∣ψ⟩ by the actions in [F5]. These are exactly XbZa∣ψ⟩ for labels 00,01,10,11, so step 3.1 is the sum in the Statement.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Dense-coding procedure

Definition

The dense-coding procedure takes classical input bits a,b∈{0,1} and a preshared pair ∣Φ+⟩AB, with Alice holding A and Bob holding B. The local convention is that a is the phase bit and b the flip bit.

  1. Alice applies XAb and then ZAa, so the encoding operator is ZAaXAb.
  2. Alice sends the single qubit A to Bob.
  3. Bob applies CNOT⁡A→B, then HA, and measures the ordered register A,B in the computational basis.
  4. Bob outputs the ordered pair of measured bits.

If a surrounding measurement model assigns an outcome zero weight, no conditional state is assigned for that outcome. For each of the four possible input pairs, the decoded output equals that pair with weight one and the other three outcomes have weight zero, as computed in the correctness theorem.

The Bell resource, Pauli matrices, Hadamard, CNOT wire order, and projective measurement use the conventions of The Bell vectors, The Pauli matrices, Exact one-qubit gates and rotations, CNOT and Control-Target Order, and Finite projective measurements. No optimality claim is part of this procedure.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Teleportation protocol resource record

Definition

For the procedure Qubit teleportation procedure, define a protocol-specific resource record with separate coordinates as follows. A shared-pair use is one initial Bell pair supplied as an input resource; its preparation is excluded. A classical communication bit is one bit sent from Alice to Bob; the record contains two. A transmitted qubit is a qubit sent during the protocol after the shared pair is available; the record contains zero. A measurement-record bit is one of the two ordered computational-basis outcomes measured by Alice; the record contains two such bits. A local gate occurrence is counted by the size convention of Finite circuit resource accounting, namely as one gate occurrence in the declared circuit: Alice uses one CNOT and one Hadamard, and Bob uses at most two conditional Pauli gate occurrences, Xb and Za. The pair preparation is not included among those gate occurrences. This record counts the stated procedure only; it asserts no optimality or physical realization.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Teleportation Pauli correction identity

Statement

For every qubit vector ∣ψ⟩ and bits a,b∈{0,1}, the teleportation branch byproduct is XbZa∣ψ⟩, and the prescribed correction returns it exactly:

ZaXbXbZa∣ψ⟩=∣ψ⟩.

The operator order is part of the statement; no Pauli factors are commuted.

Facts & Assumptions

Given: a,b∈{0,1} and a qubit vector ∣ψ⟩.

[A1]

a and b are bits.

[F1]

Teleportation Bell-basis expansion gives the branch byproduct XbZa∣ψ⟩.

[F2]

The Pauli matrices defines X=(0110) and Z=(100−1).

Proof

1.1givenA1F2algebra

From the matrices in [F2], direct multiplication gives X2=I and Z2=I. Therefore XbXb=I and ZaZa=I for the two possible values of each bit.

2.1step 1.1algebra

Keeping the operator order fixed, ZaXbXbZa=Za(XbXb)Za=ZaIZa=ZaZa=I by step 1.1. This also covers a=b=1 without using an anticommutation swap.

3.1step 2.1F1algebra∎

Applying the identity in step 2.1 to the byproduct vector from [F1] yields ZaXb(XbZa∣ψ⟩)=∣ψ⟩ for every qubit vector.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Dense-coding correctness and resources

Statement

For each input pair (a,b)∈{0,1}2 in the procedure Dense-coding procedure, with a the phase bit and b the flip bit, Alice's encoding ZAaXAb sends ∣Φ+⟩ to the Bell vector B∣ab⟩. Bob's inverse B† therefore returns the computational-basis vector ∣ab⟩, and the final projective measurement outputs the original two bits with probability one. This realizes two classical output bits using one preshared Bell pair and one transmitted qubit. It is an achievability result, not an optimality claim.

Facts & Assumptions

Given: Bits a,b∈{0,1}, the preshared ∣Φ+⟩, and the dense-coding procedure with the stated phase/flip label order.

[A1]

a is the phase bit, b is the flip bit, and the input label is ordered (a,b).

[F1]

Dense-coding procedure applies XAb then ZAa, sends wire A, then has Bob apply CNOT A→B, HA, and measure ordered A,B.

[F2]

The Bell vectors defines Φ+,Ψ+,Φ−,Ψ− in label order 00,01,10,11.

[F3]

Bell preparation transform and inverse proves B∣00⟩=Φ+, B∣01⟩=Ψ+, B∣10⟩=Φ−, B∣11⟩=Ψ− and that B† decodes these labels.

[F4]

The Pauli matrices gives the exact matrices and basis actions of X and Z.

[F5]

Finite projective measurements assigns outcome weights tr⁡(ρPab) to computational-basis projectors.

[F6]

Projective measurement outcome weights are probabilities states that these weights are probabilities.

[F7]

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

[F8]

The computational basis is orthonormal proves that Bob's ordered computational-basis outcomes are orthonormal projectors.

[F9]

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

Proof

1.1givenA1F2F4algebra

Applying ZAaXAb to ∣Φ+⟩=(∣00⟩+∣11⟩)/2 and using [F4] gives the four cases: 00↦Φ+, 01↦Ψ+, 10↦Φ−, and 11↦Ψ−. In the last case, ZAXA∣00⟩=−∣10⟩ and ZAXA∣11⟩=∣01⟩, so the state is exactly Ψ− in the chosen convention.

2.1step 1.1F2F4algebra

For x∈{0,1}, [F4] gives Za∣x⟩=(−1)ax∣x⟩. Expanding the left side and then substituting y=x⊕b gives (ZaXb⊗I)∣Φ+⟩=2−1/2∑x(−1)a(x⊕b)∣x⊕b,x⟩=2−1/2∑y(−1)ay∣y,y⊕b⟩=(I⊗XbZa)∣Φ+⟩. The same matrices give XZ=−ZX, hence XbZa=(−1)abZaXb. The scalar λ=(−1)ab leaves the rank-one projector unchanged because (λv)(λv)∗=∣λ∣2vv∗=vv∗; it changes no projective outcome weight, while the direct four-case vectors in step 1.1 fix the exact label phase.

2.2step 1.1F3F5F6F7F8algebra

By [F3], the four encoded vectors in step 1.1 are B∣ab⟩, and B† sends each to ∣ab⟩. The output projectors are the orthogonal basis projections in [F8]. The rank-one matrix of ∣ab⟩ has a single diagonal entry 1 at label (a,b), so its quadratic form is nonnegative and its trace is one by [F7]; it is a density operator by [F9]. Then [F5] and [F7] give weight one at (a,b) and zero at the other labels. By [F6] this is a deterministic output law.

3.1F1algebra∎

The procedure [F1] begins with one shared pair, sends only wire A once, and outputs the two input bits at Bob's measurement. Its instructions contain at most two conditional Pauli gate occurrences for Alice's encoding, one CNOT and one Hadamard for Bob, and two final measured wires. Thus it achieves the stated resource exchange for this procedure; no optimality statement is used.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Teleportation correctness and resources

Statement

For every normalized qubit input, the procedure Qubit teleportation procedure has four outcomes, each of probability 1/4. Conditioned on outcome (a,b), the receiver's byproduct is XbZa∣ψ⟩ and the prescribed correction returns ∣ψ⟩ exactly. The same corrected branch identity holds when the input is entangled with any finite reference. Under the separate resource record Teleportation protocol resource record, the procedure uses one preshared Bell-pair resource and two classical bits sent from Alice to Bob; it sends no qubit during the protocol and makes no optimality claim.

Facts & Assumptions

Given: A normalized input qubit, the shared Bell pair, and the procedure's ordered measurement and correction instructions.

[A1]

The input qubit vector is normalized.

[F1]

Qubit teleportation procedure uses the resource ∣Φ+⟩BC, applies CNOT then HA, measures ordered wires A,B, sends (a,b), and applies XCb then ZCa.

[F2]

Teleportation outcomes are equiprobable proves Pr⁡[(a,b)]=1/4 for every label.

[F3]

Teleportation Pauli correction identity proves that the byproduct XbZa is inverted by ZaXb.

[F4]

Teleportation preserves a finite reference proves the corrected output equals the input jointly with every finite reference.

[F5]

Teleportation protocol resource record records the shared pair, two classical bits, zero transmitted qubits, gate occurrences, and measurement record as distinct resources.

[F6]

Teleportation Bell-basis expansion gives each measured branch vector as 12∣ab⟩⊗XbZa∣ψ⟩.

Proof

1.1givenA1F1F2F6

By [F2], each of the four possible labels has probability 1/4, so every branch has positive probability and the conditional branch is defined. The Bell expansion [F6] identifies its receiver vector as XbZa∣ψ⟩.

2.1step 1.1F1F3

Applying the correction from [F1] to the byproduct in step 1.1 gives ZaXbXbZa∣ψ⟩=∣ψ⟩ by [F3]. Hence every branch has the exact corrected output.

3.1step 2.1F4

For a joint input with any finite reference, the same branchwise output statement is the conclusion of [F4]. This verifies the protocol preserves the full input-reference vector, not only its reduced input state.

4.1F1F5∎

The resource record [F5] separates one preshared Bell-pair use, the two classical bits sent from Alice to Bob, zero qubits sent after the pair is available, the two Alice gates, the two-bit Alice measurement record, and up to two conditional Bob Pauli gates. These are counts of the stated procedure only; no lower bound or physical preparation claim follows.

5 · Examples, counterexamples and false statements

None yet.

Sources