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.
Prepared unitary and success subspace for amplitude amplification
Definition
Let be a nonzero finite-dimensional complex inner-product space, let be a specified unit input vector, let be a supplied measurement-free unitary, and let be an orthogonal projection on . The access contract supplies and charges calls to , its inverse , the good phase reflection and the zero-input phase reflection The signs are part of the contract: is on and on its orthogonal complement. Reflection about the prepared state is the composite , with its component calls charged unless a separate direct-reflection access is supplied.
Put and define the initial success weight When , define . When , define . These vectors are normalized and lie respectively in the range and kernel of . If or , the corresponding zero component is omitted and no vector is normalized from it. With this convention, means the sum of the nonzero component terms. Under the projective measurement , the probability of the good outcome is ; the finite-dimensional rank-one density and projective-measurement outcome laws are A unit-vector outer product is a density operator and Projective measurement outcome weights are probabilities.
The output task may return the conditional quantum state after the good outcome; that state is defined only on a positive-probability branch and is supported in by Conditional state for a projective measurement. A classical output additionally requires to be diagonal in a specified output basis and a costed coherent or ordinary verifier. An arbitrary projection does not supply a classical predicate.
Remarks
The unitary must be supplied coherently. A measured randomized procedure is not an admissible unless a separate coherent embedding is supplied. Controlled access to is not assumed. A controlled verifier, if used, is a distinct charged access capability.
Depends on
- Pure state and ray
- Finite projective measurements
- Projective measurement outcome weights are probabilities
- Conditional state for a projective measurement
- A unit-vector outer product is a density operator
- Inverse Unitary Access
- Orthogonal-Projector Reflection and Access Contract
- Projector Reflections Are Hermitian Unitary Involutions
- Dirac Notation Conversion
Used by
- Amplitude amplification with a fixed integer iteration count Algorithm
- Amplitude amplification with independently chosen phase rotations Algorithm
- Exact success amplification by attenuating the good branch Algorithm
- Finite amplification from a supplied success lower bound Algorithm
- Iterative no-QFT amplitude estimation by finite-grid likelihood Algorithm
- Known-amplitude amplification with integer rounding Algorithm
- Unknown-amplitude randomized search Algorithm
- Amplitude-amplification invariant plane Lemma
- Amplitude-amplification access and resource accounting Proposition
- Exact query count for the finite-grid iterative estimator Theorem
- Phase-matching condition for amplitude-amplification rotations Theorem
- Success bound under an explicit amplitude-amplification phase mismatch Theorem
Dependency tree · two levels
37 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
- Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp, Quantum Amplitude Amplification and Estimation (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)