An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications
arXiv:2404.19067 · doi:10.3390/a18080491
Abstract
In this paper, we explore using the Harrow-Hassidim-Lloyd (HHL) algorithm to address scientific and engineering problems through quantum computing, utilizing the NWQSim simulation package on a high-performance computing platform. Focusing on domains such as power-grid management and climate projection, we demonstrate the correlations of the accuracy of quantum phase estimation, along with various properties of coefficient matrices, on the final solution and quantum resource cost in iterative and non-iterative numerical methods such as the Newton--Raphson method and finite difference method, as well as their impacts on quantum error correction costs using the Microsoft Azure Quantum resource estimator. We summarize the exponential resource cost from quantum phase estimation before and after quantum error correction and illustrate a potential way to reduce the demands on physical qubits. This work lays down a preliminary step for future investigations, urging a closer examination of quantum algorithms' scalability and efficiency in domain applications.
arXiv comment21 pages, 8 figures
References in corpus (32)
- Quantum Computing in the NISQ era and beyond
- Quantum algorithm for solving linear systems of equations
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Hamiltonian Simulation by Qubitization
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Architectures for a quantum random access memory
- Preconditioned quantum linear system algorithm
- Efficient quantum algorithm for dissipative nonlinear differential equations
- Quantum Circuits for Isometries
- Quantum algorithms and the finite element method
- Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
- Quantum gradient descent for linear systems and least squares
- High-precision quantum algorithms for partial differential equations
- Encoding a magic state with beyond break-even fidelity
- Towards provably efficient quantum algorithms for large-scale machine-learning models
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost
- Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- Experimental realization of quantum algorithms for linear system inspired by adiabatic quantum computing
- Enhancing the Quantum Linear Systems Algorithm using Richardson Extrapolation
- FABLE: Fast Approximate Quantum Circuits for Block-Encodings
- Step-by-Step HHL Algorithm Walkthrough to Enhance the Understanding of Critical Quantum Computing Concepts
- Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
- Quantum Computing for Power Flow Algorithms: Testing on real Quantum Computers
- Potential quantum advantage for simulation of fluid dynamics
- Cloud-droplet growth due to supersaturation fluctuations in stratiform clouds
- An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization
- A Quantum Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Early Exploration of a Flexible Framework for Efficient Quantum Linear Solvers in Power Systems