Alphabeta Math
Pipeline-generated
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.

✓ 9 results · all verified · 9 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 9 also cleared it.

Quantum Singular-Value Transformation

1 · Prerequisites

2 · Summary

The page defines a finite projected-unitary encoding of a rectangular map, proves its singular-plane decomposition, and fixes odd and even singular-value transforms, including their distinct kernel conventions. The alternating U,U∗ sequence uses the Hermitian-reflection signal convention WR and phases about the declared right and left projectors. The exact block action treats repeated singular values, σ=0, σ=1, unmatched kernels, and zero-dimensional spaces.

A bounded real parity polynomial is extracted by coherently selecting the phase lists Φ and −Φ and projecting the control onto ∣+⟩. In each paired slot, two explicitly supplied controlled-reflection calls toggle a clean ancilla; an unconditional Rz(2ϕ) and a branch-controlled Rz(−4ϕ) give the two signed projector phases. Their rotation and reflection costs are counted separately. The resource statement also charges signal calls, inverse access, phase generation, and finite-gate compilation; a matrix alone supplies none of these operations.

For normalized block error εBE, scalar approximation error ηpoly, and phase implementation errors ζℓ, the proved operator-norm bound is ηpoly+4dεBE+∑ℓζℓ. The robustness estimate is reproved here from finite unitary completions and a two-copy rotation. No asymptotic gate or classical bit-time bound is inferred from an abstract phase list.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Projected-unitary encoding and singular vectors

Definition

Let H be a finite-dimensional complex inner-product space, let U:H→H be unitary, and let ΠR,ΠL:H→H be orthogonal projections. Write HR=ran⁡(ΠR) and HL=ran⁡(ΠL). The projected-unitary encoding (PUE) of this data is the linear map

A:HR→HL,Ax=ΠLUx.

Equivalently, its ambient-space compression is ΠLUΠR, restricted to HR and regarded as taking values in HL. The map A is a contraction: ∥A∥op≤1.

Put n=dim⁡HR, m=dim⁡HL, and r=rank⁡(A). A singular-value decomposition consists of orthonormal bases v1,…,vn of HR and u1,…,um of HL, and positive singular values 1≥σ1≥⋯≥σr>0, such that

A=∑j=1rσj∣uj⟩⟨vj∣.

The remaining right basis vectors span ker⁡A and the remaining left basis vectors span ker⁡A∗. Empty bases and sums are allowed when a dimension or the rank is zero. The pairing in each rank-one map is the root-linear-first Dirac conversion of Dirac Notation Conversion.

An exact square block encoding is a special case: identify the system with the all-zero ancilla subspace and take ΠL=ΠR equal to that subspace. Under the injection Ja of Finite block encoding, the compression is Ja∗UJa; an exact (α,a,0) block encoding has compressed block A/α.

Facts & Assumptions

Given: A finite-dimensional complex inner-product space H, a unitary U:H→H, orthogonal projections ΠR,ΠL, and the definitions of operator norm and PUE above.

[F1]

The orthogonal projection PWv is the W-component in V=W⊕W⊥: every vector is the sum of its projection into the range and an orthogonal vector in the complement.

[F2]

Pythagoras and finite orthogonal sums: the squared norm of a sum of orthogonal vectors is the sum of their squared norms.

[F4]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the maximum of ∥Tx∥ over unit vectors, with norm zero on the zero domain.

[F5]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every linear map between finite-dimensional inner-product spaces has orthonormal singular bases and positive singular values such that the displayed SVD formula holds.

[F6]

Dirac Notation Conversion: ∣u⟩⟨v∣ maps x to ⟨x,v⟩rootu.

[F7]

Finite block encoding: the all-zero ancilla compression of U is Ja∗UJa, and an exact block encoding sets this compression equal to the normalized target matrix.

[F8]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: the adjoint is characterized by ⟨Tx,y⟩=⟨x,T∗y⟩.

[F9]

Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique adjoint.

[F11]

Real and complex inner-product spaces and their induced length: the inner product is positive definite, so pairings with every vector distinguish vectors.

Proof

1.1givenF1F2F3F4algebra

If HR=0, then A is the zero map and its operator norm is zero by [F4]. Otherwise take any unit x∈HR. The decomposition Ux=ΠLUx+(I−ΠL)Ux has orthogonal terms by [F1], so [F2] gives ∥ΠLUx∥2≤∥Ux∥2. By [F3], ∥Ux∥=1, hence ∥Ax∥≤1. Taking the maximum over unit x proves ∥A∥op≤1.

1.2F7givenalgebra

In the square block-encoding case, Ja is the isometric identification of the system with HR=HL=ran⁡(Πa). The definition of the projected block in [F7] is exactly Ja∗UJa, and the exact case identifies it with the normalized target. Thus this is the stated special case.

2.1F4F5F6step 1.1algebra

Apply [F5] to the finite-dimensional map A:HR→HL. For each positive singular pair, Avj=σjuj and ∥vj∥=∥uj∥=1, so [F4] and step 1.1 give σj=∥Avj∥≤1. The rank-one terms in the SVD sum have the coordinate action fixed by [F6]. When r=0, the positive singular list and the displayed sum are empty; the kernel bases still exist by [F5].

3.1F5F6F8F9F11step 2.1algebra

