Extending UNIQuE: Quantum Simulation Speedup for the HHL Algorithm

• URL: http://arxiv.org/abs/2604.25148v1
• Date: Tue, 28 Apr 2026 02:53:15 GMT
• Title: Extending UNIQuE: Quantum Simulation Speedup for the HHL Algorithm
• Abstract summary: We introduce a classical emulation of the quantum Harrow-Hassidim-Lloyd algorithm for sampling from the solution space of linear systems.<n>The emulated HHL algorithm scales exponentially with the number of qubits required to represent the linear system.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In an extension of the Unconventional Noiseless Intermediate Quantum Emulator, this work introduces a classical emulation of the quantum Harrow-Hassidim-Lloyd algorithm for sampling from the solution space of linear systems. The emulated HHL algorithm scales exponentially with the number of qubits required to represent the linear system, which is an advantage over the state vector simulation of the HHL algorithm, which scales exponentially as a function of both the size of the linear system and the magnitude of its largest (scaled) eigenvalue. We benchmark our emulator by comparing it with the Intel Quantum Simulator and demonstrate a runtime advantage for small linear systems.

Related papers

• Digital Quantum Simulation of the Holstein-Primakoff Transformation on Noisy Qubits [40.8066152850216]
  We study the digital quantum simulation of bosonic modes on a cloud-based superconducting quantum processor.<n>We examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters.
  arXiv  Detail & Related papers  (2026-02-19T20:14:04Z)
• Enhancing Chemistry on Quantum Computers with Fermionic Linear Optical Simulation [2.7065118141722455]
  We present and open source a quantum circuit simulator tailored to chemistry applications.<n>Our simulator can compute the Born-rule probabilities of samples obtained from circuits containing passive fermionic linear optical elements and controlled-phase gates.
  arXiv  Detail & Related papers  (2025-11-16T02:05:16Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations [0.0]
  We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS)<n>This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions.<n>We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation.
  arXiv  Detail & Related papers  (2025-01-19T19:03:29Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective [37.57762772762448]
  This work presents a new approach for simulating the HHL linear systems of equations solver algorithm with tensor networks.<n>A novel HHL in the qudits formalism, the generalization of qubits, is developed, and then its operations are transformed into an equivalent classical HHL.
  arXiv  Detail & Related papers  (2023-09-11T08:18:41Z)
• Hamiltonian simulation using quantum singular value transformation: complexity analysis and application to the linearized Vlasov-Poisson equation [0.4394730767364254]
  Hamiltonian simulation (HS) algorithm can be used to speed up the simulation time for physical systems. Recently, it was proven that the quantum singular value transformation (QSVT) achieves the minimum simulation time for HS. In this work, we execute a detailed analysis of the error and number of queries of the QSVT-based HS and show that the oblivious method is better than the fixed-point one in the sense of simulation time.
  arXiv  Detail & Related papers  (2023-04-18T12:26:18Z)
• Large-scale simulations of Floquet physics on near-term quantum computers [0.3252295747842729]
  We introduce the Quantum High-Frequency Floquet Simulation (QHiFFS) algorithm as a method to simulate fast-driven quantum systems on quantum hardware. Central to QHiFFS is the concept of a kick operator which transforms the system into a basis where the dynamics is governed by a time-independent effective Hamiltonian.
  arXiv  Detail & Related papers  (2023-03-03T20:45:01Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.