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

Physica Scripta

Simulating the finite-resolution HHL spectral filter with tensor networks and qudits

Alejandro Mata Ali, Iñigo Perez Delgado, Marina Ristol Roura, Aitor Moreno-Fernández-de-Leceta, Sebastiájn V Romero

Published Sep 2, 2026• 0 citations
Publisher

Abstract

Abstract This work proposes a qudit formulation of the Harrow-Hassidim-Lloyd algorithm and a classical tensor-network representation of its finite-resolution spectral filter. The tensor network evaluates the joint successful branch directly: it recovers the conditioned solution state on an exact non-aliased phase grid and otherwise applies $f_{\mu,\tau}$, with the success probability treated separately. The construction enables controlled studies of spectral discretization and aliasing. It is evaluated on model linear systems against direct classical references and, for small instances, against a Qiskit statevector implementation using matched spectral parameters. The framework is intended for benchmarking and methodological analysis of finite-resolution HHL.

DOI
10.1088/1402-4896/aea197

Related papers

Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective

Alejandro Mata Ali, Iñigo Perez Delgado, Marina Ristol Roura +2 more

This work presents a new approach for simulating the HHL linear systems of equations solver algorithm with tensor networks. First, a novel HHL in the qudits formalism, the generalization of qubits, is developed, and then its operations are transformed into an equivalent classical HHL, taking advantage of the non-unitary operations that they can apply. The main novelty of this proposal is to perform a classical simulation of the HHL as efficiently as possible to benchmark the algorithm steps according to its input parameters and the input matrix. The algorithm is applied to three classical simple simulation problems, comparing it with an exact inversion algorithm, and its performance is compared against an implementation of the original HHL simulated in the Qiskit framework, providing both codes. It is also applied to study the sensitivity of the HHL algorithm with respect to its hyperparameter values, reporting the existence of saturation points and maximal performance values. The results show that this approach can achieve a promising performance in computational efficiency to simulate the HHL process without quantum noise, providing a higher bound for its performance.

arXiv:2309.05290•Sep 11, 2023•1 citation

The Harrow-Hassidim-Lloyd algorithm with qutrits

Tushti Patel, V. S. Prasannaa

We extend the Harrow-Hassidim-Lloyd (HHL) algorithm, which is well-studied in the qubit framework, to its qutrit counterpart (which we call qutrit HHL, as opposed to qubit HHL, which is HHL using qubits), and develop a program for its implementation. We design Weyl-Heisenberg gadgets, the qutrit equivalents of Pauli gadgets, and come up with a practical implementation scheme for qutrit HHL. We test HHL with qutrits for simple matrices and verify the results against the expected outcomes. We apply the algorithm to quantum chemistry, and in particular, to the potential energy curve calculations of the model problem of the Hydrogen molecule in the split valence basis. We do so for two cases: 1-qutrit and 2-qutrit input states, where the latter makes use of our gadgets. We compare the number of qudits and the number of gates required between qubit and qutrit HHL implementations. In general, we find that for a fixed precision, the qutrit HHL circuit requires fewer number of qudits and comparable number of two-qudit gates than its qubit counterpart.

quant-pharXiv:2511.17960•Nov 25, 2025•1 citation

Quantum HHL Algorithm for Solving 1D Linear Advection Equation Using Explicit and Implicit Finite Difference Schemes

Batuhan Yalcin, Lucy Zhang

This study develops and implements a Harrow-Hassidim-Lloyd (HHL) quantum algorithm for solving a one-dimensional linear advection equation with periodic boundary conditions. The governing equation is first discretized using a classical finite difference (FD) scheme to obtain a linear system suitable for quantum solution. We present a newly designed, circuit-level implementation of HHL assembled from Qiskit circuit components and exploit the circulant structure of the periodic discretization matrices through Fourier-based matrix evolution. The HHL algorithm is benchmarked with three explicit schemes and one implicit scheme. The implicit scheme requires a nontrivial linear solve arising from the discretized PDE on progressively finer grids, whereas the explicit schemes provide different input fields for testing state preparation and reconstruction with identity coefficient matrices. HHL solution states are validated against direct classical solves in noiseless simulation. For hardware execution, the periodic matrix structure permits a Fourier implementation that applies reciprocal eigenvalues without phase estimation. Results on the IBM Rensselaer Nighthawk processor are compared at a shared final time. Noiseless reconstructed fields approach the transported profile on resolved grids, while substantial hardware errors remain for both explicit and implicit schemes. Crank-Nicolson remains exceptionally well-conditioned and utilizes similar circuit re sources to the explicit controls, proving that hardware degradation in our tests was not driven by poor matrix conditioning. Ultimately, this study shows new means for HHL algorithms to study quantum CFD problems involving advection equations with implicit time integrations, while demonstrating how state preparation and measurement affect the practical performance of quantum solvers on current devices.

