Three block encoding methods are evaluated for solving linear systems of equations using QSVT (Quantum Singular Value Transformation). These are ARCSIN, FABLE and PREPARE-SELECT. The performance of the encoders is evaluated using a suite of 30 test cases including 1D, 2D and 3D Laplacians and 2D CFD matrices. A subset of cases is used to characterise how the degree of the polynomial approximation to $1/x$ influences the performance of QSVT. The results are used to guide the evaluation of QSVT as the linear solver in hybrid non-linear pressure correction and coupled implicit CFD solvers. The performance of QSVT is shown to be resilient to polynomial approximation errors. For both CFD solvers, error tolerances of $10^{-2}$ are more than sufficient in most cases and in some cases $10^{-1}$ is sufficient. The pressure correction solver allows subnormalised condition numbers, $κ_s$, as low as half the theoretical values to be used, reducing the number of phase factors needed. PREPARE-SELECT encoding relies on a unitary decomposition, e.g. Pauli strings, that has significant classical preprocessing costs. Both ARCSIN and FABLE have much lower costs, particularly for coupled solvers. However, their subnormalisation factors, which are based on the rank of the matrix, can be many times higher than PREPARE-SELECT leading to more phase factors being needed. For both the pressure correction and coupled CFD calculations, QSVT is more stable than previous HHL results due to the polynomial approximation errors only affecting long wavelength CFD errors. Given that lowering $κ_s$ increases the success probability, optimising the performance of QSVT within a CFD code is a function of the number QSVT phase factors, the number of non-linear iterations and the number of shots. Although phase factor files can be reused, the time taken to generate them impedes scaling QSVT to larger test cases.
A QSVT-Based Quantum Jacobi Algorithm for Linear Systems with Application to the Poisson Equation
Volkswagen AG(大众汽车集团);Institute for Partial Differential Equations, Technical University Braunschweig(布伦瑞克工业大学偏微分方程研究所);Institute for Aerodynamics and Flow Technology, German Aerospace Center (DLR)(德国航空航天中心(DLR)空气动力学与流动技术研究所);School of Mathematical and Physical Sciences, University of Sheffield(谢菲尔德大学数学与物理科学学院)
Center on Frontiers of Computing Studies, Peking University(北京大学前沿计算研究中心);School of Computer Science, Peking University(北京大学计算机学院);SKLMS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院数学领域国家重点实验室);CQST and CSTAR, International Institute of Information Technology Hyderabad(印度海得拉巴国际信息技术学院量子科学与工程中心及理论计算机科学与应用研究组)
When is randomization advantageous in quantum simulation?
European Organization for Nuclear Research (CERN)(欧洲核子研究组织(CERN));Leiden University(莱顿大学);University of Milano Bicocca(米兰比可卡大学);INFN - Milano Bicocca(意大利国家核物理研究所-米兰比可卡分部);Google Quantum AI(谷歌量子人工智能);Department of Nuclear and Particle Physics, University of Geneva(日内瓦大学核与粒子物理系);IQM Quantum Computers(IQM量子计算机)
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生物制剂人工智能)
Block encoding of sparse matrices with a periodic diagonal structure
Politecnico di Milano(米兰理工大学);Fondazione Istituto Italiano di Tecnologia(意大利技术研究院基金会);Università di Trieste(的里雅斯特大学);University of Trento(特伦托大学);INFN-TIFPA(INFN-特伦托基础物理与应用研究所)
Explicit block-encodings for biharmonic boundary-value problems
School of Mathematical Sciences, East China Normal University(华东师范大学数学科学学院);Key Laboratory of MEA, Ministry of Education, East China Normal University(华东师范大学教育部MEA重点实验室);Shanghai Key Laboratory of PMMP, East China Normal University(华东师范大学上海PMMP重点实验室);School of Mathematical Sciences, Shanghai Jiao Tong University(上海交通大学数学科学学院)
Quantum Algorithm for Low-Energy Effective Hamiltonians and Subspace Eigenvalue Problem
University of Southern California(南加州大学);Hon Hai (Foxconn) Quantum Computing Research Center(鸿海(富士康)量子计算研究中心);Institute of Physics, Academia Sinica(中央研究院物理研究所);National Taiwan University(台湾大学)
Asymmetric Linear-Combination-of-Unitaries Realization of Quantum Convolution via Modular Adders
Kyushu University(九州大学);Fukui Institute for Fundamental Chemistry, Kyoto University(京都大学福井基础化学研究所);Nagoya University(名古屋大学);National Research Council Canada(加拿大国家研究委员会);Keio University(庆应义塾大学)