For each k≤r and every x∈HR, the SVD formula, root-linear-first rank-one action [F6], and orthonormality of the uj give ⟨Ax,uk⟩=σk⟨x,vk⟩; for k>r the same pairing is zero. By [F8]–[F9], ⟨Ax,uk⟩=⟨x,A∗uk⟩, so positive definiteness [F11] gives A∗uk=σkvk for k≤r and A∗uk=0 for k>r. The SVD formula also gives Avk=σkuk for k≤r and Avk=0 for k>r. Since each singular list is a basis, expanding an arbitrary vector in those bases shows that ker⁡A=span⁡{vr+1,…,vn} and ker⁡A∗=span⁡{ur+1,…,um}: the positive-index coefficients must vanish because the corresponding singular values are positive and the other basis is orthonormal. The argument includes empty bases and sums.

4.1F1F8F9F10givenalgebra∎

By [F1], orthogonal decomposition gives ⟨ΠLUx,y⟩=⟨Ux,y⟩ and ⟨x,ΠRU∗y⟩=⟨x,U∗y⟩ for x∈HR and y∈HL. The adjoint rule [F8] for U therefore gives ⟨Ax,y⟩=⟨x,ΠRU∗y⟩. Thus y↦ΠRU∗y is an adjoint of A, and uniqueness [F9] yields A∗=ΠRU∗∣HL. Also, [F10] applies to the unitary U and shows that U∗=U−1 is unitary.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

PUE singular-space invariant decomposition

Statement

Let A:HR→HL be the PUE map of Projected-unitary encoding and singular vectors, with positive singular pairs (σj,vj,uj). For every 0<σj<1, set

wj=(I−ΠR)U∗uj1−σj2,w~j=(I−ΠL)Uvj1−σj2.

The vectors wj form an orthonormal family in ker⁡ΠR and the vectors w~j form an orthonormal family in ker⁡ΠL. In the input basis (vj,wj) and output basis (uj,w~j),

U∣span⁡(vj,wj)=(σj1−σj21−σj2−σj).

For σj=1, Uvj=uj and the complementary vector is absent. A right zero-singular vector v∈ker⁡A∩HR satisfies Uv∈ker⁡ΠL; a left zero-singular vector u∈ker⁡A∗∩HL satisfies U∗u∈ker⁡ΠR. Let MR be the orthogonal sum of all positive-singular input planes or lines, ker⁡A, and U∗(ker⁡A∗); let ML be the corresponding sum of positive-singular output planes or lines, U(ker⁡A), and ker⁡A∗. Then U(MR)=ML. The residual ambient subspaces MR⊥ and ML⊥ lie in ker⁡ΠR and ker⁡ΠL, and U(MR⊥)=ML⊥. Thus each named block is invariant under its corresponding projector, with no implicit pairing of the two kernels.

Facts & Assumptions

Given: A PUE (U,ΠR,ΠL) and the SVD data from Projected-unitary encoding and singular vectors.

[F1]

Projected-unitary encoding and singular vectors: A=ΠLU∣HR, A∗=ΠRU∗∣HL, the positive singular pairs satisfy Avj=σjuj and A∗uj=σjvj, the trailing bases span ker⁡A and ker⁡A∗, and U∗ is unitary.

[F2]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every finite-dimensional linear map has complete orthonormal singular bases and a positive-term SVD formula.

[F5]

The orthogonal projection PWv is the W-component in V=W⊕W⊥: a vector is the sum of its projection into a subspace and an orthogonal component.

[F6]

Pythagoras and finite orthogonal sums: orthogonal components have squared norms that add.

Proof

1.1givenF1F3F4F5F6algebra

For 0<σi,σj<1, [F1] gives ΠRU∗ui=σivi. Since U∗ preserves inner products by [F1], orthogonal projection and [F6] give ⟨(I−ΠR)U∗ui,(I−ΠR)U∗uj⟩=⟨U∗ui,U∗uj⟩−⟨ΠRU∗ui,ΠRU∗uj⟩=δij(1−σi2). Dividing by the positive square roots shows that the wi are orthonormal and lie in ker⁡ΠR. The same calculation, using ΠLUvi=σiui, proves that the w~i are orthonormal in ker⁡ΠL.

1.2F1F3F5F6algebra

If σi=1, then ΠRU∗ui=vi has norm one, as does U∗ui. By the orthogonal decomposition in [F5] and Pythagoras [F6], its component in ker⁡ΠR is zero, so U∗ui=vi and Uvi=ui.

2.1F1F3F4step 1.1algebra

Decompose Uvi=ΠLUvi+(I−ΠL)Uvi=σiui+1−σi2 w~i. Also 1−σi2 Uwi=U(I−ΠR)U∗ui=ui−UΠRU∗ui=ui−σiUvi, where the middle equality uses UU∗=I and the last uses [F1]. Substitution of the first equation yields Uwi=1−σi2 ui−σiw~i, which is the displayed matrix.

3.1F1F2F3F4F5step 1.1step 1.2algebra∎

