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.
Measurement law of a coherent sampler
Statement
For a coherent sampler with output state as in Coherent finite sampler and observable value, projective measurement of the sample register returns with probability . If the value register is measured too, the pair has the same probability. The work register is not required to be measured, and work states for different labels need not be orthogonal.
Facts & Assumptions
Given: The coherent sampler, its finite product registers, and the projective computational-basis measurement of the sample register.
Coherent finite sampler and observable value: the output is the displayed finite sum with , , and unit work vectors.
Finite registers and their ordered computational bases and The computational basis is orthonormal: distinct sample labels are orthogonal computational-basis vectors.
Ordered tensor registers, their inner product, and wire permutations: the product register has the factorwise inner product and its ordered computational product basis.
Finite projective measurements: a projective measurement assigns weight to its projection .
A unit-vector outer product is a density operator: for a unit vector , is a density operator.
Dirac Notation Conversion and Dirac Notation Coordinate Identity: has matrix in an ordered orthonormal basis.
The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of diagonal entries in any basis.
For and , : for compatible finite-dimensional maps.
Proof
Since is unitary and is a unit vector, has norm one. Thus [F5] supplies the density operator required by [F4].
For each sample label , let . The distinct orthonormal sample labels in [F2] make these mutually orthogonal projections. If the labels do not exhaust the sample basis, include the residual projection ; it satisfies by [F1], so its measurement probability is zero. By [F3], the projection of is , so .
By cyclicity [F8], . The rank-one map here is ; [F6]–[F7] make its trace . Since is an orthogonal projection, self-adjointness gives . Thus by step 1.2. The measurement definition [F4] therefore assigns probability .
Measuring value as well refines the event by a computational-basis value outcome. The sample component is orthogonal to every other sample label, and its value register is the single basis vector ; summing over work outcomes leaves squared norm . Distinct work states are not used to separate sample labels.
Depends on
- Coherent finite sampler and observable value
- Finite registers and their ordered computational bases
- The computational basis is orthonormal
- Ordered tensor registers, their inner product, and wire permutations
- Pure state and ray
- Density operator
- A unit-vector outer product is a density operator
- Finite projective measurements
- Dirac Notation Conversion
- Dirac Notation Coordinate Identity
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
- Finite probability spaces, outcome weights, events, and event probabilities
Used by
Dependency tree · two levels
52 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
- Ashley Montanaro, Quantum speedup of Monte Carlo methods, Sections 2–3 (standard reference, not scraped)
- John Watrous, The Theory of Quantum Information, Sections 2.1–2.3 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 3: Foundations II: Measurement and Evolution (standard reference, not scraped)