End-to-end performance of quantum-accelerated large-scale linear algebra workflows

• URL: http://arxiv.org/abs/2603.15515v1
• Date: Mon, 16 Mar 2026 16:42:40 GMT
• Title: End-to-end performance of quantum-accelerated large-scale linear algebra workflows
• Abstract summary: We measure the end-to-end performance of a hybrid quantum-classical framework designed to accelerate Finite Element Analysis (FEA)<n>Results highlight the significant potential of quantum computing to reduce time-to-solution for large-scale FEA simulations.
• Score: 0.2810625954925814
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Solving large-scale sparse linear systems is a challenging computational task due to the introduction of non-zero elements, or "fill-in." The Graph Partitioning Problem (GPP) arises naturally when minimizing fill-in and accelerating solvers. In this paper, we measure the end-to-end performance of a hybrid quantum-classical framework designed to accelerate Finite Element Analysis (FEA) by integrating a quantum solver for GPP into Synopsys/Ansys' LS-DYNA multiphysics simulation software. The quantum solver we use is based on Iterative-QAOA, a scalable, non-variational quantum approach for optimization. We focus on two specific classes of FEA problems, namely vibrational (eigenmode) analysis and transient simulation. We report numerical simulations on up to 150 qubits done on NVIDIA's CUDA-Q/cuTensorNet and implementation on IonQ's Forte quantum hardware. The potential impact on LS-DYNA workflows is quantified by measuring the wall-clock time-to-solution for complex problem instances, including vibrational analysis of large finite element models of a sedan car and a Rolls-Royce jet engine, as well as transient simulations of a drill and an impeller. We performed end-to-end performance measurements on meshes comprising up to 35 million elements. Measurements were conducted using LS-DYNA in distributed-memory mode via Message Passing Interface (MPI) on AWS and Synopsys compute clusters. Our findings indicate that with a quantum computer in the loop, amortized LS-DYNA wall-clock time can be improved by up to 15% for specific cases and by at least 7% for all models considered. These results highlight the significant potential of quantum computing to reduce time-to-solution for large-scale FEA simulations within the Noisy Intermediate-Scale Quantum (NISQ) era, offering an approach that is scalable and extendable into the fault-tolerant quantum computing regime.

Related papers

• Accelerating large-scale linear algebra using variational quantum imaginary time evolution [1.7869527971850843]
  We introduce a quantum approach to the graph partitioning problem based on variational quantum imaginary time evolution (VarQITE)<n>We develop a hybrid quantum/classical method to accelerate Finite Element Analysis (FEA) by using VarQITE in Ansys's LS-DYNA simulation software.<n>We demonstrate that VarQITE has the potential to impact LS-DYNA by measuring the wall-clock time to solution of FEA problems.
  arXiv  Detail & Related papers  (2025-03-17T12:52:25Z)
• 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)
• Queen: A quick, scalable, and comprehensive quantum circuit simulation for supercomputing [2.821829060100186]
  We present an innovative quantum circuit simulation toolkit comprising gate optimization and simulation modules. We achieve averaging 9 times speedup compared to state-of-the-art simulators, including QuEST, IBM-Aer, and NVIDIA-cuQuantum. We believe the proposed toolkit paves the way for faster quantum circuit simulations, thereby facilitating the development of novel quantum algorithms.
  arXiv  Detail & Related papers  (2024-06-20T08:00:41Z)
• Optimized noise-assisted simulation of the Lindblad equation with time-dependent coefficients on a noisy quantum processor [0.6990493129893112]
  Noise can be an asset in digital quantum simulations of open systems on Noisy Intermediate-Scale Quantum (NISQ) devices. We introduce an optimized decoherence rate control scheme that can significantly reduce computational requirements by multiple orders of magnitude.
  arXiv  Detail & Related papers  (2024-02-12T12:48:03Z)
• Exponential Quantum Speedup for Simulation-Based Optimization Applications [4.302408747749262]
  We focus on the LinQuSO subclass of QuSO, which is characterized by the linearity of the simulation problem. We prove that a large subgroup of LinQuSO problems can be solved with up to exponential quantum speedups with regards to their simulation component.
  arXiv  Detail & Related papers  (2023-05-15T09:32:51Z)
• Scalable Quantum Computation of Highly Excited Eigenstates with Spectral Transforms [0.76146285961466]
  We use the HHL algorithm to prepare excited interior eigenstates of physical Hamiltonians in a variational and targeted manner. This is enabled by the efficient computation of the expectation values of inverse Hamiltonians on quantum computers. We detail implementations of this scheme for both fault-tolerant and near-term quantum computers.
  arXiv  Detail & Related papers  (2023-02-13T19:01:02Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.