If v∈ker⁡A∩HR, then ΠLUv=Av=0, so Uv∈ker⁡ΠL. If u∈ker⁡A∗∩HL, then ΠRU∗u=A∗u=0, so U∗u∈ker⁡ΠR. Every right singular vector lies in HR and is orthogonal to each wi and each U∗u from the left kernel, since those vectors lie in ker⁡ΠR. For a positive singular vector and a left-kernel vector, ⟨(I−ΠR)U∗ui,U∗uk⟩=⟨U∗ui,U∗uk⟩−⟨ΠRU∗ui,ΠRU∗uk⟩=0−0=0, because ui⊥uk and ΠRU∗uk=0. Thus the listed source blocks are mutually orthogonal. Their orthogonal complement is contained in ker⁡ΠR, because the right singular vectors, including a basis of ker⁡A, span HR. Applying U preserves orthogonality. The listed output blocks are also mutually orthogonal: the left singular vectors, including a basis of ker⁡A∗, span HL; the vectors w~i are orthonormal by step 1.1; and for v∈ker⁡A, ⟨w~i,Uv⟩=⟨Uvi,Uv⟩−⟨ΠLUvi,ΠLUv⟩=0, since vi⊥v and Av=0. The remaining named output vectors Uv lie in ker⁡ΠL, so they are orthogonal to HL. The output complement is therefore contained in ker⁡ΠL. Since U maps each listed source block onto its corresponding output block, it maps the source complement onto the output complement. These are ambient-space decompositions; the residual blocks are not part of HR or HL. Each projector phase is scalar on the residual source and output blocks, so no residual component mixes into a projected singular-space block.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Odd and even singular-value transforms

Definition

Let A:HR→HL be the PUE map of Projected-unitary encoding and singular vectors, with positive singular-value decomposition A=∑j=1rσj∣uj⟩⟨vj∣. Let p:[−1,1]→C be a scalar function.

If p is odd, define the odd singular-value transform by

poddSV(A):HR→HL,poddSV(A)=∑j=1rp(σj)∣uj⟩⟨vj∣.

If p is even, define its right-space transform by

pRSV(A):HR→HR,pRSV(A)=∑j=1rp(σj)∣vj⟩⟨vj∣+p(0)Πker⁡A,

where Πker⁡A is the orthogonal projection in HR onto ker⁡A. The left-space version is

pLSV(A):HL→HL,pLSV(A)=∑j=1rp(σj)∣uj⟩⟨uj∣+p(0)Πker⁡A∗.

The odd transform annihilates the right kernel because oddness gives p(0)=0; the even transforms use the canonical kernel projections. The resulting operators are independent of the chosen SVD by Singular-value transform is independent of SVD choices ↗.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Quantum singular-value transformation circuit

Definition

Inputs. A finite-dimensional complex-inner-product space H, a unitary U:H→H, orthogonal projections ΠR,ΠL, an integer d≥0, and an exact real phase list Φ=(ϕ0,…,ϕd). The input access contract states separately whether U, U∗, controlled-U, and controlled-U∗ are supplied and gives their individual costs. The scalar signal sequence is UΦ(x)=Z(ϕ0)∏j=1d(WR(x)Z(ϕj)) from QSP signal matrix and ordered phase sequence, with its admissible polynomial pair from Admissible polynomial pair for Hermitian-reflection QSP. A desired polynomial target is supplied with a certificate that Φ realizes its scalar polynomial; generation of Φ is a separate classical/circuit input.

Output. The procedure returns the finite unitary sequence below and uses its compression from HR=ran⁡(ΠR) to HL=ran⁡(ΠL) for odd d, or from HR to itself for even d. No measurement or state-preparation circuit is implicit in this block description.

Instructions. For d≥0, set the current side to R and apply the projector phase eiϕd(2ΠR−I). For j=d−1,d−2,…,0, apply U and switch the current side from R to L if it is R; otherwise apply U∗ and switch from L to R. Then apply eiϕj(2Πcurrent−I). Thus there are d alternating signal calls and d+1 projector-phase operations; d=0 has no signal call and consists only of the phase at ΠR.

For a real target polynomial, run the two phase lists Φ and −Φ in coherent control branches, with the control initialized in ∣+⟩, and take the ∣+⟩-to-∣+⟩ block. The procedure uses the reflected signal convention WR throughout. If a circuit is built through the alternative SU(2) convention, its control-dependent scalar phase must be retained as a relative phase. The exact block action, the real-part extraction, and the implementation costs are established in the separate theorem items on this page. Every phase list, inverse call, controlled call, phase rotation, and finite-gate compilation is supplied or charged separately.

Remarks

When the input is a bounded real target polynomial, its completion and phase-generation steps are supplied separately; finite bit-time and gate-synthesis bounds are not inferred from a bare phase list.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Singular-value transform is independent of SVD choices

Statement

For a finite-dimensional PUE map A:HR→HL, the odd singular-value transform and both even singular-value transforms of Odd and even singular-value transforms are independent of the chosen singular-vector bases. On a positive singular-value subspace, A/σ canonically pairs the right and left eigenspaces; on repeated singular values the transform is scalar on the whole corresponding subspace. The even transforms use the canonical orthogonal projection onto ker⁡A or ker⁡A∗ with coefficient p(0); the odd transform has no zero-singular cross term.

Facts & Assumptions

Given: A finite-dimensional PUE map A:HR→HL and an even or odd function p:[−1,1]→C.

[F1]

Odd and even singular-value transforms: the odd transform sums p(σj)∣uj⟩⟨vj∣ over positive singular values; the even right and left transforms sum p(σj) on their singular-vector bases and use p(0) on the respective kernels.

[F2]

Projected-unitary encoding and singular vectors: the positive singular pairs satisfy Avj=σjuj and A∗uj=σjvj, and the complete right and left bases identify ker⁡A and ker⁡A∗.

[F3]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every finite-dimensional map has complete orthonormal singular bases and a positive-term SVD formula.

