[论文解读] Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Parikshit Pareek, Abhijith Jayakumar+2 more|arXiv (Cornell University)|Feb 13, 2024

Electrochemical Analysis and ApplicationsChemistry被引用 3

一句话总结

本文批判性评估了基于HHL的量子线性系统求解器在量子潮流（QPF）中的实际量子优势（PQA），表明端到端复杂度分析显示，对于标准的直流潮流（DCPF）和快速解耦潮流（FDLF）问题，不存在指数级加速。研究识别出一个狭窄的参数范围——特别是极低条件数和极低读出需求——在此范围内仅可能实现次二次加速，从而对电力系统分析中广泛实现量子优势的可行性提出质疑。

ABSTRACT

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. We investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

研究动机与目标

• 评估使用量子线性系统求解器求解潮流问题的实际可行性。
• 将基于HHL的量子潮流（QPF）算法的端到端复杂度与共轭梯度（CG）等经典方法进行比较。
• 识别出针对DCPF型问题，实际量子优势（PQA）可能出现的具体条件。
• 评估系统规模、条件数和读出需求对量子与经典求解器运行时间复杂度的影响。
• 通过考虑现实的输入/输出开销，挑战量子算法在电力系统应用中普遍存在的指数级加速假设。

提出的方法

• 作者对基于HHL的QPF执行了端到端复杂度分析，将总运行时间分解为状态准备（T_b）、量子模拟（T_s）和读出（T_r）三个部分。
• 将运行时间建模为O(T_r × κ(T_b + T_s))，其中κ为条件数，并考虑了QRAM支持（T_b = log N）和非QRAM（T_b = N）两种输入准备场景。
• 将量子复杂度O(N²κ/ε + N log N κ²s²/ε²)与经典共轭梯度（CG）复杂度O(N².⁵)进行比较，后者基于PGLib电力系统上的经验拟合得出。
• 通过识别量子复杂度低于经典复杂度的参数范围（κ, D, N），推导出PQA的理论边界，并利用图5映射PQA区域。
• 研究评估了预处理技术的必要性，以降低κ，并将读出限制在D个经典值（例如D=10）以内，以最小化测量开销。
• 通过PGLib基准套件中的真实世界电力系统数据验证了其发现，确保与实际电网应用的相关性。

Figure 1: Power network data, equivalent linear system of equations, and the idea of practical quantum advantage (PQA). Left: Consider a simplified power grid with four “buses” (nodes) connected by five “branches” (lines). Each line has a certain “susceptance” which affects how easily electricity fl

实验结果

研究问题

• RQ1 在求解直流潮流（DCPF）问题时，基于HHL的量子算法在何种条件下可实现相对于经典共轭梯度方法的实际量子优势（PQA）？
• RQ2 潮流矩阵的条件数（κ）如何影响QPF算法中量子加速的可行性？
• RQ3 读出需求（D）对量子潮流求解器端到端运行时间复杂度有何影响？
• RQ4 为何在考虑端到端复杂度时，QPF中最初声称的指数级量子加速会失效？
• RQ5 在系统规模较大且矩阵属性非理想的真实电力系统场景中，预处理技术能否实现PQA？

主要发现

• 对于标准的DCPF和快速解耦潮流（FDLF）问题，基于HHL的量子潮流算法的运行时间复杂度高于经典共轭梯度（CG）方法，尤其在系统规模N > 500母线时更为显著。
• 基于HHL的QPF的端到端复杂度在完整状态读出时呈O(N⁵.⁵)量级，远差于PGLib系统中经典CG的O(N².⁵)量级。
• 仅当通过预处理降低条件数（κ）且所需经典输出数量（D）被限制为系统规模的极小部分时，实际量子优势（PQA）才在理论上可能实现。
• 即使在最小读出需求（D=10）下，若不将κ降低至真实电力网络中通常观测到的值以下，PQA在标准PGLib系统中仍无法实现。
• 分析表明，任何潜在的PQA均局限于次二次加速，而非指数级加速，且需同时满足低条件数和低读出开销。
• 本研究得出结论：在典型电力系统参数下，基于HHL的QPF并不具备实际优势，从而削弱了在潮流计算中广泛存在量子优势的主张。

Figure 3: Network properties of the PGLib [ 35 ] power transmission network datasets reveal structural insights and potential numerical challenges in solving DCPF. Left: Level of sparsity ( $s$ ) for different power system size ( $N$ -Buses). Here, average sparsity is the average number of non-zero