Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

40 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