Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2401.17182

Detailed Error Analysis of the HHL Algorithm

Xinbo Li Christopher Phillips

Published Jan 30, 2024• 3 citations
arXivHTMLPDF

Abstract

We reiterate the contribution made by Harrow, Hassidim, and Llyod to the quantum matrix equation solver with the emphasis on the algorithm description and the error analysis derivation details. Moreover, the behavior of the amplitudes of the phase register on the completion of the Quantum Phase Estimation is studied. This study is beneficial for the comprehension of the choice of the phase register size and its interrelation with the Hamiltonian simulation duration in the algorithm setup phase.

DOI
10.48550/arxiv.2401.17182

Related papers

On the Phase Estimation Amplitudes in the Quantum Matrix Equation Solver

Xinbo Li, Christopher Phillips, Ian Jeffrey +1 more

The phase estimation amplitude in the quantum matrix equation solver, namely the Harrow/Hassidim/Lloyd (HHL) algorithm is studied in this work. It is the periodic behavior of the amplitude with respect to the eigenvalue estimation error indicates the choice of the simulation time. The impact of the initial states on the quantum phase estimation (QPE) is also provided. This work is expected to be instructive for the formulation of the error analysis in HHL variants.

IEEE Conference on Electrical Performance of Electronic Packaging and Systems (EPEPS)•Oct 15, 2023•0 citations

Formal Computer Validation of the Quantum Phase Estimation Algorithm

Wayne M. Witzel, Kenneth Rudinger, Mohan Sarovar +1 more

Bulletin of the American Physical Society•Mar 15, 2016•0 citations

A Quantum-Walk-Unitary HHL Matrix Equation Solver and Its Challenges in the NISQ Era

Xinbo Li, Christopher Phillips, Ian Jeffrey +1 more

The Harrow/Hassidim/Lloyd algorithm is a celebrated quantum matrix equation solver. Its Hamiltonian simulation involves a quantum walk process. A newly developed Quantum Walk Unitary HHL (QWU-HHL) leverages the spectral relationship between the quantum walk operator and the system matrix, and uses the quantum walk operator as its unitary in the phase estimation directly, allowing Hamiltonian simulation in the classical HHL to be removed, hence improving its efficiency. Despite the potential of being exponentially faster than classical matrix equation solvers, HHL is not feasible in the noisy intermediate-scale quantum era because its quantum circuit is too deep to preserve an accurate solution. In this work, we investigate the error behavior of QWU-HHL on a 7-qubit quantum system. Instead of executing the entire circuit, the behaviors of its sub-circuits which each contain only an initialization and a single gate are recorded. The error caused by isolated initialization and operation are analyzed.

IEEE MTT-S International Microwave Symposium digest•Jun 11, 2023•1 citation

Overview and Experimental Analysis of the HHL Quantum Algorithm

Dominik Pawelec, Jakub Blukacz, Hubert Siewiera +2 more

Lecture notes in networks and systems•Jan 1, 2026•1 citation

Quantum linear systems algorithms: a primer

Danial Dervovic, Mark Herbster, Peter Mountney +3 more

The Harrow-Hassidim-Lloyd (HHL) quantum algorithm for sampling from the solution of a linear system provides an exponential speed-up over its classical counterpart. The problem of solving a system of linear equations has a wide scope of applications, and thus HHL constitutes an important algorithmic primitive. In these notes, we present the HHL algorithm and its improved versions in detail, including explanations of the constituent sub- routines. More specifically, we discuss various quantum subroutines such as quantum phase estimation and amplitude amplification, as well as the important question of loading data into a quantum computer, via quantum RAM. The improvements to the original algorithm exploit variable-time amplitude amplification as well as a method for implementing linear combinations of unitary operations (LCUs) based on a decomposition of the operators using Fourier and Chebyshev series. Finally, we discuss a linear solver based on the quantum singular value estimation (QSVE) subroutine.

arXiv:1802.08227•Feb 22, 2018•140 citations

Performance Analysis of the HHL Algorithm on the Odra 5 Quantum Computer

Andrzej A. Kucharski, Mateusz Kucharski

Lecture notes in computer science•Sep 20, 2026•0 citations
We reiterate the contribution made by Harrow, Hassidim, and Llyod to the quantum matrix equation solver with the emphasis on the algorithm description and the error analysis derivation details. Moreover, the behavior of the amplitudes of the phase register on the completion of the Quantum Phase Estimation is studied. This study is beneficial for the comprehension of the choice of the phase register size and its interrelation with the Hamiltonian simulation duration in the algorithm setup phase.
The Harrow/Hassidim/Lloyd algorithm is a celebrated quantum matrix equation solver. Its Hamiltonian simulation involves a quantum walk process. A newly developed Quantum Walk Unitary HHL (QWU-HHL) leverages the spectral relationship between the quantum walk operator and the system matrix, and uses the quantum walk operator as its unitary in the phase estimation directly, allowing Hamiltonian simulation in the classical HHL to be removed, hence improving its efficiency. Despite the potential of being exponentially faster than classical matrix equation solvers, HHL is not feasible in the noisy intermediate-scale quantum era because its quantum circuit is too deep to preserve an accurate solution. In this work, we investigate the error behavior of QWU-HHL on a 7-qubit quantum system. Instead of executing the entire circuit, the behaviors of its sub-circuits which each contain only an initialization and a single gate are recorded. The error caused by isolated initialization and operation are analyzed.
The Harrow-Hassidim-Lloyd (HHL) quantum algorithm for sampling from the solution of a linear system provides an exponential speed-up over its classical counterpart. The problem of solving a system of linear equations has a wide scope of applications, and thus HHL constitutes an important algorithmic primitive. In these notes, we present the HHL algorithm and its improved versions in detail, including explanations of the constituent sub- routines. More specifically, we discuss various quantum subroutines such as quantum phase estimation and amplitude amplification, as well as the important question of loading data into a quantum computer, via quantum RAM. The improvements to the original algorithm exploit variable-time amplitude amplification as well as a method for implementing linear combinations of unitary operations (LCUs) based on a decomposition of the operators using Fourier and Chebyshev series. Finally, we discuss a linear solver based on the quantum singular value estimation (QSVE) subroutine.