zoom_in Click to enlarge

HHL algorithm

▲ ▼

description HHL algorithm Overview

HHL (Harrow-Hassidim-Lloyd) is a quantum algorithm designed to solve linear systems of equations exponentially faster than classical algorithms for certain problem instances, leveraging quantum superposition and entanglement.

help HHL algorithm FAQ

What type of quantum speedup does the HHL algorithm provide?

The HHL algorithm provides an exponential speedup over classical algorithms for solving systems of linear equations, specifically running in time proportional to the logarithm of the matrix dimension. However, this massive speedup is highly conditional and does not apply to all types of matrices.

Can the HHL algorithm be run on today's quantum computers?

While theoretically groundbreaking, the HHL algorithm is currently unrunnable on NISQ (Noisy Intermediate-Scale Quantum) devices for any practically large problems. It requires millions of physical, error-corrected logical qubits that current hardware does not possess.

Who are the creators of the HHL algorithm?

The algorithm was developed by Aram Harrow, Avinatan Hassidim, and Seth Lloyd. It was officially published in 2009 in the Physical Review Letters journal.

Why can't we use the HHL algorithm to solve all linear equations instantly?

The algorithm requires the matrix to be highly sparse and well-conditioned to achieve its exponential speedup. Furthermore, extracting the complete solution vector is a slow process, so it is only useful if you want to calculate a specific summary statistic of the data.

swap_horiz

Looking for HHL algorithm alternatives? Compare top competitors ranked & scored

arrow_forward