[F6]

The orthogonal projection PWv is the W-component in V=W⊕W⊥: each finite-dimensional subspace has a unique orthogonal projection.

Proof

1.1F2F3F4F5algebra

For each distinct positive singular value σ, define Eσ=ker⁡(A∗A−σ2I) in HR and Fσ=ker⁡(AA∗−σ2I) in HL. The adjoint rule [F4] and adjoint algebra [F5] make A∗A and AA∗ self-adjoint, and [F2]–[F3] identify these eigenspaces with the right and left singular subspaces. If v∈Eσ, then Av∈Fσ because AA∗Av=A(A∗Av)=σ2Av. Also [F4] gives ∥Av∥2=⟨v,A∗Av⟩=σ2∥v∥2. Thus Jσ:=A/σ is an isometry from Eσ into Fσ. For y∈Fσ, [F5] gives A∗y∈Eσ, and Jσ(A∗y/σ)=y; hence Jσ maps Eσ onto Fσ.

2.1F1F2F6step 1.1algebra

Group the positive singular terms in the odd transform by their common value σ. In any orthonormal basis (vj) of Eσ, the paired left vectors are uj=Jσvj, so ∑j:σj=σ∣uj⟩⟨vj∣=JσΠEσ, where ΠEσ is the unique projection from [F6]. The grouped term is therefore p(σ)JσΠEσ, independent of the basis.

3.1F1F2F3F6step 1.1step 2.1algebra∎

For the even right transform, grouping by positive singular value gives p(σ)ΠEσ, and the zero-singular part is p(0)Πker⁡A; both are canonical projections. For the even left transform the corresponding terms are p(σ)ΠFσ and p(0)Πker⁡A∗. The zero right and left singular vectors may be chosen independently, but the even definitions use only these unique subspace projections, while the odd definition omits zero singular pairs. Thus all three transforms are independent of the SVD choices.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Projector phase operations from controlled reflections

Statement

Let Π be an orthogonal projection on a finite-dimensional space H, with reflection RΠ=2Π−I and SΠ=I−2Π=−RΠ. Suppose the control-first call C(RΠ) is explicitly supplied, together with an ancilla initialized in ∣0⟩ and exact one-qubit H and Rz gates. Then the unitary eiϕRΠ is implemented exactly by two controlled-reflection calls and one variable phase rotation, with a constant number of additional one-qubit gates, and the ancilla is returned to ∣0⟩. If an external branch qubit is present and a branch-controlled Rz(2ϕ) is supplied, controlling only that rotation implements the controlled projector phase; the two controlled-reflection calls remain unconditional with respect to the external branch. In QSVT the construction is applied separately to ΠR and ΠL; each projector-phase slot uses two controlled calls to the corresponding reflection. The access and gate costs are charged separately.

Facts & Assumptions

Given: The finite space H, an orthogonal projection Π, the specified controlled-reflection access, and a clean ancilla qubit.

[L1]

Orthogonal-Projector Reflection and Access Contract: RΠ=2Π−I and SΠ=I−2Π=−RΠ; RΠ is +I on ran⁡Π and −I on ker⁡Π.

[L2]

Controlled Unitary Access: C(V)=∣0⟩⟨0∣⊗IH+∣1⟩⟨1∣⊗V is the control-first unitary, and its availability is explicitly declared.

[L3]

Projector Reflections Are Hermitian Unitary Involutions: C(SΠ)=ZaC(RΠ), where Za=diag⁡(1,−1) acts on the control ancilla.

[L4]

Exact one-qubit gates and rotations: H=2−1/2(111−1) and Rz(θ)=exp⁡(−iθZ/2) are exact one-qubit gates.

[L5]

Denotational semantics of a finite layered circuit: chronological circuit operations compose in reverse order in the operator product.

Proof

1.1L1L2L3L4algebra

Define the ancilla-controlled bit flip XΠ:=HaC(SΠ)Ha, where Ha=H⊗IH. On ran⁡Π, SΠ=−I, so [L2] makes C(SΠ) act as Za on the ancilla; conjugating by Ha gives Xa. On ker⁡Π, SΠ=I, so C(SΠ) acts as I and XΠ is the identity. Thus XΠ flips the ancilla exactly on the range of Π. By [L3], each use of C(SΠ) is one supplied call to C(RΠ) plus one ancilla Za gate.

2.1L1L4step 1.1algebra

Apply XΠ, then Rz(2ϕ)=e−iϕZa, then XΠ again. On ran⁡Π, the ancilla operation is Xae−iϕZaXa=eiϕZa; on ker⁡Π it is e−iϕZa. Acting on ∣0⟩, these give phases eiϕ and e−iϕ, respectively, and both branches return the ancilla to ∣0⟩. The induced system operation is therefore eiϕ(Π)+e−iϕ(I−Π)=eiϕ(2Π−I).

3.1L2L3L4L5step 1.1step 2.1

The construction uses two occurrences of XΠ, hence two controlled-reflection calls by step 1.1, and one variable Rz(2ϕ) rotation. Its Hadamard and ancilla-Z gates have constant count per phase slot. Applying the same construction with ΠR or ΠL gives the two projector-phase operations used by the QSVT sequence; no direct or controlled reflection cost is inferred from the matrix description alone.

4.1L2L4step 1.1step 2.1algebra∎

