Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

QSVT action on singular subspaces

Statement

Let A:HR→HL be the PUE map of Projected-unitary encoding and singular vectors, with positive singular pairs (σj,vj,uj), and let Φ=(ϕ0,…,ϕd) be the exact phase list in Quantum singular-value transformation circuit. Let PΦ be the upper-left scalar polynomial of its QSP signal sequence. On every positive two-dimensional singular plane from PUE singular-space invariant decomposition, the QSVT sequence is exactly UΦ(σj). Consequently, if d is odd,

ΠLUΦΠR∣HR=∑j=1rPΦ(σj)∣uj⟩⟨vj∣=(PΦ)oddSV(A),

and if d is even,

ΠRUΦΠR∣HR=∑j=1rPΦ(σj)∣vj⟩⟨vj∣+PΦ(0)Πker⁡A=(PΦ)RSV(A).

The formulas include singular values 0 and 1, repeated singular values, unmatched left and right kernels, and zero-dimensional singular spaces. If p∈R[x] is zero or has degree at most d, has parity d mod 2, and satisfies ∣p(x)∣≤1 on [−1,1], the exact completion and phase-factorization suppliers give a phase list with Re⁡PΦ=p. The coherent Φ/−Φ branch then has compressed block pSV(A); for a supplied uniform scalar error η, its block differs from pSV(A) by at most η.

Facts & Assumptions

Given: A PUE, a finite phase list, and the definitions of the singular-value and QSP transforms.

[F1]

Projected-unitary encoding and singular vectors: A=ΠLU∣HR is a contraction with an SVD A=∑j=1rσj∣uj⟩⟨vj∣.

[F2]

PUE singular-space invariant decomposition: for 0<σj<1, the basis change is (σj1−σj21−σj2−σj); the σj=1 plane collapses and the zero and residual subspaces are specified separately.

[F3]

QSP signal matrix and ordered phase sequence: WR(x)=(x1−x21−x2−x), Z(ϕ)=diag⁡(eiϕ,e−iϕ), and UΦ(x)=Z(ϕ0)∏j=1d(WR(x)Z(ϕj)).

[F4]

Unitarity, determinant, and polynomial form of a QSP sequence: the upper-left entry of UΦ(x) is a polynomial PΦ of parity d mod 2 and degree at most d.

[F5]

Odd and even singular-value transforms: odd transforms act between left and right singular spaces; even transforms act on a singular space and use p(0) on its kernel.

[F6]

Singular-value transform is independent of SVD choices: these transforms are independent of the chosen singular-vector bases.

[F7]

Completion of a bounded real parity polynomial: every real polynomial of degree at most d, parity d mod 2, and bound ∣p∣≤1 on [−1,1] has an admissible complex completion with real part exactly p.

[F8]

Constructive factorization of an admissible QSP polynomial pair: every admissible pair has an exact real phase list for the fixed Hermitian-reflection QSP sequence.

[F9]

Projector Reflections Are Hermitian Unitary Involutions: RΠ=2Π−I is unitary, with eigenvalues +1 on ran⁡Π and −1 on ker⁡Π.

[F10]

Hermitian-reflection and SU(2) QSP convention conversion: conversion to the SU(2) convention carries an explicit scalar id, which is retained under control.

[F11]

Projector phase operations from controlled reflections: its clean-ancilla toggle flips on ran⁡Π and each toggle uses one controlled-reflection call plus a fixed ancilla gate.

Proof

1.1F2F3F4F9algebra

Fix 0<σj<1. In the input basis (vj,wj) and output basis (uj,w~j), [F2] says that U is WR(σj), and U∗ has the same matrix because it is real symmetric. The right-projector phase is Z(ϕ) on the input basis since 2ΠR−I has eigenvalues +1,−1 there; the left-projector phase is the same Z(ϕ) on the output basis. Thus the alternating sequence multiplies in the fixed order Z(ϕ0)WR(σj)Z(ϕ1)⋯WR(σj)Z(ϕd)=UΦ(σj), whose upper-left entry is PΦ(σj) by [F3]–[F4].

1.2F2F4F5algebra

If σj=1, [F2] gives Uvj=uj and the complementary component is zero; the surviving one-dimensional action is the first-coordinate action of UΦ(1), namely PΦ(1). For σj=0, Uvj lies in ker⁡ΠL and U∗(Uvj)=vj. The alternating calls therefore swap this right-kernel vector and its left-complement image exactly as WR(0)=(0110) does. If d is odd the final vector lies in ker⁡ΠL and the left compression is zero, equal to PΦ(0) because [F4] makes PΦ odd. If d is even it returns to vj with coefficient PΦ(0), the prescribed even-kernel term in [F5]. Left-kernel inputs and the residual complement contribute nothing to the stated compression by [F2].

2.1F1F2F5F6step 1.1step 1.2algebra

The positive singular planes, the σ=1 lines, the right zero-kernel lines, and the residual blocks are orthogonal and exhaust the relevant projected spaces by [F2]. Summing the scalar coefficients from steps 1.1–1.2 therefore gives the displayed odd and even compressed-block formulas.

3.1F3F5F6F7F8F10F11step 2.1algebra∎

For real p under the stated degree, parity, and interval bounds, [F7] gives an admissible pair P,Q with Re⁡P=p, and [F8] supplies its exact phase list Φ. At each slot with phase ϕj about Π, use the clean-ancilla toggle XΠ from [F11], then apply unconditional Rz(2ϕj), then a control-one-controlled Rz(−4ϕj), and then XΠ again. In control branch 0 the middle rotation is Rz(2ϕj); in branch 1 it is Rz(−2ϕj). Since XΠ places the ancilla in ∣1⟩ on ran⁡Π and in ∣0⟩ on ker⁡Π, the induced system phases are respectively eiϕj(2Π−I) and e−iϕj(2Π−I), and the ancilla returns to ∣0⟩. The same unconditioned signal calls therefore give full branch operators UΦ and U−Φ. Because WR(x) is real and Z(−ϕ)=Z(ϕ)‾, entrywise conjugation gives U−Φ(x)=UΦ(x)‾, and projection of the control from ∣+⟩ to ∣+⟩ has block 12(UΦ+U−Φ). By step 2.1, its coefficient on each positive singular pair is 12(PΦ(σj)+PΦ(σj)‾)=Re⁡PΦ(σj)=p(σj); for an even transform the same identity gives p(0) on ker⁡A. Thus the compressed block is pSV(A). If the supplied scalar approximation satisfies sup⁡x∈[−1,1]∣Re⁡PΦ(x)−p(x)∣≤η, each singular coefficient changes by at most η, so orthonormality gives operator-norm error at most η. The proof stays in the reflected convention; [F10]'s scalar is not discarded if a circuit is translated to the SU(2) convention.

Depends on

Used by

Dependency tree · two levels

48 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