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.
Quantum phase estimation
Definition
Input. An integer ; an -qubit phase register; a finite-dimensional system register ; a unitary ; a unit eigenvector with promised phase ; and one of the forward access capabilities in Eigenphase estimation access model.
Output. A classical label and its phase estimate , where .
Instructions.
- Initialize the phase register in and the system register in .
- Apply the Hadamard of Exact one-qubit gates and rotations to each phase wire. This prepares in the declared big-endian order.
- For , apply the supplied controlled to control wire and the system. Under single controlled-unitary access, implement that operation with sequential calls to , as specified by the access model.
- Apply the inverse of the positive-sign exact binary QFT circuit of Positive-sign cyclic quantum Fourier transform and Exact binary QFT circuit correctness. Construct it by reversing the chronological gate list and replacing each gate by its adjoint, including the final swaps and negating controlled-phase angles.
- Perform the computational-basis projective measurement on the phase register. Its specified Lüders instrument has branch map for each label (Finite projective measurements, Finite instruments and conditional states). Output the observed label and the ratio .
The inverse in step 4 is the inverse QFT, not ; a forward QPE run makes no controlled inverse-unitary query. The coherent prefix is the circuit through step 4 before measurement. A consumer that coherently uncomputes this prefix needs the separate controlled inverse-power capability from Eigenphase estimation access model.
Remarks
For the instrument clause in step 5, let and . Tensor products of these operators act factorwise on elementary tensors by Tensor products of finitely many linear maps. The phase-register basis projectors are self-adjoint idempotents, mutually orthogonal and complete, so is a projective measurement on (Finite projective measurements, Finite registers and their ordered computational bases, Ordered tensor registers, their inner product, and wire permutations). The space is nonzero and finite-dimensional because and the input includes a unit vector in finite-dimensional (Eigenphase estimation access model). For every , Thus each is nonnegative (Non-negative and positive operators) and the complete family is a finite POVM (Finite POVMs and their outcome law). Since is itself nonnegative and , uniqueness of the nonnegative square root gives (A non-negative operator has a unique non-negative square root). Applying The square-root Lüders maps form an instrument to this POVM therefore proves that the branch maps specified in step 5 form a valid finite instrument.
Depends on
- Eigenphase estimation access model
- Dirac Notation Conversion
- Controlled Unitary Access
- Exact binary QFT circuit
- Exact binary QFT circuit correctness
- Denotational semantics of a finite layered circuit
- Positive-sign cyclic quantum Fourier transform
- Finite registers and their ordered computational bases
- Big-endian encoding of ordered bit strings
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- Exact one-qubit gates and rotations
- Finite projective measurements
- Non-negative and positive operators
- Finite POVMs and their outcome law
- Projective measurement outcome weights are probabilities
- A non-negative operator has a unique non-negative square root
- The square-root Lüders maps form an instrument
- Completely positive maps
- Finite instruments and conditional states
Used by
- Bounded-error evaluation from a dual adversary certificate Algorithm
- HHL finite sine-window phase-estimation algorithm Algorithm
- MNRS finite reversible-walk finding Algorithm
- Modular order finding with rational reconstruction Algorithm
- QFT-based amplitude estimation Algorithm
- Quantum counting by uniform-state amplitude estimation Algorithm
- Quantum phase-estimation spectral sampler Algorithm
- Rational reconstruction from a phase sample Algorithm
- Szegedy-walk marked-set detection Algorithm
- Exact estimation of a binary phase Example
- Phase-estimation finite outcome law Lemma
- Signed phase decoding has no alias on the promised spectrum Lemma
- Amplitude-estimation additive error and success probability Theorem
- Dual reflection evaluator has bounded-error correctness Theorem
- Finite reversible-walk finding cost Theorem
- Phase estimation on a superposition of eigenspaces Theorem
- Phase-estimation query and gate costs Theorem
- QPE output law and conditional state for a spectral input Theorem
- Quantum counting error and boundary cases Theorem
Dependency tree · two levels
74 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, §4.3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, version 6, §4.6 (standard reference, not scraped)