Let c be an external branch qubit. Replace the middle rotation by its controlled version, leaving both occurrences of XΠ unchanged. On branch c=1, step 2.1 gives eiϕRΠ. On branch c=0, the middle operation is identity and the two adjacent XΠ operations cancel because XΠ2=I; the system operation is identity. Thus this is the controlled projector phase. It uses the same two controlled-reflection calls as the uncontrolled construction and one separately supplied and charged branch-controlled rotation.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

QSVT signal and reflection query counts

Statement

For degree d≥0, one un-controlled QSVT sequence makes exactly d signal calls: ⌈d/2⌉ calls to U and ⌊d/2⌋ calls to U∗, beginning with U when d>0. It applies exactly d+1 projector-phase operations, with ⌈(d+1)/2⌉ about ΠR and ⌊(d+1)/2⌋ about ΠL. By Projector phase operations from controlled reflections, each phase operation uses two controlled calls to the corresponding reflection and one variable one-qubit phase rotation, plus a constant number of one-qubit gates. A coherent control of one sequence against the identity requires no controlled signal call when d is even and one controlled signal call when d is odd. Selecting between the two phase lists Φ and −Φ uses the same unconditioned signal list in both branches and controls only the phase rotations. Phase generation, inverse access, and finite-gate compilation retain their separately declared costs. At d=0 there is no signal or controlled-signal call.

Facts & Assumptions

Given: An integer degree d≥0 and the finite procedure in Quantum singular-value transformation circuit.

[F1]

Quantum singular-value transformation circuit: the procedure applies one initial phase about ΠR, then d alternating signal calls, switching sides after each call and applying one phase at the new side.

[F2]

Projector phase operations from controlled reflections: each projector-phase operation uses two controlled-reflection calls and one variable Rz rotation; an external branch controls only that rotation while leaving both reflection calls unconditional with respect to the branch.

[F3]

Controlled Unitary Access: a controlled unitary call is an explicitly supplied operation and is charged separately from its uncontrolled call.

[F4]

Circuit-family and computation cost model: signal queries, controlled calls, one-qubit gates, depth, width, ancillas, and classical generation costs are separate coordinates.

Proof

1.1F1givenalgebra

The loop in [F1] executes once for each integer j=d−1,…,0, hence it makes exactly d signal calls. The side starts at R, so the first call is U and directions alternate; therefore the counts are ⌈d/2⌉ forward calls and ⌊d/2⌋ inverse calls. If d=0, the loop is empty.

1.2F1F2F3algebra

For a controlled sequence against identity, use the externally controlled projector-phase implementation in [F2] at every phase slot. On the zero branch each phase is then the identity, so the alternating signal calls cancel in adjacent UU∗ or U∗U pairs. If d is even all signal calls pair and cancel; if d is odd, one forward U call remains, which is made controlled while the other signal calls pair and cancel. On the zero branch that controlled call is also identity, while the one branch executes the original sequence. Thus this variant requires zero extra controlled signal calls for even d and one controlled U call for odd d, whose availability is explicit by [F3].

2.1F1F2F3algebra

For a branch selector between Φ and −Φ, let control value 0 select Φ and value 1 select −Φ. At a slot with phase ϕ about Π, use the clean-ancilla toggle XΠ from step 1.1 of [F2], then unconditional Rz(2ϕ), then a control-one-controlled Rz(−4ϕ), and then XΠ again. The middle rotation is Rz(2ϕ) in branch 0 and Rz(−2ϕ) in branch 1; because XΠ flips the ancilla on ran⁡Π and leaves it unchanged on ker⁡Π, the system phases are respectively eiϕ(2Π−I) and e−iϕ(2Π−I). The same unconditioned signal call occurs between each pair of phase slots, so the signal list is shared and this selector adds no controlled signal query.

2.2F1step 1.1algebra

There is one phase at the initial R side and one after each of the d signal calls, for d+1 slots. Their sides alternate beginning at R, giving ⌈(d+1)/2⌉ right-projector slots and ⌊(d+1)/2⌋ left-projector slots.

3.1F2step 2.1step 2.2algebra

Apply [F2] to each slot counted in step 2.2. The total controlled-reflection calls are 2⌈(d+1)/2⌉ for ΠR and 2⌊(d+1)/2⌋ for ΠL, unchanged for the paired selector. A single unconditioned sequence has d+1 variable rotations; the Φ/−Φ selector instead uses d+1 unconditional rotations Rz(2ϕj) and d+1 separately charged branch-controlled rotations Rz(−4ϕj), with constant one-qubit overhead per slot.

4.1F3F4step 1.2step 2.1∎

The counts above describe only the listed operations. By [F4], the cost of supplied U, U∗, controlled calls, phase gates, ancilla wires, classical phase generation, and finite-gate compilation are recorded in their applicable separate coordinates; none is inferred from the matrix A alone.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Operator perturbation bound for QSVT

Statement

Let A,B:HR→HL be contractions between the same finite-dimensional complex-inner-product spaces, let P be the scalar polynomial of an exact degree-d QSVT phase sequence, and put δ=∥A−B∥op. Then, for the corresponding odd or even singular-value transforms,

∥PSV(A)−PSV(B)∥op≤4dδ.

For d=0 the transform is constant on the relevant singular space and the difference is zero. The lemma is an operator statement; the unitary completions used in the proof are finite-dimensional existence constructions and do not supply an efficient implementation or any additional query access.

Facts & Assumptions

