块编码(Block Encoding,BE)是许多现代量子算法中的关键子程序,包括那些以近最优复杂度模拟量子多体系统的算法,而这些算法通常依赖量子信号处理(Quantum Signal Processing,QSP)。目前,构造BE的主要方法是酉算子线性组合(Linear Combination of Unitaries,LCU)和稀疏预言机方法。在本工作中,我们证明基于QSP的技术,例如量子奇异值变换(Quantum Singular Value Transformation,QSVT)和酉矩阵量子特征值变换(Quantum Eigenvalue Transformation for Unitary Matrices,QETU),本身可以高效用于BE实现。具体而言,我们给出若干使用QSVT和QETU算法及其组合来对晶格玻色子哈密顿量进行块编码的示例,这类哈密顿量是高能物理模拟中的必要组成部分。我们还介绍了一种直接的BE方法,其基础是通过指数化和LCU精确实现线性算子(Linear Operators Via Exponentiation and LCU,LOVE-LCU)。我们发现,尽管使用QSVT进行BE在随每格点量子比特数变化的渐近门数量标度上表现最佳,但对于作用于至多约11个量子比特的算子,LOVE-LCU优于所有其他方法,这突出了具体电路构造相对于仅比较渐近标度的重要性。利用LOVE-LCU实现BE,我们使用广义QSP算法模拟了晶格φ⁴理论中单格点和双格点系统的时间演化,并将门数量与Trotter模拟所需的门数量进行了比较。
英文摘要:
Block Encoding (BE) is a crucial subroutine in many modern quantum algorithms, including those with near-optimal scaling for simulating quantum many-body systems, which often rely on Quantum Signal Processing (QSP). Currently, the primary methods for constructing BEs are the Linear Combination of Unitaries (LCU) and the sparse oracle approach. In this work, we demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU), can themselves be efficiently utilized for BE implementation. Specifically, we present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons, an essential ingredient in simulations of high-energy physics. We also introduce a straightforward approach to BE based on the exact implementation of Linear Operators Via Exponentiation and LCU (LOVE-LCU). We find that, while using QSVT for BE results in the best asymptotic gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to $\lesssim11$ qubits, highlighting the importance of concrete circuit constructions over mere comparisons of asymptotic scalings. Using LOVE-LCU to implement the BE, we simulate the time evolution of single-site and two-site systems in the lattice $φ^4$ theory using the Generalized QSP algorithm and compare the gate counts to those required for Trotter simulation.
Practical block encodings of matrix polynomials that can also be trivially controlled
Technical University of Munich(慕尼黑工业大学);KU Leuven, University of Leuven(荷语鲁汶大学);Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室);Google Quantum AI(谷歌量子人工智能)
TARE: Block Encoding Linear Combinations of Pauli Strings Without Ancilla State Preparation
Fraunhofer-Institut für Arbeitswirtschaft und Organisation IAO(弗劳恩霍夫工作经济与组织研究所);Universität Stuttgart, Institut für Arbeitswissenschaft und Technologiemanagement IAT(斯图加特大学劳动科学与技术管理研究所);Fraunhofer-Institut für Angewandte Festkörperphysik IAF(弗劳恩霍夫应用固体物理研究所);Albert-Ludwigs-Universität Freiburg(弗赖堡阿尔伯特·路德维希大学)
Efficient and Explicit Block Encoding of Finite Difference Discretizations of the Laplacian
Fraunhofer-Institut für Arbeitswirtschaft und Organisation IAO(弗劳恩霍夫工作经济学与组织研究所);Universität Stuttgart Institut für Arbeitswissenschaft und Technologiemanagement IAT(斯图加特大学劳动科学与技术管理研究所)
Unified framework for bosonic quantum information encoding, resources and universality from superselection rules
Université Paris Cité(巴黎西岱大学);CNRS(法国国家科学研究中心);Laboratoire Matériaux et Phénomènes Quantiques(物质与现象量子实验室);Département de Mathématiques et Applications de l’Ecole Normale Supérieure - PSL(巴黎高等师范学院-PSL数学与应用系);Université Paris-Saclay(巴黎萨克雷大学)
Block Encoding of Sparse Matrices via Coherent Permutation
Forschungszentrum Jülich(于利希研究中心);Institute of Quantum Control (PGI-8)(量子控制研究所(PGI-8));Institute for Theoretical Physics, University of Cologne(科隆大学理论物理研究所)
Hermitian Matrix Function Synthesis without Block-Encoding
Centre for Quantum Information, Simulation and Algorithms, University of Western Australia(西澳大学量子信息、模拟与算法中心);Center for Mathematical Modeling, University of Colombo(科伦坡大学数学建模中心);University Paris City and University of Reunion(巴黎城市大学和留尼汪大学);Thayer School of Engineering, Darmouth College(达特茅斯学院塔耶尔工程学院);PEACCEL, AI for Biologics(PEACCEL生物制剂人工智能)