Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 Kb, a normalized pure input ∣ψ⟩ has pb=∥Kb∣ψ⟩∥2 and ∑bpb=1. For a density operator ρ, the branch probability is pb=tr⁡(KbρKb†) and these probabilities also sum to one. A transcript with pb=0 is impossible and has no normalized conditional output; normalization is defined only for positive-probability branches.

Facts & Assumptions

Given: A finite pattern with q ordered binary projective measurements and a normalized pure or mixed input state.

[F1]

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).

[F2]

At each transcript prefix, the chosen pair {∣b⟩α:b=0,1} 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).

[F3]

A density operator is nonnegative and has trace one (Density operator).

[F5]

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).

[F6]

A pure state represented by a unit vector u has rank-one operator ∣u⟩⟨u∣, whose coordinate matrix is uu† (Pure state and ray, Dirac Notation Conversion, Dirac Notation Coordinate Identity).

[F7]

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).

[F8]

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

1.1F1F2F3F4F8construct

For 0≤j≤q, put Rj:=V∖{m1,…,mj} and let Πj:HV→Hm1⊗⋯⊗Hmj⊗HRj be the wire permutation listing the first j measured vertices in measurement order and the remainder in inherited order. For a prefix c=(c1,…,cj), let Bc:=⨂t=1jαt(c<t) ⁣⟨ct∣mt be the tensor map of its linear measurement bras, with its scalar output C⊗j identified with C, and define Kc:=(Bc⊗IRj)ΠjUGιI:HI→HRj. For j=0, the empty tensor map and permutation are identities, so K∅=UGιI. If j<q, let Qj+1:HRj→Hmj+1⊗HRj+1 list the next measured vertex first, and put Lb∣c:=(αj+1(c) ⁣⟨b∣mj+1⊗IRj+1)Qj+1. Under canonical associations, Bcb=Bc⊗αj+1(c) ⁣⟨b∣mj+1 and Πj+1=(IHm1⊗⋯⊗Hmj⊗Qj+1)Πj. Tensor-map factorwise action and permutation composition therefore give Kcb=Lb∣cKc. At j=q, Rq=O, Πq=ΠM,O, and this recursive map is exactly the full branch map in the Definition. Set σc:=KcρKc†. At the root it is nonnegative since it is a congruence of ρ by UGιI. At every prefix, nonnegativity of σc gives ⟨Lb∣cσcLb∣c†v,v⟩=⟨σcLb∣c†v,Lb∣c†v⟩≥0, so each child state is nonnegative. Orthonormality in [F2] gives ∑b=01Lb∣c†Lb∣c=IRj. By trace cyclicity [F4], the two child traces sum to tr⁡(σc).

2.1step 1.1F1F3F4F8induction

The root state is UGιIριI†UG†, where ιI tensors the unit ∣+⟩ ancillas and UG is the finite edge-gate product in [F1]. By [F8], ιI†ιI=I and UG†UG=I; trace cyclicity [F4] therefore gives root trace tr⁡(ρ)=1. 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 KbρKb†, so ∑btr⁡(KbρKb†)=1. When there are no measurements, the unique empty transcript has the same trace as this root state.

3.1step 2.1F3F6algebra

For a pure input ρ=∣ψ⟩⟨ψ∣, the branch output is ∣Kbψ⟩⟨Kbψ∣ by [F6], so its trace is ∥Kb∣ψ⟩∥2 by the coordinate formula in [F6]. For a density input the branch probability is the branch-output trace in step 2.1.

4.1step 3.1F3F4F5F7algebra∎

Each branch output KbρKb† is nonnegative because ⟨KbρKb†v,v⟩=⟨ρKb†v,Kb†v⟩≥0 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 Kb∣ψ⟩=0. In either case [F7] leaves no normalized conditional state; for positive probability the indicated division is defined.

Depends on

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