arXiv Analytics

Sign in

arXiv:2205.06261 [quant-ph]AbstractReferencesReviewsResources

Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle

Zane M. Rossi, Isaac L. Chuang

Published 2022-05-12Version 1

Recent work shows that quantum signal processing (QSP) and its multi-qubit lifted version, quantum singular value transformation (QSVT), unify and improve the presentation of most quantum algorithms. QSP/QSVT characterize the ability, by alternating ans\"atze, to obliviously transform the singular values of subsystems of unitary matrices by polynomial functions; these algorithms are numerically stable and analytically well-understood. That said, QSP/QSVT require consistent access to a single oracle, and say nothing about computing joint properties of two or more oracles; these can be far cheaper to compute given the ability to pit oracles against one another coherently. This work introduces a corresponding theory of QSP over multiple variables: M-QSP. Surprisingly, despite the non-existence of the fundamental theorem of algebra for multivariable polynomials, there exist necessary and sufficient conditions under which a desired stable multivariable polynomial transformation is possible. Moreover, the classical subroutines used by QSP protocols survive in the multivariable setting for non-obvious reasons. Up to a well-defined conjecture, we give proof that the family of achievable multivariable transforms is as loosely constrained as could be expected. M-QSP is numerically stable and inherits the approximative efficiency of its single-variable analogue; however, its underlying theory is substantively more complex. M-QSP provides one bridge from quantum algorithms to a rich theory of algebraic geometry over multiple variables. The unique ability of M-QSP to obliviously approximate joint functions of multiple variables coherently leads to novel speedups incommensurate with those of other quantum algorithms.

Related articles: Most relevant | Search more
arXiv:0908.1657 [quant-ph] (Published 2009-08-12)
On zeros of exponential polynomials and quantum algorithms
arXiv:quant-ph/0509052 (Published 2005-09-07)
Implications of the Luders Postulate for Quantum Algorithms
arXiv:1209.3917 [quant-ph] (Published 2012-09-18, updated 2013-10-10)
The Topology of Quantum Algorithms