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.
Clean-ancilla postselection has normalized branch weights
Statement
With the notation of Clean-ancilla zero-branch postselection, every unit vector has and . If , the assigned conditional vector is a unit vector; if , then and no conditional vector exists.
Facts & Assumptions
Given: Finite registers , the injection , the projector , and a unit vector .
Clean-ancilla zero-branch postselection: , , and .
Ordered tensor registers, their inner product, and wire permutations: the tensor-product inner product is the product inner product on elementary tensors.
Dirac Notation Conversion, Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces, and Finite-dimensional linear isometries satisfy the adjoint identity: the bra is the adjoint functional for the root-linear-first pairing, and a norm-preserving linear map satisfies .
The norm induced by a real or complex inner product: the squared norm is the self-pairing.
The computational basis is orthonormal: the distinguished computational-basis vector has norm .
Proof
Given: As in Facts & Assumptions.
From the product inner product [F2] and unit norm [F5], for every , so is an isometry by its definition in [F3]. Therefore by [F3]. It follows that is self-adjoint and idempotent, , and .
The two summands are orthogonal because and . Expanding their squared norm by [F4] gives . Both summands are nonnegative, so each lies in .
If , then . If , definiteness of the inner-product norm gives , so normalization is undefined and the definition correctly assigns no conditional vector.
Depends on
- Clean-ancilla zero-branch postselection
- Finite registers and their ordered computational bases
- The computational basis is orthonormal
- An isometric quantum encoding gives an orthogonal code projector
- Ordered tensor registers, their inner product, and wire permutations
- Dirac Notation Conversion
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
- Finite-dimensional linear isometries satisfy the adjoint identity
- The norm $\lVert v\rVert=\sqrt{\langle v,v\rangle}$ induced by a real or complex inner product
Used by
Dependency tree · two levels
38 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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 28 §28.3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, §9.3 (standard reference, not scraped)