arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.20823quant-ph
收藏

关于量子信号处理可实现的多变量多项式

On multivariate polynomials achievable with quantum signal processing

Lorenzo Laneve, Stefan Wolf

AI总结:

本研究采用新形式体系,首次为量子信号处理中一般非齐次多变量多项式给出可分解性的充分条件,并简化了必要条件。

摘要:

量子信号处理(QSP)是一个框架,已被证明能够统一和简化大量已知的量子算法,并发现新的算法。QSP允许人们利用多项式来变换嵌入在给定酉算子中的信号。刻画哪些多项式可以通过QSP协议实现是该技术能力的重要组成部分,尽管在单变量信号情形下这种刻画已被充分理解,但当信号是向量而非标量时,哪些多变量多项式可以构造仍不清楚。本工作采用了与文献中略有不同的形式体系,并利用它找到了更简单的可分解性必要条件,以及一个充分条件——据我们所知,这是在量子信号处理背景下针对(一般非齐次的)多变量多项式首次证明的充分条件。

英文摘要:

Quantum signal processing (QSP) is a framework which was proven to unify and simplify a large number of known quantum algorithms, as well as discovering new ones. QSP allows one to transform a signal embedded in a given unitary using polynomials. Characterizing which polynomials can be achieved with QSP protocols is an important part of the power of this technique, and while such a characterization is well-understood in the case of univariate signals, it is unclear which multivariate polynomials can be constructed when the signal is a vector, rather than a scalar. This work uses a slightly different formalism than what is found in the literature, and uses it to find simpler necessary conditions for decomposability, as well as a sufficient condition -- the first, to the best of our knowledge, proven for a (generally inhomogeneous) multivariate polynomial in the context of quantum signal processing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