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.
Pattern branch probabilities and zero-probability transcripts
Statement
For a finite adaptive pattern with transcript branch maps , a normalized pure input has and . For a density operator , the branch probability is and these probabilities also sum to one. A transcript with is impossible and has no normalized conditional output; normalization is defined only for positive-probability branches.
Facts & Assumptions
Given: A finite pattern with ordered binary projective measurements and a normalized pure or mixed input state.
The pattern Definition fixes the ordered input embedding, graph edge unitary, transcript-dependent measurement bases, branch maps, and output restriction (Finite open-graph adaptive measurement pattern).
At each transcript prefix, the chosen pair is an orthonormal basis, so its rank-one projectors sum to the identity (J gate and ordered equatorial measurement vectors, J-gate basis and exact phase identities, Finite projective measurements).
A density operator is nonnegative and has trace one (Density operator).
Trace is basis-independent and cyclic for conformable finite-dimensional maps (The basis-independent trace of an endomorphism of a finite-dimensional vector space, For and , ).
Every nonnegative operator on a finite-dimensional inner-product space has an orthonormal eigenbasis with nonnegative real eigenvalues (Non-negative and positive operators, A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).
A pure state represented by a unit vector has rank-one operator , whose coordinate matrix is (Pure state and ray, Dirac Notation Conversion, Dirac Notation Coordinate Identity).
For an instrument, the conditional output is normalized only when its branch weight is positive; at zero weight it is , not a state (Finite instruments and conditional states).
Each controlled-phase edge gate is unitary, the computational basis is orthonormal, and tensoring with the prepared unit ancillas is an isometry (Controlled Phase Rotation, Finite registers and their ordered computational bases, The computational basis is orthonormal, Ordered tensor registers, their inner product, and wire permutations).
Proof
For , put and let be the wire permutation listing the first measured vertices in measurement order and the remainder in inherited order. For a prefix , let be the tensor map of its linear measurement bras, with its scalar output identified with , and define . For , the empty tensor map and permutation are identities, so . If , let list the next measured vertex first, and put . Under canonical associations, and . Tensor-map factorwise action and permutation composition therefore give . At , , , and this recursive map is exactly the full branch map in the Definition. Set . At the root it is nonnegative since it is a congruence of by . At every prefix, nonnegativity of gives , so each child state is nonnegative. Orthonormality in [F2] gives . By trace cyclicity [F4], the two child traces sum to .
The root state is , where tensors the unit ancillas and is the finite edge-gate product in [F1]. By [F8], and ; trace cyclicity [F4] therefore gives root trace . Repeatedly applying the trace identity of step 1.1 down the finite binary tree preserves the sum of leaf traces. By the terminal identity in step 1.1, the leaf state is the stated , so . When there are no measurements, the unique empty transcript has the same trace as this root state.
For a pure input , the branch output is by [F6], so its trace is by the coordinate formula in [F6]. For a density input the branch probability is the branch-output trace in step 2.1.
Each branch output is nonnegative because by [F3]. Its trace is therefore nonnegative by [F5]. If that trace is zero, the nonnegative eigenvalues in [F5] sum to zero by [F4], so each is zero and the output operator is zero. For a pure input, step 3.1 then gives . In either case [F7] leaves no normalized conditional state; for positive probability the indicated division is defined.
Depends on
- Finite open-graph adaptive measurement pattern
- Pure state and ray
- Density operator
- Finite projective measurements
- Finite instruments and conditional states
- Controlled Phase Rotation
- Finite registers and their ordered computational bases
- The computational basis is orthonormal
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- 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)$
- Dirac Notation Conversion
- Dirac Notation Coordinate Identity
- Non-negative and positive operators
- A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S
- J gate and ordered equatorial measurement vectors
- J-gate basis and exact phase identities
Used by
Dependency tree · two levels
65 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.09415, §§20.2–20.3 and §20.6 (standard reference, not scraped)
- Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel, Measurement-based quantum computation on cluster states, §§II D–F, pp. 8–16 (standard reference, not scraped)