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.
Phase-estimation finite outcome law
Statement
Let , , and let the input be an eigenvector with , where . For each , the probability of measuring in the algorithm of Quantum phase estimation is Thus the finite outcome kernel is defined at every phase, including ; no quotient with a zero denominator is needed in this formula.
Facts & Assumptions
Given: The eigenphase input and access model of Eigenphase estimation access model, the algorithm of Quantum phase estimation, and .
The phase convention is , and the phase-register basis is big-endian with the wire of weight at position (Eigenphase estimation access model, Big-endian encoding of ordered bit strings).
The algorithm prepares , applies controlled on the wire of weight , then applies the inverse of the positive-sign binary QFT and measures the phase register (Quantum phase estimation).
The denotation of chronological layers is , with each gate embedded on its declared wires (Denotational semantics of a finite layered circuit).
The positive-sign cyclic QFT has matrix action ; the exact binary circuit implements it in the declared order (Positive-sign cyclic quantum Fourier transform, Exact binary QFT circuit correctness).
On the phase register, is one member of the finite orthogonal resolution of the identity; the outcome weight of a density operator is (Finite registers and their ordered computational bases, Ordered tensor registers, their inner product, and wire permutations, Tensor products of finitely many linear maps, Finite projective measurements, Projective measurement outcome weights are probabilities, Finite POVMs and their outcome law).
The Dirac convention is linear in the first argument of the root inner product, so acts by , has coordinate matrix , and has trace (Dirac Notation Conversion, Dirac Notation Coordinate Identity, The basis-independent trace of an endomorphism of a finite-dimensional vector space, The trace as the sum of the diagonal entries). A normalized nonzero vector defines the density operator by Ray-to-projector is well-defined and bijective.
The finite cyclic character sum is at frequency and otherwise (Orthogonality of the characters on ).
Complex conjugation distributes over finite sums and (Real and imaginary parts, complex conjugation, and modulus, Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Trace is cyclic for compatible finite-dimensional maps: (For and , ).
For real , . Indeed, by , , and , while the addition law gives (, and the complex exponential extends the real exponential, The complex exponential by its power series); since (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive), conjugation gives the same inverse, which is unique in the complex field ( is a field, every element is uniquely , and every nonzero element has inverse ).
Proof
Before the controlled powers, the state is by [F2]. Write , where is the bit at wire by [F1]. The controlled operation on that wire applies exactly when ; multiplying the eigenvalues gives . Hence the state after the controlled-power stage is . Reading this gate sequence as an operator on the ordered register uses [F9].
The inverse QFT matrix coefficient from input to output is , by [F3] and the adjoint convention. Applying it to step 1.1 gives , where . The sign is positive in the eigenphase and negative in the inverse-QFT coefficient, yielding the displayed difference . The operator ordering is the one in [F9].
The vector is normalized. Expand the finite squared moduli using [F7]. For every real , [F10] gives , and the exponential addition law combines each conjugate pair of phases; interchanging the finite sums then gives . By [F6], the inner sum is when and otherwise, because ; therefore . Since and the are orthonormal, .
The ray-projector theorem [F5] makes a density operator. The phase-register projective outcome has projector from [F4], so it extracts . By [F5] and [F8], , where the penultimate equality uses . The outcome law in [F4] therefore gives this probability to the classical label . Substituting the value of from step 2.1 gives exactly the displayed .
The finite sum in the displayed law is defined for every , including when is an integer. For its geometric-sum specialization, the denominator is zero exactly when , equivalently ; in every other case Finite geometric sum for phase-estimation amplitudes gives the nonzero-denominator quotient. Thus the stated squared-sum law handles all phases without an undefined quotient.
Depends on
- Quantum phase estimation
- Eigenphase estimation access model
- Dirac Notation Conversion
- Dirac Notation Coordinate Identity
- Finite registers and their ordered computational bases
- Big-endian encoding of ordered bit strings
- Finite projective measurements
- Pure state and ray
- Ray-to-projector is well-defined and bijective
- Projective measurement outcome weights are probabilities
- Exact binary QFT circuit correctness
- Finite geometric sum for phase-estimation amplitudes
- Denotational semantics of a finite layered circuit
- Positive-sign cyclic quantum Fourier transform
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- Finite POVMs and their outcome law
- The complex exponential by its power series
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- The principle of mathematical induction
- $\ker(\exp)=2\pi i\mathbb Z$, and $\exp z=\exp w$ exactly when $z-w\in2\pi i\mathbb Z$
- Orthogonality of the characters $x\mapsto e^{2\pi ikx/N}$ on $\mathbb Z/N\mathbb Z$
- Real and imaginary parts, complex conjugation, and modulus
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
- $\mathbb C=\mathbb R[x]/(x^2+1)$ is a field, every element is uniquely $a+bi$, and every nonzero element has inverse $(a-bi)/(a^2+b^2)$
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule
Used by
- Exact estimation of a binary phase Example
- Nearest-grid and tail estimates in phase estimation Example
- Circular-distance tail bound in phase estimation Lemma
- Exact zero-label probability for counting Lemma
- Nearest-grid probability in phase estimation Lemma
- Two nearest phase labels carry probability at least eight over pi squared Lemma
- Amplitude-estimation additive error and success probability Theorem
- Exact phase recovery on the QPE grid Theorem
- Finite reversible-walk finding cost Theorem
- Phase estimation on a superposition of eigenspaces Theorem
- Phase-estimation nearest-grid and tail bounds Theorem
- QPE output law and conditional state for a spectral input Theorem
Dependency tree · two levels
124 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)
- Lin Lin, Lecture Notes on Quantum Algorithms for Scientific Computation, §§16.1–16.3 (standard reference, not scraped)