§3 important example, equations (16)–(17)
OpenQAlgorithms.Papers.Independent.Intakethird100.P03.hadamard_eigenphase_testLet be unitary on an invariant subspace , and let be a normalized eigenvector with eigenvalue . The circuit preserves each eigenspace and, with its ancilla initially zero, gives
More generally, on that eigenspace the ancilla undergoes for every ancilla vector.
This records preservation as well as conditional probabilities, independently of behavior outside .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
noncomputable section
open scoped Matrix ComplexConjugate Kronecker
namespace QAlgorithms.Papers.Independent.Intakethird100.P03
open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)
attribute [local instance] Classical.propDecidable
/-- PDF p.16, equations (16)–(17): eigenspaces are preserved, with explicit ancilla
amplitudes and conditional Born probabilities. For a partial U, hU describes its isometric
restriction to the invariant subspace N; behavior outside N is irrelevant. -/
theorem hadamard_eigenphase_test {I : Type*} [Fintype I] [DecidableEq I]
(N : Submodule ℂ (EuclideanSpace ℂ I)) (U : Matrix I I ℂ)
(hU : ∃ e : N ≃ₗᵢ[ℂ] N, ∀ x : N, act U x.val = (e x).val)
(phi : ℝ) (x : EuclideanSpace ℂ I) (hx : x ∈ N) (hnorm : IsState x)
(heigen : act U x = Complex.exp (2 * Real.pi * phi * Complex.I) • x) :
(∀ a : EuclideanSpace ℂ Bool,
act (eigenphaseTest U) (tensorVec a x) = tensorVec (act (phaseAncilla phi) a) x) ∧
act (eigenphaseTest U) (tensorVec (ket false) x) =
tensorVec (WithLp.toLp 2 (fun b : Bool =>
if b then (1 - Complex.exp (2 * Real.pi * phi * Complex.I)) / 2
else (1 + Complex.exp (2 * Real.pi * phi * Complex.I)) / 2)) x ∧
marginalFst (act (eigenphaseTest U) (tensorVec (ket false) x)) false =
(1 + Real.cos (2 * Real.pi * phi)) / 2 ∧
marginalFst (act (eigenphaseTest U) (tensorVec (ket false) x)) true =
(1 - Real.cos (2 * Real.pi * phi)) / 2 := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P03
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any finite index type with decidable equality, let be a complex linear subspace of , and let be a complex matrix indexed by . Assume there exists a surjective complex linear isometry such that for every . Let and satisfy and , where . Put in Boolean ordering , let act as the identity on the false control sector and as on the true control sector, and set and . Then the following four assertions hold, where tensor vectors have coordinates and is the false coordinate vector:
The subspace isometry hypothesis concerns the restriction of to . If is empty or , the norm-one hypothesis on cannot be satisfied.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.