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 on a superposition of eigenspaces
Statement
Let be a unitary on a nonzero finite-dimensional complex inner-product space . Let be its finite set of distinct eigenphases, and let denote the orthogonal projection onto the full eigenspace for eigenvalue ; degeneracies are grouped in one projection. For , , define For a unit input , the unnormalized branch vector is and If , the conditional vector is ; if , no conditional vector is assigned. The outcome law is an eigenspace-weighted mixture, while the conditional branch can retain coherent cross terms between distinct eigenspaces.
After discarding the phase register, the induced system instrument has branch maps for operators on . More generally, for a density operator on , where is a nonzero finite-dimensional reference space, the unnormalized reference-preserving branch after measuring and discarding the phase register is Its probability is , and the conditional state is exactly when that probability is positive. With , the reference outcome law is , where and . If every eigenphase is on the -grid, then when and otherwise, so the instrument branch is . If any eigenphase is off-grid, its nonzero coefficient has modulus less than one in every , so is not a projection and the induced instrument is not the spectral projection instrument.
Facts & Assumptions
Given: The finite-dimensional unitary , its spectral subspaces, the QPE circuit and access promise, a unit vector , and optionally a density operator on .
A unitary on a finite-dimensional inner-product space is normal: the isometry characterization gives (For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent). The complex spectral theorem therefore gives an orthogonal decomposition into eigenspaces, with mutually orthogonal spectral projections summing to the identity (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely, Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space).
A unitary is an isometry; if with , norm preservation gives (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces, For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent).
Every unit scalar is for a unique ; moreover for every real ( is a bijection from onto the real unit circle, , , and , , and exactly when ).
The algorithm's final readout branch is the Lüders map for (Quantum phase estimation).
Chronological layers denote , and each local gate is embedded on its declared wires (Denotational semantics of a finite layered circuit). For linear maps , the operator is the linear map with (Tensor products of finitely many linear maps).
Tensor-map adjoints satisfy , so for every finite reference factor (Tensor maps preserve composition, identities, and adjoints).
If in the ancilla basis, the identity extension of has blocks by the block-amplification lemma. The sandwich has those same blocks because tensor maps act factorwise (Finite ancilla amplification is a well-defined block map, Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints).
The inverse positive-sign QFT contributes matrix coefficient , and the eigenphase convention contributes on the -th controlled-power branch (Positive-sign cyclic quantum Fourier transform, Quantum phase estimation, Exact binary QFT circuit correctness).
The finite outcome kernel satisfies for every phase (Phase-estimation finite outcome law).
Orthogonal projections satisfy , for , and (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely, The orthogonal projection is the -component in ).
A completely positive map remains positive under every finite identity extension; a finite instrument has completely positive branches and its sum preserves trace (Completely positive maps, Finite instruments and conditional states).
Trace is linear and cyclic on finite-dimensional operators (Trace is a linear functional on , For and , , The basis-independent trace of an endomorphism of a finite-dimensional vector space).
A density operator is nonnegative with trace one, and partial trace over a finite register discards that factor while retaining the reference system (Density operator, Partial trace over a finite tensor factor).
For , the finite geometric amplitude is ; exactly for (Finite geometric sum for phase-estimation amplitudes, , and exactly when ).
The phase-register computational-basis readout is a projective measurement with effects : they are self-adjoint idempotents, mutually orthogonal and complete (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). For every vector in the joint register, , so each is nonnegative (Non-negative and positive operators). Together with completeness, this makes a finite POVM (Finite POVMs and their outcome law).
The spectral projections tensored with form a finite projective measurement, and their traces against a density operator are nonnegative weights summing to one (Tensor products of finitely many linear maps, Projective measurement outcome weights are probabilities, Finite projective measurements, Density operator).
Proof
By [F1], write orthogonally with projections . By [F2], every eigenvalue has modulus one, and [F3] supplies its unique phase . Therefore and .
On a phase-register basis branch , the controlled powers act as . On each eigenspace, . Applying the inverse-QFT matrix in [F4], the coefficient of on is ; hence the post-readout Kraus operator on is . Interpreting the chronological gate list as this operator uses [F14].
Orthogonality in [F6] gives . Summing over and using [F5] yields . Consequently, for a unit vector , ; all cross terms vanish because the eigenspaces are orthogonal. The weights are nonnegative and sum to one, so this is the eigenspace-weighted mixture law.
If every has , the finite geometric sum in [F10] and cyclic-character orthogonality give for and otherwise. Distinct phases have distinct labels, so is exactly the spectral projection for the eigenspace with label , or zero if there is none.
By linearity of the circuit, its pre-readout map from to the phase register tensored with is , with the from step 2.1. For any operator on , the joint output is , using [F15] for the tensor adjoint. Applying the readout branch in [F13] gives . Reorder the phase factor to the last position using [F11], then take its partial trace by the coordinate formula [F9]; the sole nonzero diagonal phase coordinate is , so the result is exactly . In particular this holds for the density operator in the statement. To prove complete positivity, take any finite reference factor and any nonnegative operator on . Its identity extension is by [F16]. Writing , its quadratic form is , so every finite extension is positive and each branch is completely positive by [F7].
If some phase is off-grid, then for every , and by [F10]. The geometric formula gives for every . Since and [F5] says the squared moduli sum to one, each is strictly less than one. Thus acts on this eigenspace by a scalar of modulus strictly between zero and one, so is not a projection; the induced system instrument is not the spectral projection instrument.
For any finite-dimensional reference (including ) and any operator on , [F8] and step 2.2 give . Taking proves that the system maps form an instrument on . For a density with arbitrary reference , cyclicity and linearity also give . By [F12], the weights are nonnegative and sum to one. Therefore the reference outcome law is the claimed mixture. When , is nonnegative of trace one, and when no conditional density is defined. For a pure input the conditional vector is .
To witness coherence for a permitted , let and choose the witness space with orthonormal basis . Define on this entire space by and , extending linearly. Each basis coefficient is multiplied by a unit scalar by [F3], so preserves the norm and is unitary by For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent. Set , which is unit. At output , , while [F10] and [F3] give : [F10] makes the denominator nonzero since , and [F3] gives for the numerator. Thus , and its rank-one operator has the nonzero cross terms and . The branch probability is positive because its coefficient is nonzero, so conditioning preserves these cross terms.
Depends on
- Quantum phase estimation
- Eigenphase estimation access model
- Controlled Unitary Access
- Dirac Notation Conversion
- Dirac Notation Coordinate Identity
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Finite projective measurements
- Projective measurement outcome weights are probabilities
- Denotational semantics of a finite layered circuit
- Finite registers and their ordered computational bases
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- Tensor maps preserve composition, identities, and adjoints
- Finite ancilla amplification is a well-defined block map
- Finite instruments and conditional states
- Phase-estimation finite outcome law
- Finite geometric sum for phase-estimation amplitudes
- Positive-sign cyclic quantum Fourier transform
- Exact binary QFT circuit correctness
- Density operator
- Partial trace over a finite tensor factor
- Finite POVMs and their outcome law
- Completely positive maps
- Non-negative and positive operators
- The complex exponential by its power series
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- $t\mapsto(\cos t,\sin t)$ is a bijection from $[0,2\pi)$ onto the real unit circle
- $\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$
- The orthogonal projection $P_Wv$ is the $W$-component in $V=W\oplus W^\perp$
- 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
- Trace is a linear functional on $M_n(F)$
- 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
- For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and $T^*T=I$ are equivalent
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
Used by
- Modular order finding with rational reconstruction Algorithm
- Szegedy-walk marked-set detection Algorithm
- A non-coprime phase gives a proper order divisor Example
- Exact zero-label probability for counting Lemma
- Amplitude-estimation additive error and success probability Theorem
- Finite reversible-walk finding cost Theorem
- Success probability and repetition for modular order finding Theorem
- Walk detection correctness and cost Theorem
Dependency tree · two levels
136 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)