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.
Large clock-penalty perturbation
Statement
Let be finite-dimensional, let with , and let satisfy and . For , set , and let be the eigenvalues of the compression , where . With , the two smallest eigenvalues of obey Consequently ; positivity of this bound requires the separate condition . Every unit eigenvector of with eigenvalue also satisfies . Thus alone supplies no general gap conclusion.
Facts & Assumptions
Given: The orthogonal splitting , the operators and bounds in the Statement, and the ordered eigenvalues of the finite-dimensional Hermitian compressions.
and are self-adjoint, with their finite-dimensional eigenvalues characterized by Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space and Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely.
The operator norm is the maximum of over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
Proof
Write in blocks as for . Then and by [F1]–[F2]. For real , , so the Schur complement is defined and .
The invertible block triangular change of variables completing the square in gives the direct sum quadratic form of and . Since the latter is positive definite, the largest dimension of a subspace on which is negative definite equals the corresponding dimension for . This follows directly because the triangular change is an invertible linear map and hence preserves subspace dimension and signs of the quadratic form.
For , the span of the first eigenvectors of is a -dimensional subspace of on which the Rayleigh quotient of is at most . If had fewer than eigenvalues at most , that subspace would contain a nonzero vector orthogonal to its first eigenvectors, whose Rayleigh quotient would be strictly larger than , a contradiction. Thus .
Fix or and suppose . Then , and step 1.1 gives . Since , at most eigenvalues of are negative. By step 2.1, at most eigenvalues of are negative. Letting increase to proves . The gap estimate follows by subtracting the bounds for .
If is a unit eigenvector of eigenvalue , its block equation is . By step 1.1, ; then [F2] yields . No lower bound on the compressed gap was used in this leakage estimate. For a counterexample to any gap conclusion from alone, take , , and on and on ; then , every satisfies , and the lowest eigenvalue of has multiplicity two. Hence the separate compressed-gap condition is necessary.
Depends on
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
Used by
Dependency tree · two levels
9 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
- Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev, Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)