We present a simplified exposition of some pieces of [Gily\'en, Su, Low, and Wiebe, STOC'19, arXiv:1806.01838], who 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）框架。QSVT框架近来引起了量子算法界的广泛关注，因为 [GSLW19] 证明了它能自然涵盖许多以矩阵函数应用形式表述的现有算法。首先，我们提出：将量子奇异值处理（QSP）提升至 QSVT 的过程，更适宜理解为余弦-正弦分解（可视为约旦引理更明确且更强的版本）的应用，而非如 [GSLW19] 所建议的约旦引理。其次，我们证明 [GSLW19] 中利用傅里叶分析、切比雪夫级数和泰勒级数等多种特定方法构造的有界多项式逼近，可统一于切比雪夫级数截断框架下，并且实际上能通过 [Trefethen，2013] 中标准元定理的有界变体在很大程度得以匹配。我们期望本工作能作为理解与应用 [GSLW19] 强大框架的配套指南，为学界提供参考。