Given: Same-dimension contractions A,B:HR→HL and an exact degree-d QSVT phase sequence with scalar polynomial P.

[F1]

Projected-unitary encoding and singular vectors: a PUE compression has singular values in [0,1] and its finite SVD uses orthonormal left and right bases.

[F2]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every finite-dimensional map has complete orthonormal singular bases and a positive-term SVD formula.

[F3]

QSVT action on singular subspaces: for any PUE realization of a contraction C, the phase sequence's projected block is PSV(C).

[F4]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the maximum action on unit vectors, and the zero-domain norm is zero.

[F6]

The orthogonal projection PWv is the W-component in V=W⊕W⊥: range and orthogonal-complement components give the orthogonal decomposition defining a projection.

[F7]

Pythagoras and finite orthogonal sums: orthogonal components have squared norms that add.

[F11]

The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2: ∥ST∥op≤∥S∥op∥T∥op.

Proof

1.1F1F2F4algebra

If either HR or HL is zero, both maps are zero and the odd transforms agree; when HR=0 the even right transforms are also the same scalar map on the zero space, and when HL=0 the even right transforms are P(0)IHR for both. The inequality is then immediate. Assume both dimensions are positive. Let m=dim⁡HL, n=dim⁡HR, q=min⁡(m,n), and extend an SVD of any contraction C:HR→HL to orthonormal bases u1,…,um and v1,…,vn, with σj=0 for any missing singular values up to q.

1.2F1F2F4F6F7F10constructalgebra

On K=HL⊕HR, choose orthonormal input bases a1,…,am in the first summand and v1,…,vn in the second, and output bases u1,…,um and b1,…,bn in the two summands. For 1≤j≤q, define VCaj=1−σj2 uj−σjbj and VCvj=σjuj+1−σj2 bj. These two images are orthonormal by direct expansion; map any remaining aj to the corresponding unused uj, and any remaining vj to the corresponding unused bj. The resulting images form an orthonormal basis, so VC is unitary. If ΠR0 projects onto the second summand and ΠL0 onto the first, then ΠL0VCΠR0∣HR=C by the SVD formula. Thus every finite contraction has a PUE unitary completion with fixed subspaces of dimensions n,m.

2.1F1F2F4F8F9F10step 1.2constructalgebra

Let δ>0 and set D=(B−A)/δ. Homogeneity of the operator norm gives ∥D∥op=1, so D is a contraction. By step 1.2, choose unitary completions VA,VD of A,D on the same K with the same projectors ΠR0,ΠL0. On K⊕K, let V=VA⊕VD and let ΠR,ΠL select the right and left subspaces, respectively, in the first copy only. Put c=(1+δ)−1/2, s=δ/(1+δ), and W=(cI−sIsIcI); c2+s2=1 makes W unitary. For x in the first-copy right subspace, W(x,0)=(cx,sx), V maps this to (cVAx,sVDx), and W∗ returns first component c2VAx+s2VDx. Projection to the first-copy left subspace therefore gives c2Ax+s2Dx=(A+δD)x/(1+δ)=Bx/(1+δ). Since V and W are unitary, [F8]–[F9] show V′=W∗VW is unitary; it is a PUE completion of B/(1+δ) for the same projectors.

3.1F4F5F10step 2.1algebra

Direct multiplication gives (W−I)∗(W−I)=2(1−c)I, hence ∥W−I∥op=2−2c. With t=1+δ≥1, the inequality 2−2/t≤t2−1 follows from (t−1)2(t+2)≥0, so ∥W−I∥op≤δ. For every unit x, write Vx−W∗VWx=(I−W∗)Vx+W∗V(I−W)x. By [F10], V and W∗ preserve norms; the two summands therefore have norms at most ∥W−I∥op. Using [F5] and [F4] gives ∥V−V′∥op≤2δ.

4.1F3F4F5F6F7F10F11step 2.1step 3.1algebra

The exact QSVT phase product contains d signal factors, each either V or V∗; its remaining phase factors are identical for V and V′. Telescoping the two products one signal factor at a time gives operator-norm difference at most d∥V−V′∥op: the factor differences for V have that norm, and for V∗ the identity V∗−V′∗=V∗(V′−V)V′∗ plus [F10]–[F11] gives the same norm; multiplying by unchanged unitary factors preserves the bound. Compression by orthogonal projections cannot increase the bound, since projections are contractions by [F6]–[F7]. By [F3], the compressed blocks are PSV(A) and PSV(B/(1+δ)). Steps 2.1 and 3.1 therefore give ∥PSV(A)−PSV(B/(1+δ))∥op≤2dδ.

5.1F3F4F5step 1.2step 2.1step 3.1step 4.1algebra∎

For the second comparison, use step 1.2 to choose completions VB,V0 of B and the zero map on the same K, and put T=VB⊕V0. With the same projectors and the same W,c,s from step 2.1, T compresses to B, while W∗TW compresses to c2B+s20=B/(1+δ). The calculation of step 3.1 gives ∥T−W∗TW∥op≤2δ; the telescoping and compression argument of step 4.1 therefore gives ∥PSV(B)−PSV(B/(1+δ))∥op≤2dδ. Combining this with step 4.1 by the triangle inequality proves the asserted 4dδ bound. If δ=0 the two transforms are identical, and if d=0 the transform is independent of the input; both cases satisfy the same bound.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Real bounded polynomial extraction in QSVT

Statement

