We present a simplified exposition of some pieces of [Gily\'en, Su, Low, and Wiebe, STOC'19, arXiv:1806.01838], which introduced a quantum singular value transformation (QSVT) framework for applying polynomial functions to block-encoded matrices. The QSVT framework has garnered substantial recent interest from the quantum algorithms community, as it was demonstrated by [GSLW19] to encapsulate many existing algorithms naturally phrased as an application of a matrix function. First, we posit that the lifting of quantum singular processing (QSP) to QSVT is better viewed not through Jordan's lemma (as was suggested by [GSLW19]) but as an application of the cosine-sine decomposition, which can be thought of as a more explicit and stronger version of Jordan's lemma. Second, we demonstrate that the constructions of bounded polynomial approximations given in [GSLW19], which use a variety of ad hoc approaches drawing from Fourier analysis, Chebyshev series, and Taylor series, can be unified under the framework of truncation of Chebyshev series, and indeed, can in large part be matched via a bounded variant of a standard meta-theorem from [Trefethen, 2013]. We hope this work finds use to the community as a companion guide for understanding and applying the powerful framework of [GSLW19].

翻译：本文对[Gilyén、Su、Low和Wiebe，STOC'19，arXiv:1806.01838]中的部分内容进行了简化阐述。该工作提出了量子奇异值变换（QSVT）框架，用于将多项式函数应用于块编码矩阵。正如[GSLW19]所证明，QSVT框架能够自然地封装许多现有算法（这些算法通常被表述为矩阵函数的应用），因而近年来在量子算法领域引起了广泛关注。首先，我们认为从量子奇异处理（QSP）到QSVT的提升过程，不应像[GSLW19]建议的那样通过Jordan引理来理解，而应视为余弦-正弦分解的应用——该分解可被视为Jordan引理的一种更显式且更强的版本。其次，我们证明[GSLW19]中利用傅里叶分析、切比雪夫级数和泰勒级数等各类特设方法构造有界多项式逼近的方法，可以统一在切比雪夫级数截断框架之下；事实上，这些方法绝大部分可通过[Trefethen，2013]中一个标准元定理的有界变体来匹配。希望本文能作为理解与应用[GSLW19]强大框架的配套指南，为相关领域研究者提供参考。