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.
Quantum Singular-Value Transformation
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Block Encodings
- Bounded Linear Operators and Quotient Spaces
- Circuit Syntax, Denotational Semantics, and Measurement
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Controlled Gates, Phase, and Entanglement
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-Dimensional Complex Inner-Product Spaces and Matrix Interfaces
- Formal Languages, Encodings, and Decision Problems
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fundamental Trigonometric Identities
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Recurrences and Rational Generating Functions
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Pure and Mixed States, Ensembles, and Schmidt Decomposition
- Quantum Signal Processing
- Qubits, Bloch Sphere, Pauli Algebra, and One-Qubit Gates
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Resource Bounds and Machine Invariance
- Reversible Computation, Ancillas, and Coherent Oracles
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Strongly Continuous Semigroups and Hille Yosida
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Turing Machines, Configurations, and Computation
- Uniform Circuit Families, Promise Problems, and Complexity
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 sequence uses the Hermitian-reflection signal convention and phases about the declared right and left projectors. The exact block action treats repeated singular values, , , 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 and a branch-controlled 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 , scalar approximation error , and phase implementation errors , the proved operator-norm bound is . 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
Projected-unitary encoding and singular vectors
Definition
Let be a finite-dimensional complex inner-product space, let be unitary, and let be orthogonal projections. Write and . The projected-unitary encoding (PUE) of this data is the linear map
Equivalently, its ambient-space compression is , restricted to and regarded as taking values in . The map is a contraction: .
Put , , and . A singular-value decomposition consists of orthonormal bases of and of , and positive singular values , such that
The remaining right basis vectors span and the remaining left basis vectors span . 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 equal to that subspace. Under the injection of Finite block encoding, the compression is ; an exact block encoding has compressed block .
Facts & Assumptions
Given: A finite-dimensional complex inner-product space , a unitary , orthogonal projections , and the definitions of operator norm and PUE above.
The orthogonal projection is the -component in : every vector is the sum of its projection into the range and an orthogonal vector in the complement.
Pythagoras and finite orthogonal sums: the squared norm of a sum of orthogonal vectors is the sum of their squared norms.
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary operator preserves the norm of every vector.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the maximum of over unit vectors, with norm zero on the zero domain.
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.
Dirac Notation Conversion: maps to .
Finite block encoding: the all-zero ancilla compression of is , and an exact block encoding sets this compression equal to the normalized target matrix.
The adjoint is characterised by : the adjoint is characterized by .
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.
For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent: a finite-dimensional unitary satisfies and preserves inner products.
Real and complex inner-product spaces and their induced length: the inner product is positive definite, so pairings with every vector distinguish vectors.
Proof
If , then is the zero map and its operator norm is zero by [F4]. Otherwise take any unit . The decomposition has orthogonal terms by [F1], so [F2] gives . By [F3], , hence . Taking the maximum over unit proves .
In the square block-encoding case, is the isometric identification of the system with . The definition of the projected block in [F7] is exactly , and the exact case identifies it with the normalized target. Thus this is the stated special case.
Apply [F5] to the finite-dimensional map . For each positive singular pair, and , so [F4] and step 1.1 give . The rank-one terms in the SVD sum have the coordinate action fixed by [F6]. When , the positive singular list and the displayed sum are empty; the kernel bases still exist by [F5].
For each and every , the SVD formula, root-linear-first rank-one action [F6], and orthonormality of the give ; for the same pairing is zero. By [F8]–[F9], , so positive definiteness [F11] gives for and for . The SVD formula also gives for and for . Since each singular list is a basis, expanding an arbitrary vector in those bases shows that and : 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.
By [F1], orthogonal decomposition gives and for and . The adjoint rule [F8] for therefore gives . Thus is an adjoint of , and uniqueness [F9] yields . Also, [F10] applies to the unitary and shows that is unitary.
PUE singular-space invariant decomposition
Statement
Let be the PUE map of Projected-unitary encoding and singular vectors, with positive singular pairs . For every , set
The vectors form an orthonormal family in and the vectors form an orthonormal family in . In the input basis and output basis ,
For , and the complementary vector is absent. A right zero-singular vector satisfies ; a left zero-singular vector satisfies . Let be the orthogonal sum of all positive-singular input planes or lines, , and ; let be the corresponding sum of positive-singular output planes or lines, , and . Then . The residual ambient subspaces and lie in and , and . Thus each named block is invariant under its corresponding projector, with no implicit pairing of the two kernels.
Facts & Assumptions
Given: A PUE and the SVD data from Projected-unitary encoding and singular vectors.
Projected-unitary encoding and singular vectors: , , the positive singular pairs satisfy and , the trailing bases span and , and is unitary.
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.
Adjoints satisfy , , , and : adjoints reverse products, , and .
The orthogonal projection is the -component in : a vector is the sum of its projection into a subspace and an orthogonal component.
Pythagoras and finite orthogonal sums: orthogonal components have squared norms that add.
Proof
For , [F1] gives . Since preserves inner products by [F1], orthogonal projection and [F6] give . Dividing by the positive square roots shows that the are orthonormal and lie in . The same calculation, using , proves that the are orthonormal in .
If , then has norm one, as does . By the orthogonal decomposition in [F5] and Pythagoras [F6], its component in is zero, so and .
Decompose . Also , where the middle equality uses and the last uses [F1]. Substitution of the first equation yields , which is the displayed matrix.
If , then , so . If , then , so . Every right singular vector lies in and is orthogonal to each and each from the left kernel, since those vectors lie in . For a positive singular vector and a left-kernel vector, , because and . Thus the listed source blocks are mutually orthogonal. Their orthogonal complement is contained in , because the right singular vectors, including a basis of , span . Applying preserves orthogonality. The listed output blocks are also mutually orthogonal: the left singular vectors, including a basis of , span ; the vectors are orthonormal by step 1.1; and for , , since and . The remaining named output vectors lie in , so they are orthogonal to . The output complement is therefore contained in . Since 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 or . Each projector phase is scalar on the residual source and output blocks, so no residual component mixes into a projected singular-space block.
Odd and even singular-value transforms
Definition
Let be the PUE map of Projected-unitary encoding and singular vectors, with positive singular-value decomposition . Let be a scalar function.
If is odd, define the odd singular-value transform by
If is even, define its right-space transform by
where is the orthogonal projection in onto . The left-space version is
The odd transform annihilates the right kernel because oddness gives ; 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 ↗.
Quantum singular-value transformation circuit
Definition
Inputs. A finite-dimensional complex-inner-product space , a unitary , orthogonal projections , an integer , and an exact real phase list . The input access contract states separately whether , , controlled-, and controlled- are supplied and gives their individual costs. The scalar signal sequence is 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 to for odd , or from to itself for even . No measurement or state-preparation circuit is implicit in this block description.
Instructions. For , set the current side to and apply the projector phase . For , apply and switch the current side from to if it is ; otherwise apply and switch from to . Then apply . Thus there are alternating signal calls and projector-phase operations; has no signal call and consists only of the phase at .
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 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.
Singular-value transform is independent of SVD choices
Statement
For a finite-dimensional PUE map , 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, 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 or with coefficient ; the odd transform has no zero-singular cross term.
Facts & Assumptions
Given: A finite-dimensional PUE map and an even or odd function .
Odd and even singular-value transforms: the odd transform sums over positive singular values; the even right and left transforms sum on their singular-vector bases and use on the respective kernels.
Projected-unitary encoding and singular vectors: the positive singular pairs satisfy and , and the complete right and left bases identify and .
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.
Adjoints satisfy , , , and : adjoints reverse compositions and preserve sums.
The orthogonal projection is the -component in : each finite-dimensional subspace has a unique orthogonal projection.
Proof
For each distinct positive singular value , define in and in . The adjoint rule [F4] and adjoint algebra [F5] make and self-adjoint, and [F2]–[F3] identify these eigenspaces with the right and left singular subspaces. If , then because . Also [F4] gives . Thus is an isometry from into . For , [F5] gives , and ; hence maps onto .
Group the positive singular terms in the odd transform by their common value . In any orthonormal basis of , the paired left vectors are , so , where is the unique projection from [F6]. The grouped term is therefore , independent of the basis.
For the even right transform, grouping by positive singular value gives , and the zero-singular part is ; both are canonical projections. For the even left transform the corresponding terms are and . 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.
Projector phase operations from controlled reflections
Statement
Let be an orthogonal projection on a finite-dimensional space , with reflection and . Suppose the control-first call is explicitly supplied, together with an ancilla initialized in and exact one-qubit and gates. Then the unitary 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 . If an external branch qubit is present and a branch-controlled 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 and ; 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 , an orthogonal projection , the specified controlled-reflection access, and a clean ancilla qubit.
Orthogonal-Projector Reflection and Access Contract: and ; is on and on .
Controlled Unitary Access: is the control-first unitary, and its availability is explicitly declared.
Projector Reflections Are Hermitian Unitary Involutions: , where acts on the control ancilla.
Exact one-qubit gates and rotations: and are exact one-qubit gates.
Denotational semantics of a finite layered circuit: chronological circuit operations compose in reverse order in the operator product.
Proof
Define the ancilla-controlled bit flip , where . On , , so [L2] makes act as on the ancilla; conjugating by gives . On , , so acts as and is the identity. Thus flips the ancilla exactly on the range of . By [L3], each use of is one supplied call to plus one ancilla gate.
Apply , then , then again. On , the ancilla operation is ; on it is . Acting on , these give phases and , respectively, and both branches return the ancilla to . The induced system operation is therefore .
The construction uses two occurrences of , hence two controlled-reflection calls by step 1.1, and one variable rotation. Its Hadamard and ancilla- gates have constant count per phase slot. Applying the same construction with or gives the two projector-phase operations used by the QSVT sequence; no direct or controlled reflection cost is inferred from the matrix description alone.
Let be an external branch qubit. Replace the middle rotation by its controlled version, leaving both occurrences of unchanged. On branch , step 2.1 gives . On branch , the middle operation is identity and the two adjacent operations cancel because ; 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.
QSVT signal and reflection query counts
Statement
For degree , one un-controlled QSVT sequence makes exactly signal calls: calls to and calls to , beginning with when . It applies exactly projector-phase operations, with about and about . 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 is even and one controlled signal call when 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 there is no signal or controlled-signal call.
Facts & Assumptions
Given: An integer degree and the finite procedure in Quantum singular-value transformation circuit.
Quantum singular-value transformation circuit: the procedure applies one initial phase about , then alternating signal calls, switching sides after each call and applying one phase at the new side.
Projector phase operations from controlled reflections: each projector-phase operation uses two controlled-reflection calls and one variable rotation; an external branch controls only that rotation while leaving both reflection calls unconditional with respect to the branch.
Controlled Unitary Access: a controlled unitary call is an explicitly supplied operation and is charged separately from its uncontrolled call.
Circuit-family and computation cost model: signal queries, controlled calls, one-qubit gates, depth, width, ancillas, and classical generation costs are separate coordinates.
Proof
The loop in [F1] executes once for each integer , hence it makes exactly signal calls. The side starts at , so the first call is and directions alternate; therefore the counts are forward calls and inverse calls. If , the loop is empty.
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 or pairs. If is even all signal calls pair and cancel; if is odd, one forward 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 and one controlled call for odd , whose availability is explicit by [F3].
For a branch selector between and , let control value select and value select . At a slot with phase about , use the clean-ancilla toggle from step 1.1 of [F2], then unconditional , then a control-one-controlled , and then again. The middle rotation is in branch and in branch ; because flips the ancilla on and leaves it unchanged on , the system phases are respectively and . 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.
There is one phase at the initial side and one after each of the signal calls, for slots. Their sides alternate beginning at , giving right-projector slots and left-projector slots.
Apply [F2] to each slot counted in step 2.2. The total controlled-reflection calls are for and for , unchanged for the paired selector. A single unconditioned sequence has variable rotations; the selector instead uses unconditional rotations and separately charged branch-controlled rotations , with constant one-qubit overhead per slot.
The counts above describe only the listed operations. By [F4], the cost of supplied , , 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 alone.
QSVT action on singular subspaces
Statement
Let be the PUE map of Projected-unitary encoding and singular vectors, with positive singular pairs , and let be the exact phase list in Quantum singular-value transformation circuit. Let 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 . Consequently, if is odd,
and if is even,
The formulas include singular values and , repeated singular values, unmatched left and right kernels, and zero-dimensional singular spaces. If is zero or has degree at most , has parity , and satisfies on , the exact completion and phase-factorization suppliers give a phase list with . The coherent / branch then has compressed block ; for a supplied uniform scalar error , its block differs from by at most .
Facts & Assumptions
Given: A PUE, a finite phase list, and the definitions of the singular-value and QSP transforms.
Projected-unitary encoding and singular vectors: is a contraction with an SVD .
PUE singular-space invariant decomposition: for , the basis change is ; the plane collapses and the zero and residual subspaces are specified separately.
QSP signal matrix and ordered phase sequence: , , and .
Unitarity, determinant, and polynomial form of a QSP sequence: the upper-left entry of is a polynomial of parity and degree at most .
Odd and even singular-value transforms: odd transforms act between left and right singular spaces; even transforms act on a singular space and use on its kernel.
Singular-value transform is independent of SVD choices: these transforms are independent of the chosen singular-vector bases.
Completion of a bounded real parity polynomial: every real polynomial of degree at most , parity , and bound on has an admissible complex completion with real part exactly .
Constructive factorization of an admissible QSP polynomial pair: every admissible pair has an exact real phase list for the fixed Hermitian-reflection QSP sequence.
Projector Reflections Are Hermitian Unitary Involutions: is unitary, with eigenvalues on and on .
Hermitian-reflection and SU(2) QSP convention conversion: conversion to the SU(2) convention carries an explicit scalar , which is retained under control.
Projector phase operations from controlled reflections: its clean-ancilla toggle flips on and each toggle uses one controlled-reflection call plus a fixed ancilla gate.
Proof
Fix . In the input basis and output basis , [F2] says that is , and has the same matrix because it is real symmetric. The right-projector phase is on the input basis since has eigenvalues there; the left-projector phase is the same on the output basis. Thus the alternating sequence multiplies in the fixed order , whose upper-left entry is by [F3]–[F4].
If , [F2] gives and the complementary component is zero; the surviving one-dimensional action is the first-coordinate action of , namely . For , lies in and . The alternating calls therefore swap this right-kernel vector and its left-complement image exactly as does. If is odd the final vector lies in and the left compression is zero, equal to because [F4] makes odd. If is even it returns to with coefficient , the prescribed even-kernel term in [F5]. Left-kernel inputs and the residual complement contribute nothing to the stated compression by [F2].
The positive singular planes, the 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.
For real under the stated degree, parity, and interval bounds, [F7] gives an admissible pair with , and [F8] supplies its exact phase list . At each slot with phase about , use the clean-ancilla toggle from [F11], then apply unconditional , then a control-one-controlled , and then again. In control branch the middle rotation is ; in branch it is . Since places the ancilla in on and in on , the induced system phases are respectively and , and the ancilla returns to . The same unconditioned signal calls therefore give full branch operators and . Because is real and , entrywise conjugation gives , and projection of the control from to has block . By step 2.1, its coefficient on each positive singular pair is ; for an even transform the same identity gives on . Thus the compressed block is . If the supplied scalar approximation satisfies , 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.
Operator perturbation bound for QSVT
Statement
Let be contractions between the same finite-dimensional complex-inner-product spaces, let be the scalar polynomial of an exact degree- QSVT phase sequence, and put . Then, for the corresponding odd or even singular-value transforms,
For 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 and an exact degree- QSVT phase sequence with scalar polynomial .
Projected-unitary encoding and singular vectors: a PUE compression has singular values in and its finite SVD uses orthonormal left and right bases.
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.
QSVT action on singular subspaces: for any PUE realization of a contraction , the phase sequence's projected block is .
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.
The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: the vector norm satisfies the triangle inequality.
The orthogonal projection is the -component in : range and orthogonal-complement components give the orthogonal decomposition defining a projection.
Pythagoras and finite orthogonal sums: orthogonal components have squared norms that add.
Adjoints satisfy , , , and : adjoints reverse composition and .
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary preserves vector norms.
Proof
If either or is zero, both maps are zero and the odd transforms agree; when the even right transforms are also the same scalar map on the zero space, and when the even right transforms are for both. The inequality is then immediate. Assume both dimensions are positive. Let , , , and extend an SVD of any contraction to orthonormal bases and , with for any missing singular values up to .
On , choose orthonormal input bases in the first summand and in the second, and output bases and in the two summands. For , define and . These two images are orthonormal by direct expansion; map any remaining to the corresponding unused , and any remaining to the corresponding unused . The resulting images form an orthonormal basis, so is unitary. If projects onto the second summand and onto the first, then by the SVD formula. Thus every finite contraction has a PUE unitary completion with fixed subspaces of dimensions .
Let and set . Homogeneity of the operator norm gives , so is a contraction. By step 1.2, choose unitary completions of on the same with the same projectors . On , let and let select the right and left subspaces, respectively, in the first copy only. Put , , and ; makes unitary. For in the first-copy right subspace, , maps this to , and returns first component . Projection to the first-copy left subspace therefore gives . Since and are unitary, [F8]–[F9] show is unitary; it is a PUE completion of for the same projectors.
Direct multiplication gives , hence . With , the inequality follows from , so . For every unit , write . By [F10], and preserve norms; the two summands therefore have norms at most . Using [F5] and [F4] gives .
The exact QSVT phase product contains signal factors, each either or ; its remaining phase factors are identical for and . Telescoping the two products one signal factor at a time gives operator-norm difference at most : the factor differences for have that norm, and for the identity 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 and . Steps 2.1 and 3.1 therefore give .
For the second comparison, use step 1.2 to choose completions of and the zero map on the same , and put . With the same projectors and the same from step 2.1, compresses to , while compresses to . The calculation of step 3.1 gives ; the telescoping and compression argument of step 4.1 therefore gives . Combining this with step 4.1 by the triangle inequality proves the asserted bound. If the two transforms are identical, and if the transform is independent of the input; both cases satisfy the same bound.
Real bounded polynomial extraction in QSVT
Statement
Let be a finite PUE map and let have degree at most , parity , and on . The exact real-polynomial completion and phase-factorization results give a phase list whose scalar QSP polynomial satisfies . Run the degree- 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 for odd , and exactly for even , including the even value on . The result includes , zero and unit singular values, repeated values, and unmatched kernels.
The two branches share the same unconditioned alternating calls to and . Each of the 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 , an integer , and a real polynomial with the stated degree, parity, and interval bound.
Completion of a bounded real parity polynomial: such a has a QSP-admissible pair with exactly.
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.
QSP signal matrix and ordered phase sequence: is real and , with .
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.
Projector phase operations from controlled reflections: the clean-ancilla toggle flips exactly on and is implemented with one controlled-reflection call plus a fixed ancilla gate.
Quantum singular-value transformation circuit: the chronological procedure alternates the supplied and calls, switching the projected side after each call, and interleaves the declared projector phases.
QSVT signal and reflection query counts: a degree- sequence has signal calls and projector-phase slots; the selector shares the signal list and uses one unconditional and one branch-controlled rotation per slot.
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 form an orthonormal basis of .
Controlled Unitary Access: a controlled operation is explicitly supplied and separately costed.
Denotational semantics of a finite layered circuit: chronological circuit layers compose in reverse order in the denoted operator product.
Proof
By [F1], choose a QSP-admissible pair with . By [F2], choose a phase list whose ordered signal product has upper-left entry . The real part identity is therefore exact for every real .
Let control value select and value select . In each slot with phase about , apply the toggle from [F5], then unconditional , then a control-one-controlled , and then again. In branch the middle rotation is ; in branch it is . The toggle places the clean ancilla in on and in on , so the two system phases are and , respectively, with the ancilla returned to . 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 and . Projecting to gives their arithmetic mean, since for each .
Since each entry of is real and , entrywise conjugation of the ordered product in [F3] gives . Thus its upper-left polynomial is for every .
Fix a positive singular pair . By [F4], the two branch compressions contribute coefficients and . Their mean is by steps 1.1–2.1. For even , [F4] gives the same mean on each vector in ; for odd , and the output block annihilates that kernel. Thus the averaged compression has exactly the stated singular-value transform on all of .
There are alternating signal positions and 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 plus one branch-controlled . By [F9], the controlled rotations and reflection calls are supplied and costed separately. For , there is one paired phase slot and no signal call, so the same count applies.
QSVT robustness, approximation error, and resources
Statement
Let be a finite square or rectangular matrix with a declared isometric padding , and let satisfy . Let be the exact compressed PUE block of the supplied input unitary and assume
Let be the degree- parity polynomial of an admissible QSVT phase sequence, and let have the same parity. Put , so zero is included even when the two matrix dimensions differ. If , and the implemented phase operation at slot is a unitary within operator-norm error of its ideal operation, then the implemented compressed block satisfies
The exact sequence uses calls alternating between and , 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- phase sequence, a uniform scalar approximation bound, and unitary phase implementations with the stated errors.
Finite block encoding: an block encoding has normalized compression within of the declared padded target divided by , with .
Odd and even singular-value transforms: odd and even singular-value transforms are defined by their SVD coefficients, including the even kernel term.
Operator perturbation bound for QSVT: for contractions , .
QSVT signal and reflection query counts: the exact sequence has signal calls, phase slots, and the corresponding right/left reflection counts.
Circuit-family and computation cost model: oracle queries, controlled calls, gates, depth, width, ancillas, classical generation, and precision are separate cost coordinates.
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.
The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: the vector norm satisfies the triangle inequality.
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.
The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2: compatible finite-dimensional maps satisfy .
QSVT action on singular subspaces: the ideal QSVT sequence for block compresses to .
Projected-unitary encoding and singular vectors: a projected-unitary compression is a contraction.
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: each isometric padding map preserves vector norms.
Adjoints satisfy , , , and : adjoints reverse products and preserve sums.
The orthogonal projection is the -component in : a vector and its projection-complement components are orthogonal.
Pythagoras and finite orthogonal sums: orthogonal components have squared norms that add.
Proof
Let be the declared isometric padding maps in [F1], so and . Put . By [L3]–[L4], ; [L5] makes it an orthogonal projection, and [L6] gives . The adjoint identity [L3] then yields . Since both padding maps preserve norms by [L2], [F9] gives ; conversely for every , so taking maxima over unit vectors gives equality. Thus is a contraction. The PUE compression is a contraction by [L1], and [F1] gives . Applying [F3] gives .
Choose the SVD bases of from [F8]. For odd parity, the difference sends each right singular vector to and annihilates . Orthonormality gives, for , . For even parity the same bound follows by diagonal action on the right singular basis, including on the kernel. Taking the maximum over unit vectors by [F6] yields .
Replace the ideal phase operations one slot at a time by their implemented unitaries. The product difference is a sum of 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 ; [F7] and [F6] then give . 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 by [F10].
The implemented block differs from 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 . 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
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Definitions 11–12
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 §29.3
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Definitions 11–14 and Lemma 14
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Definition 16
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 §§29.2–29.3
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Definitions 15 and Lemma 19
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Definitions 12 and 16, Theorem 17
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Lemma 19 and Figure 1
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Theorem 17 and Corollary 18
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Lemma 22
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Corollary 18
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Lemmas 22–23 and Lemma 19