Let A:HR→HL be a finite PUE map and let p∈R[x] have degree at most d, parity d mod 2, and ∣p(x)∣≤1 on [−1,1]. The exact real-polynomial completion and phase-factorization results give a phase list Φ whose scalar QSP polynomial satisfies Re⁡PΦ=p. Run the degree-d QSVT sequence with a control qubit prepared in ∣+⟩, using the phase lists Φ and −Φ in its two branches, and project the control back onto ∣+⟩. The resulting compressed block is exactly poddSV(A) for odd d, and exactly pRSV(A) for even d, including the even value p(0) on ker⁡A. The result includes d=0, zero and unit singular values, repeated values, and unmatched kernels.

The two branches share the same d unconditioned alternating calls to U and U∗. Each of the d+1 projector-phase slots uses two controlled-reflection calls for its phase gadget and one branch-controlled one-qubit rotation; the controlled-rotation and reflection-access costs are charged separately. No controlled signal call is needed for the Φ/−Φ selector. Phase-list generation and any finite-gate compilation remain separately charged.

Facts & Assumptions

Given: A finite PUE map A, an integer d≥0, and a real polynomial p with the stated degree, parity, and interval bound.

[F1]

Completion of a bounded real parity polynomial: such a p has a QSP-admissible pair P,Q with Re⁡P=p exactly.

[F2]

Constructive factorization of an admissible QSP polynomial pair: every QSP-admissible pair has a real phase list whose ordered signal product has the pair's upper-left polynomial.

[F3]

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

[F4]

QSVT action on singular subspaces: an exact phase list acts on each positive singular pair by its scalar polynomial; odd compression annihilates the right kernel, while even right compression acts on it by the scalar value at zero.

[F5]

Projector phase operations from controlled reflections: the clean-ancilla toggle XΠ=HC(SΠ)H flips exactly on ran⁡Π and is implemented with one controlled-reflection call plus a fixed ancilla gate.

[F6]

Quantum singular-value transformation circuit: the chronological procedure alternates the supplied U and U∗ calls, switching the projected side after each call, and interleaves the declared projector phases.

[F7]

QSVT signal and reflection query counts: a degree-d sequence has d signal calls and d+1 projector-phase slots; the Φ/−Φ selector shares the signal list and uses one unconditional and one branch-controlled rotation per slot.

[F8]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: the positive singular pairs are orthonormal, and the right singular vectors together with a basis of ker⁡A form an orthonormal basis of HR.

[F9]

Controlled Unitary Access: a controlled operation is explicitly supplied and separately costed.

[F10]

Denotational semantics of a finite layered circuit: chronological circuit layers compose in reverse order in the denoted operator product.

Proof

1.1F1F2givenchoose

By [F1], choose a QSP-admissible pair P,Q with Re⁡P=p. By [F2], choose a phase list Φ whose ordered signal product has upper-left entry PΦ=P. The real part identity is therefore exact for every real x.

1.2F5F6F7F10givenalgebra

Let control value 0 select Φ and value 1 select −Φ. In each slot with phase ϕ about Π, apply the toggle XΠ from [F5], then unconditional Rz(2ϕ), then a control-one-controlled Rz(−4ϕ), and then XΠ again. In branch 0 the middle rotation is Rz(2ϕ); in branch 1 it is Rz(−2ϕ). The toggle places the clean ancilla in ∣1⟩ on ran⁡Π and in ∣0⟩ on ker⁡Π, so the two system phases are eiϕ(2Π−I) and e−iϕ(2Π−I), respectively, with the ancilla returned to ∣0⟩. Thus each slot realizes the required Φ/−Φ phase pair. By [F6] and [F10], the signal calls between slots are shared unconditioned calls, and the full controlled unitary has branch operators UΦ and U−Φ. Projecting ∣+⟩ to ∣+⟩ gives their arithmetic mean, since ⟨+∣b⟩⟨b∣+⟩=1/2 for each b∈{0,1}.

2.1F3step 1.1algebra

Since each entry of WR(x) is real and Z(ϕ)‾=Z(−ϕ), entrywise conjugation of the ordered product in [F3] gives U−Φ(x)=UΦ(x)‾. Thus its upper-left polynomial is P−Φ(x)=PΦ(x)‾ for every x∈[−1,1].

3.1F1F4F8step 1.1step 1.2step 2.1algebra

Fix a positive singular pair (σj,vj,uj). By [F4], the two branch compressions contribute coefficients PΦ(σj) and P−Φ(σj). Their mean is Re⁡PΦ(σj)=p(σj) by steps 1.1–2.1. For even d, [F4] gives the same mean p(0) on each vector in ker⁡A; for odd d, p(0)=0 and the output block annihilates that kernel. Thus the averaged compression has exactly the stated singular-value transform on all of HR.

4.1F5F6F7F9step 1.2algebra∎

There are d alternating signal positions and d+1 phase slots by [F7]. The signal list is unconditioned and shared. At each slot, the two toggles use two controlled-reflection calls, and the middle uses one unconditional Rz(2ϕ) plus one branch-controlled Rz(−4ϕ). By [F9], the controlled rotations and reflection calls are supplied and costed separately. For d=0, there is one paired phase slot and no signal call, so the same count applies.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

QSVT robustness, approximation error, and resources

Statement

Let A be a finite square or rectangular matrix with a declared isometric padding A^, and let α>0 satisfy α≥∥A∥op. Let B be the exact compressed PUE block of the supplied input unitary and assume

