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.
Standalone Global Phase Leaves Pure-State POVM Probabilities Unchanged
Statement
Let be a nonzero finite-dimensional complex inner-product space with the root pairing linear in the first argument. For nonzero , put . If has , then and determine the same rank-one density operator. Consequently, for every finite POVM on , each defined outcome probability satisfies
The unnormalized vector itself gives and is not a density operator when .
Facts & Assumptions
Given: The finite-dimensional space and nonzero in the Statement, a scalar with , and a finite POVM .
Real and complex inner-product spaces and their induced length: the root pairing is linear in its first argument, conjugate-linear in its second, and positive definite.
The basis-independent trace of an endomorphism of a finite-dimensional vector space: endomorphism trace is the matrix trace in any chosen basis.
Density operator: a density operator is a non-negative endomorphism of trace one on a nonzero finite-dimensional space.
Finite POVMs and their outcome law defines a finite POVM and the outcome weight for a density operator. Its current draft definition body was read.
Dirac Notation Conversion defines . Its current draft definition body was read.
A unit-vector outer product is a density operator proves directly that the outer product of every unit vector is a density operator, including its trace-one verification by Parseval.
POVM outcome weights are probabilities states nonnegativity and normalization of finite POVM weights. Its current draft proof was read; its density-definition dependency is present in its current frontmatter.
Proof
Positive definiteness gives , so is defined. By [F1] and [F2], . Again using linearity in the first argument and conjugate-linearity in the second, . Taking nonnegative square roots gives both norms equal to one.
For every , the root-first conversion [L3] gives . Hence the two rank-one operators are equal.
By [L4], the common operator is a density operator, so the outcome law [L2] defines its weight for each effect . Since the density operator is identical for and , those weights agree; [L5] proves the finite family of weights is a probability distribution.
Since with a nonnegative real, [F1] and [L3] give . In any basis, its matrix is therefore times the matrix of ; summing the diagonal entries in that basis as in [F3] gives by [L4]. If , it is not trace one and hence is not a density operator by [L1].
Depends on
- Density operator
- Finite POVMs and their outcome law
- Dirac Notation Conversion
- A unit-vector outer product is a density operator
- POVM outcome weights are probabilities
- Real and complex inner-product spaces and their induced length
- The norm $\lVert v\rVert=\sqrt{\langle v,v\rangle}$ induced by a real or complex inner product
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
Used by
- Bounded-error evaluation from a dual adversary certificate Algorithm
- QFT-based amplitude estimation Algorithm
- Standalone and controlled phase accounting for a fixed-sector braid Lemma
- The braid phase is a common scalar character Lemma
- A constant phase query is invisible alone and relative under control Theorem
- Amplitude-estimation additive error and success probability Theorem
- Dual reflection evaluator has bounded-error correctness Theorem
Dependency tree · two levels
32 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
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 2: Foundations I: States and Ensembles (standard reference, not scraped)