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.
Constructive factorization of an admissible QSP polynomial pair
Statement
For every integer , a pair is QSP-admissible of degree bound if and only if there is a real phase list such that The converse is constructive: a leading-coefficient phase peel reduces the degree at each nonconstant stage. The polynomial identity, determinant signs, product order, and phase convention are exactly those in Admissible polynomial pair for Hermitian-reflection QSP and QSP signal matrix and ordered phase sequence.
Facts & Assumptions
Given: An integer and polynomials .
Admissible polynomial pair for Hermitian-reflection QSP: the degree bounds and parities are and , and as a polynomial identity.
Unitarity, determinant, and polynomial form of a QSP sequence: a length- reflection sequence has the displayed determinant- matrix form and its upper entries are an admissible pair.
Hermitian-reflection and SU(2) QSP convention conversion: for , the reflection sequence is times the explicitly phase-shifted SU(2) sequence; the map between phase lists is invertible and the scalar is retained under control.
Every nonzero complex number has a unique polar form with and : every nonzero complex number has polar form with .
Euler's formula: for every real : for real .
Over an integral domain, degrees add under multiplication of nonzero polynomials: for nonzero polynomials over a domain, the degree of a product is the sum of the degrees.
Division algorithm for polynomials over a field: division by a nonzero polynomial over a field gives a unique quotient and a remainder that is zero or has degree strictly below the divisor. In particular, division by leaves the constant remainder , so implies divides .
QSP signal matrix and ordered phase sequence: in the stated left-to-right, right-to-left matrix order; for , .
For displayed complex matrices, and “unitary” means ; and continue to mean coefficient conjugation of polynomials.
Proof
If the pair comes from a phase list, Unitarity, determinant, and polynomial form of a QSP sequence gives exactly the stated matrix form, degree/parity bounds, and polynomial identity for the sequence defined in [F8]. This proves the forward implication.
Let and suppose the pair is admissible. Then and is constant with . Set from the unique principal polar representation [F4]; [F5] gives . By [F8], , the required matrix.
Let . Parity gives and for constants . Evaluating the identity at and gives . Set and by [F4], so [F5] gives and ; then set , . By the order in [F8], direct multiplication of gives entries , , , and , exactly the four entries in the Statement for .
Now let and assume the converse has been constructed at every smaller nominal degree. Put and . Multiplication by unit complex scalars preserves the bounds, parities and coefficient-conjugate identity in [F1]. The corresponding source-convention matrix is For real , the diagonal entries of are , and the off-diagonal entries cancel as and its conjugate. Thus ; together with from [F1], this makes unitary by [F9]. Also and by direct multiplication using , while every is unitary with determinant by [F2, F9]. Thus the peel multiplies by unitary matrices.
If is constant, then the identity at gives . For every it then gives , hence throughout that interval. If were nonzero of degree , choose distinct points in ; repeated division by their linear factors using [F7] would force a divisor of degree of , contradicting [F6]. Thus . The parity of the nonzero constant forces even. Set by [F4], so [F5] gives . Direct multiplication using gives and therefore . This identity is the length-two phase product . Insert it on the left of the current sequence; the adjacent and initial combine to by [F3], so the result is again a standard phase list and has two additional signal factors. Repeating this times pads the constant sequence to nominal degree .
Otherwise let , with leading coefficients for and for . The identity forces and : if , the highest term of has degree and cannot cancel; if , the degree- term cannot cancel. At degree , the coefficients therefore satisfy . Thus has modulus one. Set using [F4]; then [F5] gives .
Multiply on the right by , where . The result has the same form with The possible degree- coefficient of and degree- coefficient of both equal zero by . Their parities then give and , the bounds for nominal degree . The right multiplier and are unitary with determinant , so their product is also unitary with determinant . The cofactor formula gives , whereas [F9] gives . Equating entries yields and . Since and , this is the required lower row . If , then and ; expanding their coefficient-conjugate products cancels the two mixed terms and leaves So is admissible at nominal degree .
Put and , the matrix in step 2.1. The pair is admissible at nominal degree , since the unit scalars preserve degree, parity and the coefficient-conjugate identity. Apply the reflection-convention induction hypothesis to this pair. Its displayed matrix is entrywise: the lower-row factors are and . By [F3], convert that reflection phase list to a source-convention list with , hence . Reversing the peel gives , so appending constructs the required finite source-convention list. Each induction call has strictly smaller nominal degree; steps 1.2, 1.3 and 1.5 supply the bases and constant padding.
For , apply the inverse affine phase map in [F3] to obtain a reflection phase list . Since , its upper-left entry is , its upper-right entry is , and its lower entries are and . Thus it is the required reflection sequence and the converse follows. Together with the forward implication and both base cases this proves the equivalence for all .
Depends on
- QSP signal matrix and ordered phase sequence
- Admissible polynomial pair for Hermitian-reflection QSP
- Unitarity, determinant, and polynomial form of a QSP sequence
- Hermitian-reflection and SU(2) QSP convention conversion
- Every nonzero complex number has a unique polar form $r(\cos\theta+i\sin\theta)$ with $r>0$ and $-\pi<\theta\le\pi$
- Euler's formula: $\exp(i\theta)=\cos\theta+i\sin\theta$ for every real $\theta$
- $\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 polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- Over an integral domain, degrees add under multiplication of nonzero polynomials
- Division algorithm for polynomials over a field
- Real and imaginary parts, complex conjugation, and modulus
Used by
- Quantum singular-value transformation circuit Algorithm
- Real bounded-polynomial QSP phase synthesis Algorithm
- Arithmetic cost of exact tower completion and QSP phase peeling Lemma
- Correctness of QSP phase synthesis Theorem
- QSVT action on singular subspaces Theorem
- Qubitization lifts scalar QSP Theorem
- Real bounded polynomial extraction in QSVT Theorem
Dependency tree · two levels
43 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
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 (standard reference, not scraped)