The Variational Quantum Linear Solver (VQLS), a hybrid quantum-classical algorithm for solving linear systems, faces a practical scalability bottleneck: the Linear Combination of Unitaries (LCU) decomposition requires
O(L2) circuit evaluations per optimizer iteration, where
L can grow to
4n in the worst case for an
n-qubit system. We address this computational bottleneck through two complementary strategies. First, we present a distributed VQLS (D-VQLS) framework (https://code.ornl.gov/olcf-qcfd/DVQLS.git), built on NVIDIA CUDA-Q, that enables asynchronous, scalable distribution of the
O(L2) cost evaluations. Second, a fast Walsh--Hadamard transform (FWHT)-based Pauli decomposition with coefficient-amplitude pruning threshold
τ=0.01 curbs LCU growth for the structured Toeplitz family, reducing
L from
O(2n) to 64 for
n>6 and compressing the circuit complexity per optimizer iteration from
O(n4n) to
O(n). We derive the exact top-
L Frobenius error and connect it to worst-case solution error. For a 10-qubit tridiagonal Toeplitz system, the
L=64 pruning yields a
256× reduction---from 23 million to 90k circuits per optimizer iteration.
The D-VQLS framework is validated on the NERSC Perlmutter supercomputer using multi-node, multi-GPU ideal state-vector simulations, achieving over
99.99% fidelity against classical solutions on tridiagonal Toeplitz and Hele--Shaw flow benchmarks, with near-ideal strong scaling up to 24 GPUs and
95.3% weak scaling efficiency at 96 GPUs processing more than 360k circuits per optimizer iteration (from larger-
L pruning) for the 10-qubit system. Systematic profiling identifies the optimal resource allocation for distributed quantum circuit workloads, yielding a
2.52× speedup for the configurations studied.
The Newton-Raphson method, despite its quadratic convergence, faces a growing performance bottleneck in solving high-dimensional sparse linear systems as power grid scale and complexity increase. This paper proposes a hybrid classical-quantum Newton-Raphson framework for power flow computation. On the classical side, the polar-coordinate Newton-Raphson iteration and Jacobian assembly are retained; on the quantum side, Krylov subspace reduction is coupled with a variational quantum linear solver (VQLS) to solve the projected low-dimensional linear system. A residual-driven nested iterative refinement strategy and the parameter shift rule are introduced to ensure solution accuracy and gradient efficiency, respectively. Due to current quantum chip hardware constraints, five physical qubits with relatively high fidelity are selected for validation on the domestically developed Origin Wukong superconducting quantum processor. The IEEE 57-bus system (106-dimensional Jacobian) and the Hefei 81-bus regional grid system (141-dimensional) both converge within three Newton iterations with maximum power mismatch below
1×10−3; voltage relative errors are under
1×10−5for the 57 -bus case and under
1×10−3for the 81-bus case. These results demonstrate that the hybrid architecture can deliver accurate power flow solutions under NISQ-era hardware constraints.
Finding the solution to linear systems is at the heart of many applications in science and technology. Over the years, a number of algorithms have been proposed to solve this problem on a digital quantum device, yet most of these are too demanding to be applied to the current noisy hardware. In this work, an original algorithmic procedure to solve the quantum linear system problem (QLSP) is presented, which combines ideas from variational quantum algorithms and the framework of classical shadows. The result is the shadow quantum linear solver (SQLS), a quantum algorithm solving the QLSP while avoiding the need for large controlled unitaries and requiring a number of qubits that is logarithmic in the system size. In particular, our heuristics show an exponential advantage of the SQLS in circuit execution per cost function evaluation when compared with other notorious variational approaches to solving linear systems of equations. We test the convergence of the SQLS on a number of linear systems, and the results highlight how the theoretical bounds on the number of resources used by the SQLS are conservative. Finally, we apply this algorithm to a physical problem of practical relevance by leveraging decomposition theorems from linear algebra to solve the discretized Laplace equation in a two-dimensional grid.
Solving linear systems is at the foundation of many algorithms. Recently, quantum linear system algorithms (QLSAs) have attracted great attention since they converge to a solution exponentially faster than classical algorithms in terms of the problem dimension. However, low-complexity circuit implementations of the oracles assumed in these QLSAs constitute the major bottleneck for practical quantum speed-up in solving linear systems. In this work, we focus on the application of QLSAs for linear systems that are expressed as a low rank tensor sums, which arise in solving discretized PDEs. Previous works uses modified Krylov subspace methods to solve such linear systems with a per-iteration complexity being polylogarithmic of the dimension but with no guarantees on the total convergence cost. We propose a quantum algorithm based on the recent advances on adiabatic-inspired QLSA and perform a detailed analysis of the circuit depth of its implementation. We rigorously show that the total complexity of our implementation is polylogarithmic in the dimension, which is comparable to the per-iteration complexity of the classical heuristic methods.
Different hybrid quantum-classical algorithms have recently been developed as a near-term way to solve linear systems of equations on quantum devices. However, the focus has so far been mostly on the methods, rather than the problems that they need to tackle. In fact, these algorithms have been run on real hardware only for problems in quantum physics, such as Hamiltonians of a few qubits systems. These problems are particularly favorable for quantum hardware, since their matrices are the sum of just a few unitary terms and since only shallow quantum circuits are required to estimate the cost function. However, for many interesting problems in linear algebra, it appears far less trivial to find an efficient decomposition and to trade it off with the depth of the cost quantum circuits. A first simple yet interesting instance to consider are tridiagonal systems of equations. These arise, for instance, in the discretization of one-dimensional finite element analyses. This work presents a method to solve a class of tridiagonal systems of equations with the variational quantum linear solver (VQLS), a recently proposed variational hybrid algorithm for solving linear systems. In particular, we present a new decomposition for this class of matrices based on both Pauli strings and multi--qubit gates, resulting in less terms than those obtained by just using Pauli gates. Based on this decomposition, we discuss the tradeoff between the number of terms and the near-term implementability of the quantum circuits. Furthermore, we present the first simulated and real-hardware results obtained by solving tridiagonal linear systems with VQLS, using the decomposition proposed.
This paper presents a hybrid quantum–classical framework for power flow analysis of the IEEE 30-Bus system using the Variational Quantum Linear Solver (VQLS). While fault-tolerant quantum algorithms such as HHL offer theoretical advantages, their practical implementation remains limited by issues such as state preparation and circuit complexity. To address these challenges, this study adopts VQLS, which is more suitable for Noisy Intermediate-Scale Quantum (NISQ) devices. The linearized power flow equations are reformulated into a quantum-compatible form and solved through a hybrid optimization process that combines parameterized quantum circuits with classical optimization. The framework is implemented using Qiskit and Pandapower and evaluated under both normal operating conditions and N-1 contingency scenarios. The results show that the VQLS-based solver can achieve stable convergence of the cost function. Although convergence becomes slower under line-outage conditions, the algorithm remains capable of approaching a feasible solution. These results indicate that hybrid quantum–classical methods may provide a promising direction for future power system analysis.