arXiv:2611.01167•Oct 31, 2026•0 citations

Hybrid Quantum-Classical Implementation of the Harrow–Hassidim–Lloyd Algorithm: Bounded-Error Quantum Polynomial Time (BQP)-Completeness of Matrix Inversion and Error Mitigation for Noisy Intermediate-Scale Quantum (NISQ) Devices

Zefree Lazarus Mayaluri, Panda Ganapati

We propose a hybrid quantum-classical implementation of the Harrow-Hassidim-Lloyd (HHL) algorithm for the matrix inversion (linear-systems) problem, a key subroutine in quantum computing. Rather than claiming a new complexity result, we provide an assumption-explicit proof sketch, aligned with established literature, that contextualizes matrix inversion as Bounded-Error Quantum Polynomial Time (BQP)-complete and offers reduction-based intuition via Grover-type amplitude amplification. We implement HHL for 2 × 2, 4 × 4, and 8 × 8 Hermitian matrices using Qiskit and evaluate performance using simulator-based experiments with calibrated noise models and executions on IBM Quantum and IonQ backends. To enhance robustness on Noisy Intermediate-Scale Quantum (NISQ) hardware, we integrate measurement-error mitigation, zero-noise extrapolation, and post-selection, and we quantify performance using fidelity and mean squared error. Results from noiseless simulation, calibrated-noise simulation, and real-device execution show that mitigation improves reconstruction fidelity for small Hermitian systems, particularly for deeper circuits. These findings support mitigation-aware feasibility on current NISQ devices; however, they do not establish present-day runtime advantage over optimized classical solvers. The proposed workflow is relevant to quantum optimization, quantum machine learning, and quantum chemistry, where linear-system primitives arise frequently. Future work will focus on reducing phase-estimation depth (e.g., iterative or semiclassical variants), improving compilation and benchmarking transparency, and re-evaluating larger instances on higher-fidelity hardware.

Cureus Journal of Computer Science.•May 14, 2026•1 citation

Solving linear systems on quantum hardware with hybrid HHL++

Romina Yalovetzky, Pierre Minssen, Dylan Herman +1 more

The limited capabilities of current quantum hardware significantly constrain the scale of experimental demonstrations of most quantum algorithmic primitives. This makes it challenging to perform benchmarking of the current hardware using useful quantum algorithms, i.e., application-oriented benchmarking. In particular, the Harrow-Hassidim-Lloyd (HHL) algorithm is a critical quantum linear algebra primitive, but the majority of the components of HHL are far out of the reach of noisy intermediate-scale quantum devices, which has led to the proposal of hybrid classical-quantum variants. The goal of this work is to further bridge the gap between proposed near-term friendly implementations of HHL and the kinds of quantum circuits that can be executed on noisy hardware. Our proposal adds to the existing literature of hybrid quantum algorithms for linear algebra that are more compatible with the current scale of quantum devices. Specifically, we propose two modifications to the Hybrid HHL algorithm proposed by Lee et al., leading to our algorithm Hybrid $$\hbox {HHL}^{++}$$ : (1) propose a novel algorithm for determining a scaling factor for the linear system matrix that maximizes the utility of the amount of ancillary qubits allocated to the phase estimation component of HHL, and (2) introduce a heuristic for compressing the HHL circuit. We demonstrate the efficacy of our work by running our modified Hybrid HHL on Quantinuum System Model H-series trapped-ion quantum computers to solve different problem instances of small-scale portfolio optimization problems, leading to the largest experimental demonstrations of HHL for an application to date.

arXiv:2110.15958•Scientific Reports•Sep 10, 2024•58 citations

Error convergence of quantum linear system solvers

M. D. Ginzburg, Ugo Marzolino

