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.
Bell States, Teleportation, and Dense Coding
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Channels, Kraus, Choi, and Stinespring Representations
- Circuit Syntax, Denotational Semantics, and Measurement
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Controlled Gates, Phase, and Entanglement
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-Dimensional Complex Inner-Product Spaces and Matrix Interfaces
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fundamental Trigonometric Identities
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurements, POVMs, and Instruments
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Pure and Mixed States, Ensembles, and Schmidt Decomposition
- Qubits, Bloch Sphere, Pauli Algebra, and One-Qubit Gates
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Strongly Continuous Semigroups and Hille Yosida
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
The Bell vectors
Definition
Let be the ordered qubit register with computational basis , and use the ordered two-factor register from Ordered tensor registers, their inner product, and wire permutations. Define the four Bell vectors by
The ordered label convention is , , , and . 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.
Bell preparation transform and inverse
Statement
On the ordered two-qubit register, let , where operator products act right-to-left. For ,
In the label order , these are respectively . They form an orthonormal basis of , and maps those four vectors back to their labels.
Facts & Assumptions
Given: The ordered two-qubit computational basis, , and the operators in the Statement.
and are bits; is addition modulo .
The Bell vectors defines and fixes the label order as phase bit then flip bit.
Exact one-qubit gates and rotations gives and verifies and .
CNOT and Control-Target Order defines in control-first order.
Ordered tensor registers, their inner product, and wire permutations makes the ordered product basis lexicographic in the factor indices; for it consists of .
The computational basis is orthonormal proves that the ordered computational basis of each factor is orthonormal.
Tensor products of finitely many linear maps defines by and extends this rule linearly.
The adjoint is characterised by defines by .
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
The matrix in [F2] gives for each bit . By [F6], .
From [F3], applying CNOT twice fixes every basis vector because . Its matrix permutes the orthonormal basis [F4], so its inverse is its transpose and equals itself. The matrix of in [F4] is real symmetric and its square is the identity by [F2]. Thus both factors are self-adjoint involutions, and direct composition gives .
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 to . Therefore .
Substituting 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 . The inner product of with and of with is ; cross-pair inner products are zero because their computational supports are disjoint.
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.
In matrices, , so conjugating and transposing this finite sum gives . 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, . Applying CNOT sends the four Bell vectors to , , , and , respectively. By the matrix in [F2], sends the first factors in these expressions to , respectively, so the reverse sequence recovers .
Qubit teleportation procedure
Definition
The teleportation procedure has input a normalized qubit vector and a preshared resource , with Alice holding wires and Bob holding . The wire order is . It uses from The Bell vectors, CNOT with control and target from CNOT and Control-Target Order, the Hadamard from Exact one-qubit gates and rotations, the Pauli matrices from The Pauli matrices, and the finite projective measurement convention of Finite projective measurements.
- Alice applies and then , so the combined operator is , with the rightmost gate applied first.
- Alice measures in their ordered computational basis and records the pair , in that wire order.
- Alice sends the two classical bits to Bob.
- Bob applies and then , whose operator product is .
The output is the corrected state on Bob's wire . 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.
Teleportation Bell-basis expansion
Statement
For arbitrary , put and , in wire order . Then
No normalization assumption on is needed for this vector identity.
Facts & Assumptions
Given: , the ordered wires , and the operators in the Statement.
is an arbitrary vector; it need not be normalized.
Qubit teleportation procedure specifies initial input , shared resource , wire order , CNOT followed by , and measurement-record order .
The Bell vectors defines .
CNOT and Control-Target Order gives with the first wire as control.
The Pauli matrices gives , , , and .
Tensor products of finitely many linear maps extends the rule linearly to the three-wire register.
Proof
By [F2], the initial vector is in wire order .
Applying [F4] to the four basis vectors gives after CNOT: the first two terms have control bit and are fixed, while the last two have control bit and their target bits flip.
By [F3] and [F6], sends each first-wire to and each to . Regrouping the resulting eight terms by the first two wires gives .
The four receiver vectors in step 3.1 are respectively , , , and by the actions in [F5]. These are exactly for labels , so step 3.1 is the sum in the Statement.
Dense-coding procedure
Definition
The dense-coding procedure takes classical input bits and a preshared pair , with Alice holding and Bob holding . The local convention is that is the phase bit and the flip bit.
- Alice applies and then , so the encoding operator is .
- Alice sends the single qubit to Bob.
- Bob applies , then , and measures the ordered register in the computational basis.
- 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.
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, and . The pair preparation is not included among those gate occurrences. This record counts the stated procedure only; it asserts no optimality or physical realization.
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.
Teleportation Pauli correction identity
Statement
For every qubit vector and bits , the teleportation branch byproduct is , and the prescribed correction returns it exactly:
The operator order is part of the statement; no Pauli factors are commuted.
Facts & Assumptions
Given: and a qubit vector .
and are bits.
Teleportation Bell-basis expansion gives the branch byproduct .
The Pauli matrices defines and .
Proof
From the matrices in [F2], direct multiplication gives and . Therefore and for the two possible values of each bit.
Keeping the operator order fixed, by step 1.1. This also covers without using an anticommutation swap.
Applying the identity in step 2.1 to the byproduct vector from [F1] yields for every qubit vector.
Dense-coding correctness and resources
Statement
For each input pair in the procedure Dense-coding procedure, with the phase bit and the flip bit, Alice's encoding sends to the Bell vector . Bob's inverse therefore returns the computational-basis vector , 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 , the preshared , and the dense-coding procedure with the stated phase/flip label order.
is the phase bit, is the flip bit, and the input label is ordered .
Dense-coding procedure applies then , sends wire , then has Bob apply CNOT , , and measure ordered .
The Bell vectors defines in label order .
Bell preparation transform and inverse proves , , , and that decodes these labels.
The Pauli matrices gives the exact matrices and basis actions of and .
Finite projective measurements assigns outcome weights to computational-basis projectors.
Projective measurement outcome weights are probabilities states that these weights are probabilities.
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.
The computational basis is orthonormal proves that Bob's ordered computational-basis outcomes are orthonormal projectors.
Density operator defines a density operator as a non-negative operator with trace one.
Proof
Applying to and using [F4] gives the four cases: , , , and . In the last case, and , so the state is exactly in the chosen convention.
For , [F4] gives . Expanding the left side and then substituting gives . The same matrices give , hence . The scalar leaves the rank-one projector unchanged because ; it changes no projective outcome weight, while the direct four-case vectors in step 1.1 fix the exact label phase.
By [F3], the four encoded vectors in step 1.1 are , and sends each to . The output projectors are the orthogonal basis projections in [F8]. The rank-one matrix of has a single diagonal entry at label , 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 and zero at the other labels. By [F6] this is a deterministic output law.
The procedure [F1] begins with one shared pair, sends only wire 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.
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.
Teleportation correctness and resources
Statement
For every normalized qubit input, the procedure Qubit teleportation procedure has four outcomes, each of probability . Conditioned on outcome , the receiver's byproduct is 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.
The input qubit vector is normalized.
Qubit teleportation procedure uses the resource , applies CNOT then , measures ordered wires , sends , and applies then .
Teleportation outcomes are equiprobable proves for every label.
Teleportation Pauli correction identity proves that the byproduct is inverted by .
Teleportation preserves a finite reference proves the corrected output equals the input jointly with every finite reference.
Teleportation protocol resource record records the shared pair, two classical bits, zero transmitted qubits, gate occurrences, and measurement record as distinct resources.
Teleportation Bell-basis expansion gives each measured branch vector as .
Proof
By [F2], each of the four possible labels has probability , so every branch has positive probability and the conditional branch is defined. The Bell expansion [F6] identifies its receiver vector as .
Applying the correction from [F1] to the byproduct in step 1.1 gives by [F3]. Hence every branch has the exact corrected output.
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.
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.