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• 0 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

Error convergence of quantum linear system solvers

M. D. Ginzburg, Ugo Marzolino

We analyze the performance of the Harrow-Hassidim-Lloyd algorithm (HHL algorithm) for solving linear problems and of a variant of this algorithm (HHL variant) commonly encountered in literature. This variant relieves the algorithm of preparing an entangled initial state of an auxiliary register. We prove that the computational error of the variant algorithm does not always converge to zero when the number of qubits is increased, unlike the original HHL algorithm. Both algorithms rely upon two fundamental quantum algorithms, the quantum phase estimation and the amplitude amplification. In particular, the error of the HHL variant oscillates due to the presence of undesired phases in the amplitude to be amplified, while these oscillations are suppressed in the original HHL algorithm. Then, we propose a modification of the HHL variant, by amplifying an amplitude of the state vector that does not exhibit the above destructive interference. We also study the complexity of these algorithms in the light of recent results on simulation of unitaries used in the quantum phase estimation step, and show that the modified algorithm has smaller error and lower complexity than the HHL variant. We supported our findings with numerical simulations.

arXiv:2410.18736•Oct 24, 2024•1 citation

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

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

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

Analysis of Quantum Phase Estimation Algorithm Using Quantum Fourier Transform

Priyanka Sharma, Rukhsar Zafar, Amit Kumar Sharma

Lecture notes in electrical engineering•Jan 1, 2025•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.
We analyze the performance of the Harrow-Hassidim-Lloyd algorithm (HHL algorithm) for solving linear problems and of a variant of this algorithm (HHL variant) commonly encountered in literature. This variant relieves the algorithm of preparing an entangled initial state of an auxiliary register. We prove that the computational error of the variant algorithm does not always converge to zero when the number of qubits is increased, unlike the original HHL algorithm. Both algorithms rely upon two fundamental quantum algorithms, the quantum phase estimation and the amplitude amplification. In particular, the error of the HHL variant oscillates due to the presence of undesired phases in the amplitude to be amplified, while these oscillations are suppressed in the original HHL algorithm. Then, we propose a modification of the HHL variant, by amplifying an amplitude of the state vector that does not exhibit the above destructive interference. We also study the complexity of these algorithms in the light of recent results on simulation of unitaries used in the quantum phase estimation step, and show that the modified algorithm has smaller error and lower complexity than the HHL variant. We supported our findings with numerical simulations.
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.