Quantum Signal Processing and Quantum Singular Value Transformation on $U(N)$

Quantum signal processing and quantum singular value transformation are powerful tools to implement polynomial transformations of block-encoded matrices on quantum computers, and has achieved asymptotically optimal complexity in many prominent quantum algorithms. We propose a framework of quantum signal processing and quantum singular value transformation on $U(N)$, which realizes multiple polynomials simultaneously from a block-encoded input, as a generalization of those on $U(2)$ in the original frameworks. We provide a comprehensive characterization of achievable polynomial matrices and give recursive algorithms to construct the quantum circuits that realize desired polynomial transformations. As three example applications, we propose a framework to realize bi-variate polynomial functions, demonstrate $N$-interval decision achieving $O(d)$ query complexity with a $\log_2 N$ improvement over iterative $U(2)$-QSP requiring $O(d\log_2 N)$ queries, and present a quantum amplitude estimation algorithm achieving the Heisenberg limit without adaptive measurements.

💡 Research Summary

This paper presents a comprehensive generalization of the two cornerstone techniques of modern quantum algorithm design—Quantum Signal Processing (QSP) and Quantum Singular‑Value Transformation (QSVT)—from the traditional two‑dimensional unitary setting U(2) to the full N‑dimensional unitary group U(N). The motivation is twofold: (i) the original U(2)‑based frameworks can only embed a single scalar polynomial at a time, which becomes a bottleneck when an algorithm requires several functions to be evaluated simultaneously (e.g., in quantum phase estimation or amplitude estimation), and (ii) extending QSP to multivariate polynomial functions has remained largely unexplored because of the exponential blow‑up in the number of required ancilla qubits and the difficulty of handling non‑commuting variables.

Technical construction
The authors introduce a circuit architecture (Fig. 2) that uses an N‑dimensional ancilla register (typically N = 2ⁿ qubits) together with projector‑controlled unitaries of the form
C_{Π_ℓ}(U) = Π_ℓ ⊗ U + (I − Π_ℓ) ⊗ I,
where Π_ℓ projects onto the computational basis states |0⟩,…,|ℓ − 1⟩. Between successive controlled‑U blocks, arbitrary unitaries R₀,R₁,…,R_d ∈ U(N) act on the ancilla. The depth of the circuit is d + 1 controlled‑U calls, matching the degree of the target polynomial matrix.

Main theoretical results

• Lemma 3 (forward direction) shows by induction that after d controlled‑U calls the overall unitary implements a matrix of complex‑valued polynomials {P_{jk}(z)} of degree ≤ d, each entry being a linear combination of powers of the input unitary U.
• Theorem 4 (backward direction) proves the converse: given any polynomial matrix P(z) whose singular values lie in