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.
Register endianness and a two-qubit partial trace
Example
Take two qubit factors with ordered bases , and order the product basis lexicographically as . Let and . Its matrix in this basis is The big-endian index of is , and tracing out the second factor gives , whose trace is .
Facts & Assumptions
Given: The big-endian encoding, the ordered product basis, the Bell vector , its outer-product operator , and the coordinate definition of partial trace.
, with the first bit most significant (Big-endian encoding of ordered bit strings).
The encoding is a bijection to the slots (Big-endian bit-string indices are bijective).
The one-qubit computational basis is orthonormal and the two-factor product basis uses the stated factor order (The computational basis is orthonormal, The product basis is orthonormal and tensor dimensions multiply).
A ket is its vector and the outer product acts by (Dirac Notation Conversion).
In orthonormal coordinates, the matrix of is (Dirac Notation Coordinate Identity).
In the ordered product basis, (Partial trace over a finite tensor factor).
This coordinate contraction is the unique trace-characterized partial trace and is independent of the orthonormal basis of the second factor (The partial trace is characterized by the trace pairing and is basis-independent).
The trace is the sum of diagonal matrix entries (The basis-independent trace of an endomorphism of a finite-dimensional vector space, The trace as the sum of the diagonal entries).
Verification
By [F1], . By [F2], is one of the eight three-bit register slots.
In the ordered product basis, has coordinate column . Orthonormality [F3] gives .
By [F4]–[F5], the coordinate matrix of is . Its only nonzero entries are at , so it is the displayed matrix.
By [F6] and this matrix, and .
The other entries are and . Hence .
By [F7], this contraction is the intrinsic partial trace, and [F8] gives the output trace .
Depends on
- Finite registers and their ordered computational bases
- Big-endian encoding of ordered bit strings
- Big-endian bit-string indices are bijective
- The computational basis is orthonormal
- Ordered tensor registers, their inner product, and wire permutations
- The product basis is orthonormal and tensor dimensions multiply
- Partial trace over a finite tensor factor
- The partial trace is characterized by the trace pairing and is basis-independent
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- Dirac Notation Conversion
- Dirac Notation Coordinate Identity
Used by
Nothing in the library uses this result yet.
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
- John Watrous, The Theory of Quantum Information (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 2: Foundations I: States and Ensembles (standard reference, not scraped)