∥B−A^/α∥op≤εBE.

Let P be the degree-d parity polynomial of an admissible QSVT phase sequence, and let f have the same parity. Put S:={0}∪{σj:σj>0 is a singular value of A^/α}, so zero is included even when the two matrix dimensions differ. If sup⁡σ∈S∣P(σ)−f(σ)∣≤ηpoly, and the implemented phase operation at slot ℓ is a unitary within operator-norm error ζℓ of its ideal operation, then the implemented compressed block B~ satisfies

∥B~−fSV(A^/α)∥op≤ηpoly+4dεBE+∑ℓζℓ.

The exact sequence uses d calls alternating between U and U∗, d+1 projector-phase operations, and the reflection and one-qubit resources in QSVT signal and reflection query counts. A real-polynomial control wrapper has its separately listed controlled gates. Matrix-data access, block-encoding construction, inverse and controlled access, phase-list generation, finite-gate compilation, and classical bit costs are charged through their declared interfaces; no cost follows from a bare matrix.

Facts & Assumptions

Given: A normalized block encoding, its finite PUE compression, an admissible degree-d phase sequence, a uniform scalar approximation bound, and unitary phase implementations with the stated errors.

[F1]

Finite block encoding: an (α,a,ε) block encoding has normalized compression within ε of the declared padded target divided by α, with α≥∥A∥op.

[F2]

Odd and even singular-value transforms: odd and even singular-value transforms are defined by their SVD coefficients, including the even kernel term.

[F3]

Operator perturbation bound for QSVT: for contractions C,D, ∥PSV(C)−PSV(D)∥op≤4d∥C−D∥op.

[F4]

QSVT signal and reflection query counts: the exact sequence has d signal calls, d+1 phase slots, and the corresponding right/left reflection counts.

[F5]

Circuit-family and computation cost model: oracle queries, controlled calls, gates, depth, width, ancillas, classical generation, and precision are separate cost coordinates.

[F6]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the maximum action on unit vectors.

[F8]

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: an SVD supplies complete orthonormal right and left singular bases and the positive-term formula.

[F9]

The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2: compatible finite-dimensional maps satisfy ∥ST∥op≤∥S∥op∥T∥op.

[F10]

QSVT action on singular subspaces: the ideal QSVT sequence for block B compresses to PSV(B).

[L1]

Projected-unitary encoding and singular vectors: a projected-unitary compression is a contraction.

[L5]

The orthogonal projection PWv is the W-component in V=W⊕W⊥: a vector and its projection-complement components are orthogonal.

[L6]

Pythagoras and finite orthogonal sums: orthogonal components have squared norms that add.

Proof

1.1F1F3F6F9L1L2L3L4L5L6givenalgebra

Let Ein,Eout be the declared isometric padding maps in [F1], so A^=EoutAEin∗ and Ein∗Ein=I. Put Pin=EinEin∗. By [L3]–[L4], Pin∗=Pin=Pin2; [L5] makes it an orthogonal projection, and [L6] gives ∥Pinz∥≤∥z∥. The adjoint identity [L3] then yields ∥Ein∗z∥2=⟨Pinz,z⟩=∥Pinz∥2≤∥z∥2. Since both padding maps preserve norms by [L2], [F9] gives ∥A^∥op=∥EoutAEin∗∥op≤∥A∥op; conversely A^Einx=EoutAx for every x, so taking maxima over unit vectors gives equality. Thus A0:=A^/α is a contraction. The PUE compression B is a contraction by [L1], and [F1] gives ∥B−A0∥op≤εBE. Applying [F3] gives ∥PSV(B)−PSV(A0)∥op≤4dεBE.

1.2F2F6F8givenalgebra

Choose the SVD bases of A0 from [F8]. For odd parity, the difference PSV(A0)−fSV(A0) sends each right singular vector vj to (P(σj)−f(σj))uj and annihilates ker⁡A0. Orthonormality gives, for x=∑jcjvj+x0, ∥(PSV−fSV)x∥2=∑j∣P(σj)−f(σj)∣2∣cj∣2≤ηpoly2∥x∥2. For even parity the same bound follows by diagonal action on the right singular basis, including P(0)−f(0) on the kernel. Taking the maximum over unit vectors by [F6] yields ∥PSV(A0)−fSV(A0)∥op≤ηpoly.

1.3F4F5F6F7F9F10givenalgebra

Replace the ideal phase operations one slot at a time by their implemented unitaries. The product difference is a sum of d+1 terms, each containing one phase difference and otherwise unitary factors. By [F9], multiplying by those unitary factors preserves or bounds the operator norm by their norm 1; [F7] and [F6] then give ∥U~Φ−UΦ∥op≤∑ℓζℓ. Compression by the input and output projections is contractive, so the same upper bound holds for the compressed blocks. The exact ideal compressed block is PSV(B) by [F10].

2.1F4F5F7step 1.1step 1.2step 1.3∎

The implemented block differs from fSV(A0) by the sum of its phase-implementation, input-block, and scalar-approximation differences. Applying the triangle inequality to steps 1.1, 1.2, and 1.3 yields ∥B~−fSV(A0)∥op≤ηpoly+4dεBE+∑ℓζℓ. The resource statement follows from [F4]–[F5]; each absent access, synthesis, data-loading, or compilation operation remains a separate supplied cost.

5 · Examples, counterexamples and false statements

None yet.

Sources