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.
Existence and uniqueness of Bloch coordinates
Statement
For every , the matrix of Bloch coordinate maps is Hermitian with trace one. Conversely, every Hermitian trace-one matrix has a unique vector such that For a qubit density operator this vector is exactly , the coordinate map of Bloch coordinate maps. In particular all three trace coordinates of every density operator are real.
Facts & Assumptions
Given: The ordered basis of , a vector , a Hermitian trace-one matrix , and the definitions in Bloch coordinate maps.
Qubit spaces and states: with ordered computational basis .
The computational basis is orthonormal: the computational basis is orthonormal.
Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space: Hermitian means self-adjoint, so .
In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix: in an orthonormal basis the matrix of the adjoint is the conjugate transpose.
Density operator and Non-negative and positive operators: a density operator has trace one and is non-negative; non-negative means self-adjoint with nonnegative quadratic form.
The Pauli matrices: have the displayed matrices in the ordered computational basis.
Bloch coordinate maps: and .
The trace as the sum of the diagonal entries: trace is the sum of the diagonal entries.
Proof
For arbitrary real , the matrices in [F6] give . Its diagonal entries are real, its lower-left entry is the conjugate of the upper-right, and its trace is , so it is Hermitian trace one.
Write the arbitrary Hermitian trace-one matrix with : [F2] makes the computational basis orthonormal, and [F3]–[F4] give the conjugate-transpose matrix criterion for , so its diagonal entries are real and its lower-left entry is the conjugate of the upper-right; trace one fixes the second diagonal entry. Put , , and , which are real. The matrices in [F6] and formula in [F8] give . This proves existence.
For the entries of step 1.2, direct multiplication using [F6] and summing diagonal entries by [F9] gives , , and . If for another real vector , [F7] applied to [F8] gives for each , so and uniqueness follows. When is a density operator, [F5] makes it Hermitian and trace one, and [F8] identifies these same real trace coordinates with the map .
Depends on
- Bloch coordinate maps
- Pauli matrix algebra and trace identities
- The Pauli matrices
- Qubit spaces and states
- The computational basis is orthonormal
- Density operator
- Non-negative and positive operators
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
- In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix
- 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
Used by
- Bloch coordinates of |0> and H|0> Example
- Purity is the boundary of the Bloch ball Theorem
- The Bloch ball is exactly the qubit density-state space Theorem
Cited to discharge well-definedness by Bloch coordinate maps.
Dependency tree · two levels
31 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 Preskill, Quantum Computation, Chapter 2: Foundations I: States and Ensembles (updated July 2015) (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (2026-08-27) (standard reference, not scraped)
- Aram Harrow, 6.443/8.371/18.436 Quantum Information Science II, Lecture 1: Quantum states and operations (2018) (standard reference, not scraped)