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 for each .
Facts & Assumptions
Given: A normalized input vector and the ordered wires of the teleportation procedure.
.
Teleportation Bell-basis expansion gives the post-gate vector as .
Finite projective measurements defines finite orthogonal projectors summing to the identity and assigns outcome weight to a density operator.
Projective measurement outcome weights are probabilities states that these weights lie in and sum to one.
Ordered tensor registers, their inner product, and wire permutations fixes the lexicographic product-basis order for the three qubit wires.
Finite registers and their ordered computational bases defines each qubit register as with ordered basis .
The Pauli matrices gives the exact matrices and .
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.
The computational basis is orthonormal proves that the ordered computational basis of each qubit factor is orthonormal.
Density operator defines a density operator as a non-negative operator with trace one.
Proof
For each , let be the diagonal projection onto the two basis vectors 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].
Write the post-gate vector in [F1] as in the orthonormal basis [F4]. For the matrix with entries , self-adjointness is immediate; for any coordinate vector , . The matrix [F6] sends to under and to under , so each preserves and every preserves norm. The branch vectors in [F1] have orthogonal labels, hence by [A1] and [F7]. Thus is a density operator by [F9], since the preceding calculation establishes nonnegativity and trace one.
By [F2] and [F7], the probability weight of label is , the sum of the two diagonal entries selected by . The branch vector in [F1] has these two coefficients equal to those of , so this sum is .
The matrices in [F6] are unitary: direct multiplication gives and . Hence , so every weight in step 2.1 is . By [F3] these are the outcome probabilities, and the four weights sum to one.
Depends on
- Teleportation Bell-basis expansion
- Qubit teleportation procedure
- Finite projective measurements
- Density operator
- Projective measurement outcome weights are probabilities
- Ordered tensor registers, their inner product, and wire permutations
- Finite registers and their ordered computational bases
- The computational basis is orthonormal
- The Pauli matrices
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
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
- John Watrous, The Theory of Quantum Information (2018), §6.3.1 (standard reference, not scraped)
- Richard Cleve, Quantum Information Processing course notes for QIC 710 / CS 768 / PHYS 767 / CO 681 / AMATH 871 / PMATH 871, version dated October 13, 2026 (standard reference, not scraped)