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 be any finite-dimensional complex inner-product space and let be any normalized vector on , with no product-state assumption. Run teleportation on using a shared , keeping the global wire order and applying the canonical ordered tensor identifications. For every measured label , the corrected joint vector on is exactly , with relabelled as the output wire .
Facts & Assumptions
Given: A finite-dimensional reference space , a normalized vector , the Bell resource on , and the teleportation measurement and correction.
is an arbitrary normalized vector; it need not factor as a vector on times one on .
Ordered tensor registers, their inner product, and wire permutations defines the ordered product basis and the wire-permutation map for finite tensor registers.
Tensor products of finitely many linear maps defines on elementary tensors by and extends it linearly.
Teleportation Bell-basis expansion gives the branch expansion for every qubit vector.
Teleportation Pauli correction identity proves for each pair of bits.
Finite projective measurements defines finite projective measurement weights by .
Projective measurement outcome weights are probabilities states that the weights of a finite projective measurement are probabilities.
Conditional state for a projective measurement states that when , the conditional state is .
The basis-independent trace of an endomorphism of a finite-dimensional vector space defines trace as the sum of diagonal entries in a basis.
The Pauli matrices gives the exact matrices, which preserve the qubit norm.
The computational basis is orthonormal proves that the ordered computational basis of each qubit factor is orthonormal.
Since 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 , no normalized vector on exists, so the theorem has no instance in that case.
Density operator defines a density operator as a non-negative operator with trace one.
Proof
For any instance of the theorem, choose an ordered orthonormal basis of 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 and the stated global order . Write , where . The canonical wire permutation in [F1] sends the initial vector to . By [F3], for each (not necessarily normalized) qubit vector , the pre-measurement gates give . Tensoring these identities with using [F2] and summing yields
Define on as the diagonal projection onto product-basis vectors whose first two bits are . 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 in this basis and define . This rank-one matrix is self-adjoint and has nonnegative quadratic form . For each label, write . The product inner product and the chosen basis of give since [F9] shows that and each preserve the qubit norm. The four labels in step 1.1 are orthogonal, so . Thus [F8] gives , and is a density operator by [F12]. The weight is the sum of the diagonal entries selected by , equal to ; by [F6] these weights are probabilities.
Applying to step 1.1 gives . Since by step 2.1, this projected vector has norm and its normalized branch vector is exactly . Equivalently, [F7] gives conditional density after division by the outcome weight . Thus the conditional vector on before Bob's correction is .
Bob's correction acts on the factor as . By [F2] and [F4], on every elementary tensor its composition with is ; elementary tensors span by [F1], so it fixes the whole joint vector . The corrected normalized branch vector is therefore , whose factor is exactly the original input vector for every label.
Depends on
- Teleportation Bell-basis expansion
- Teleportation Pauli correction identity
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- The Pauli matrices
- Finite projective measurements
- Density operator
- Projective measurement outcome weights are probabilities
- Conditional state for a projective measurement
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- The computational basis is orthonormal
- Every finite-dimensional real or complex inner product space has an orthonormal basis
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
- 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)