Generalized quantum signal processing: exact characterization of polynomial pairs
ProvedQAlgorithms.Papers.RoadmapA04.generalizedQSP_iffLet and let be prescribed ordinary complex polynomials. For real angles define
For any positive integer and any unitary matrix , put , with the control qubit as the first tensor factor, and
When , this is just the initial rotation tensored with . There exist real vectors and a real , chosen independently of and , such that
if and only if
Here and denote polynomial evaluation at the matrix , and the stars leave the second-column blocks unspecified. The zero polynomial satisfies the degree bound.
This theorem characterizes exactly the polynomial pairs synthesized by forward signal applications and rotations; it imposes no real-coefficient or parity restriction.
Formalization Note Universal finite-dimensional unitary realization expresses the polynomial identity used by the proof; in particular, it includes every scalar unitary . The rotation is the matrix printed in equation (6), without a determinant-one constraint.
import Definitions.Def_QAlgorithms_Defs_GeneralizedQSP set_option autoImplicit false
namespace QAlgorithms.Papers.RoadmapA04
/-- Motlagh and Wiebe, *Generalized Quantum Signal Processing*, arXiv:2308.01501v2,
Theorem 3, equation (7), PDF p.4 (signal and rotation: equations (5)--(6), PDF p.3).
For prescribed complex polynomials, exact first-column realization by one set of real angles
for every finite-dimensional unitary is equivalent to the degree bounds and normalization
on the entire unit circle. The sequence is R_d A ... R_1 A R_0, with A = diag(U,I).
Equation (6), rather than the reverse-proof base-case prose typo, fixes Q = exp(i lambda) sin theta.
The printed rotations are unitary; no determinant-one condition or phase adjustment is imposed. -/
theorem generalizedQSP_iff (d : ℕ) (P Q : Polynomial ℂ) :
(∃ theta phi : Fin (d + 1) → ℝ, ∃ lam : ℝ,
∀ N : ℕ, 0 < N → ∀ U : Matrix (Fin N) (Fin N) ℂ,
U ∈ Matrix.unitaryGroup (Fin N) ℂ → ∀ i j : Fin N,
gqspSequence theta phi lam U (false, i) (false, j) =
(Polynomial.aeval U P) i j ∧
gqspSequence theta phi lam U (true, i) (false, j) =
(Polynomial.aeval U Q) i j) ↔
P.natDegree ≤ d ∧ Q.natDegree ≤ d ∧
∀ z : ℂ, ‖z‖ = 1 → ‖P.eval z‖ ^ 2 + ‖Q.eval z‖ ^ 2 = 1 := by sorry
end QAlgorithms.Papers.RoadmapA04
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and every pair of polynomials with complex coefficients, the following are equivalent: there exist real numbers , , and , fixed simultaneously for all dimensions and all unitaries below, such that, for every natural number , every complex unitary matrix indexed by , and every pair of indices in that set, the matrix
satisfies
where the Boolean indices false and true are denoted by and , respectively, and are polynomial evaluations at with scalar coefficients multiplied by , and
and, on the other side of the equivalence, both and have natural degree at most and satisfy
Here natural degree assigns degree to the zero polynomial, so either polynomial may be zero provided the displayed identity holds. The assertion includes , when and both polynomials have natural degree ; dimension imposes no condition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.