The Harrow-Hassidim-Lloyd (HHL) algorithm remains a paradigmatic quantum routine for solving linear systems and a widely used benchmark in theoretical and experimental studies. Several circuit-level variants have been proposed to simplify its implementation, including constructions in which the clock register is factorized via Hadamard gates to reduce circuit depth and entanglement. In this work, we show that this commonly deployed modification can fundamentally alter the asymptotic behavior of the algorithm and may fail to converge in the limit of large clock size due to persistent phase interference effects. This phenomenon is not a finite-size artifact and compromises the correctness guarantees of the factorized-clock implementation. We provide an analytic characterization of the underlying mechanism and demonstrate that a minimal and experimentally feasible modification suffices to restore convergence while preserving the practical advantages of the simplified circuit. Our results clarify an overlooked correctness issue in a widely used HHL implementation pattern and delineate the conditions under which simplified realizations faithfully reproduce the intended algorithmic behavior.

arXiv:2410.18736•Physical Review A•May 19, 2026•2 citations
Abstract This work proposes a qudit formulation of the Harrow-Hassidim-Lloyd algorithm and a classical tensor-network representation of its finite-resolution spectral filter. The tensor network evaluates the joint successful branch directly: it recovers the conditioned solution state on an exact non-aliased phase grid and otherwise applies fμ,τf_{\mu,\tau}fμ,τ​, with the success probability treated separately. The construction enables controlled studies of spectral discretization and aliasing. It is evaluated on model linear systems against direct classical references and, for small instances, against a Qiskit statevector implementation using matched spectral parameters. The framework is intended for benchmarking and methodological analysis of finite-resolution HHL.
This work presents a new approach for simulating the HHL linear systems of equations solver algorithm with tensor networks. First, a novel HHL in the qudits formalism, the generalization of qubits, is developed, and then its operations are transformed into an equivalent classical HHL, taking advantage of the non-unitary operations that they can apply. The main novelty of this proposal is to perform a classical simulation of the HHL as efficiently as possible to benchmark the algorithm steps according to its input parameters and the input matrix. The algorithm is applied to three classical simple simulation problems, comparing it with an exact inversion algorithm, and its performance is compared against an implementation of the original HHL simulated in the Qiskit framework, providing both codes. It is also applied to study the sensitivity of the HHL algorithm with respect to its hyperparameter values, reporting the existence of saturation points and maximal performance values. The results show that this approach can achieve a promising performance in computational efficiency to simulate the HHL process without quantum noise, providing a higher bound for its performance.
We extend the Harrow-Hassidim-Lloyd (HHL) algorithm, which is well-studied in the qubit framework, to its qutrit counterpart (which we call qutrit HHL, as opposed to qubit HHL, which is HHL using qubits), and develop a program for its implementation. We design Weyl-Heisenberg gadgets, the qutrit equivalents of Pauli gadgets, and come up with a practical implementation scheme for qutrit HHL. We test HHL with qutrits for simple matrices and verify the results against the expected outcomes. We apply the algorithm to quantum chemistry, and in particular, to the potential energy curve calculations of the model problem of the Hydrogen molecule in the split valence basis. We do so for two cases: 1-qutrit and 2-qutrit input states, where the latter makes use of our gadgets. We compare the number of qudits and the number of gates required between qubit and qutrit HHL implementations. In general, we find that for a fixed precision, the qutrit HHL circuit requires fewer number of qudits and comparable number of two-qudit gates than its qubit counterpart.
This study develops and implements a Harrow-Hassidim-Lloyd (HHL) quantum algorithm for solving a one-dimensional linear advection equation with periodic boundary conditions. The governing equation is first discretized using a classical finite difference (FD) scheme to obtain a linear system suitable for quantum solution. We present a newly designed, circuit-level implementation of HHL assembled from Qiskit circuit components and exploit the circulant structure of the periodic discretization matrices through Fourier-based matrix evolution. The HHL algorithm is benchmarked with three explicit schemes and one implicit scheme. The implicit scheme requires a nontrivial linear solve arising from the discretized PDE on progressively finer grids, whereas the explicit schemes provide different input fields for testing state preparation and reconstruction with identity coefficient matrices. HHL solution states are validated against direct classical solves in noiseless simulation. For hardware execution, the periodic matrix structure permits a Fourier implementation that applies reciprocal eigenvalues without phase estimation. Results on the IBM Rensselaer Nighthawk processor are compared at a shared final time. Noiseless reconstructed fields approach the transported profile on resolved grids, while substantial hardware errors remain for both explicit and implicit schemes. Crank-Nicolson remains exceptionally well-conditioned and utilizes similar circuit re sources to the explicit controls, proving that hardware degradation in our tests was not driven by poor matrix conditioning. Ultimately, this study shows new means for HHL algorithms to study quantum CFD problems involving advection equations with implicit time integrations, while demonstrating how state preparation and measurement affect the practical performance of quantum solvers on current devices.
We propose a hybrid quantum-classical implementation of the Harrow-Hassidim-Lloyd (HHL) algorithm for the matrix inversion (linear-systems) problem, a key subroutine in quantum computing. Rather than claiming a new complexity result, we provide an assumption-explicit proof sketch, aligned with established literature, that contextualizes matrix inversion as Bounded-Error Quantum Polynomial Time (BQP)-complete and offers reduction-based intuition via Grover-type amplitude amplification. We implement HHL for 2 × 2, 4 × 4, and 8 × 8 Hermitian matrices using Qiskit and evaluate performance using simulator-based experiments with calibrated noise models and executions on IBM Quantum and IonQ backends. To enhance robustness on Noisy Intermediate-Scale Quantum (NISQ) hardware, we integrate measurement-error mitigation, zero-noise extrapolation, and post-selection, and we quantify performance using fidelity and mean squared error. Results from noiseless simulation, calibrated-noise simulation, and real-device execution show that mitigation improves reconstruction fidelity for small Hermitian systems, particularly for deeper circuits. These findings support mitigation-aware feasibility on current NISQ devices; however, they do not establish present-day runtime advantage over optimized classical solvers. The proposed workflow is relevant to quantum optimization, quantum machine learning, and quantum chemistry, where linear-system primitives arise frequently. Future work will focus on reducing phase-estimation depth (e.g., iterative or semiclassical variants), improving compilation and benchmarking transparency, and re-evaluating larger instances on higher-fidelity hardware.
The limited capabilities of current quantum hardware significantly constrain the scale of experimental demonstrations of most quantum algorithmic primitives. This makes it challenging to perform benchmarking of the current hardware using useful quantum algorithms, i.e., application-oriented benchmarking. In particular, the Harrow-Hassidim-Lloyd (HHL) algorithm is a critical quantum linear algebra primitive, but the majority of the components of HHL are far out of the reach of noisy intermediate-scale quantum devices, which has led to the proposal of hybrid classical-quantum variants. The goal of this work is to further bridge the gap between proposed near-term friendly implementations of HHL and the kinds of quantum circuits that can be executed on noisy hardware. Our proposal adds to the existing literature of hybrid quantum algorithms for linear algebra that are more compatible with the current scale of quantum devices. Specifically, we propose two modifications to the Hybrid HHL algorithm proposed by Lee et al., leading to our algorithm Hybrid HHL++\hbox {HHL}^{++}HHL++ : (1) propose a novel algorithm for determining a scaling factor for the linear system matrix that maximizes the utility of the amount of ancillary qubits allocated to the phase estimation component of HHL, and (2) introduce a heuristic for compressing the HHL circuit. We demonstrate the efficacy of our work by running our modified Hybrid HHL on Quantinuum System Model H-series trapped-ion quantum computers to solve different problem instances of small-scale portfolio optimization problems, leading to the largest experimental demonstrations of HHL for an application to date.
The Harrow-Hassidim-Lloyd (HHL) algorithm remains a paradigmatic quantum routine for solving linear systems and a widely used benchmark in theoretical and experimental studies. Several circuit-level variants have been proposed to simplify its implementation, including constructions in which the clock register is factorized via Hadamard gates to reduce circuit depth and entanglement. In this work, we show that this commonly deployed modification can fundamentally alter the asymptotic behavior of the algorithm and may fail to converge in the limit of large clock size due to persistent phase interference effects. This phenomenon is not a finite-size artifact and compromises the correctness guarantees of the factorized-clock implementation. We provide an analytic characterization of the underlying mechanism and demonstrate that a minimal and experimentally feasible modification suffices to restore convergence while preserving the practical advantages of the simplified circuit. Our results clarify an overlooked correctness issue in a widely used HHL implementation pattern and delineate the conditions under which simplified realizations faithfully reproduce the intended algorithmic behavior.