Memory-, Circuit-, and Ansatz-Efficient VQLS for CFD on Hybrid Quantum-HPC Systems

• URL: http://arxiv.org/abs/2608.09661v1
• Date: Mon, 10 Aug 2026 14:37:59 GMT
• Title: Memory-, Circuit-, and Ansatz-Efficient VQLS for CFD on Hybrid Quantum-HPC Systems
• Abstract summary: Fluid dynamics workloads are dominated by repeated solves of large, structured linear systems.<n>VQLS is a leading near-term candidate, but practical deployment on hybrid quantum--high-performance computing systems faces three persistent challenges.<n>We benchmark four matrix-encoding strategies and show that the FWHT approach reduces peak memory by up to $1298times$ on an $11times 11$ Hele--Shaw grid.<n>We deploy full workflow on the OLCF Frontier supercomputer and successfully simulate a 15-bit tridiagonal Toeplitz system on a single node.
• Score: 3.35574311497019
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fluid dynamics workloads are dominated by repeated solves of large, structured linear systems, motivating the search for quantum acceleration. The Variational Quantum Linear Solver (VQLS) is a leading near-term candidate, but practical deployment on hybrid quantum--high--performance computing (HPC) systems faces three persistent challenges: (i) the linear-combination-of-unitaries (LCU) encoding of the system matrix explodes in memory and runtime as the problem size grows, (ii) ansatz selection is largely empirical, with no clear link between standard circuit metrics and solver convergence, and (iii) end-to-end VQLS pipelines have rarely been exercised on production HPC hardware at non-trivial qubit counts. This work addresses these challenges through three contributions. First, we benchmark four matrix-encoding strategies---naive LCU, PennyLane-integrated, Fast Walsh--Hadamard Transform (FWHT)-based parallel Pauli decomposition, and an singular value decomposition (SVD)-based two-term LCU---and show that the FWHT approach reduces peak memory by up to $1298\times$ on an $11\times 11$ Hele--Shaw grid, while the SVD-based coherent VQLS delivers over $10{,}000\times$ per-iteration speedup over standard Pauli-based VQLS at 8 qubits. Second, we evaluate 11 ansatz families with gradient-free and gradient-based optimizers on canonical Hele--Shaw flow, and find that expressibility and entanglement metrics correlate only weakly with VQLS convergence, motivating problem-aware ansatz design. Third, we deploy the full workflow on the OLCF Frontier supercomputer and successfully simulate a 15-qubit tridiagonal Toeplitz system on a single node. Together, these results establish a practical baseline for VQLS in hybrid quantum--HPC computation fluid dynamic (CFD) workflows and identify the remaining bottlenecks for larger problems.

Related papers

• Efficient Treatment of Non-Linearity in Quantum Computational Fluid Dynamics Using Hybrid Tensor Networks [0.0]
  We present a hybrid quantum-classical tensor network algorithm.<n>We replace prior state-based nonlinear implementations with tensor-based block encodings.<n>Compared to fully classical tensor network solvers, our hybrid approach yields substantial reductions in both memory footprint and computational cost.
  arXiv  Detail & Related papers  (2026-08-25T07:13:00Z)
• OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond [50.440302567029654]
  Multi-modal intelligence has made the Key-Value cache a dominant memory bottleneck for efficient deployment.<n>In this work, we revisit the inherent limitations of the per-channel quantization paradigm.<n>We propose OScaR, an accurate and lightweight KV cache compression framework for X-LLMs.
  arXiv  Detail & Related papers  (2026-05-19T10:53:03Z)
• A Semantic Quantum Circuit Cache for Scalable and Distributed Quantum-Classical Workflows [0.45880283710344066]
  Quantum Circuit Cache is a content-addressable system that detects semantic equivalence and reuses previously computed results.<n>Our approach combines ZX-calculus reduction with isomorphism-invariant Weisfeiler-Leman graph hashing to generate deterministic circuit identifiers.
  arXiv  Detail & Related papers  (2026-04-29T15:21:51Z)
• Distributed Variational Quantum Linear Solver [2.7835589988032887]
  We present a distributed VQLS framework built on NVIDIA-Q, that enables scalable distribution of the O(L2) cost-function evaluations.<n>A fast Walsh--Hadamard transform (FWHT) supercomputer-based Pauli decomposition curbs the exponential growth of LCU terms, reducing L from O(2n) to O(1) for n > 6 qubits.<n>For a 10-qubit tridiagonal Toeplitz system, this yields a 256x reduction, while preserving over $99.99% solution fidelity.
  arXiv  Detail & Related papers  (2026-04-15T21:27:16Z)
• Solving larger Travelling Salesman Problem networks with a penalty-free Variational Quantum Algorithm [5.690622599243828]
  The Travelling Salesman Problem (TSP) is a well-known NP-Hard problem, with industrial use cases such as last-mile delivery.<n>We present high quality solutions in noise-free simulations of networks with up to twelve locations using a hybrid penalty-free, circuit-model.
  arXiv  Detail & Related papers  (2025-12-06T18:21:21Z)
• Scaling Hybrid Quantum-HPC Applications with the Quantum Framework [2.9218462389567823]
  Hybrid quantum-high performance computing is emerging as a key strategy for running quantum applications at scale.<n>We extend the Quantum Framework (QFw), a modular and HPC-aware orchestration layer, to integrate multiple local backends and a cloud-based quantum backend.<n>Using this integration, we execute a number of non-variational as well as variational workloads.
  arXiv  Detail & Related papers  (2025-09-17T22:58:43Z)
• 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)
• Lazy Qubit Reordering for Accelerating Parallel State-Vector-based Quantum Circuit Simulation [0.0]
  Two quantum operation scheduling methods are proposed for quantum circuit simulation. The proposed methods reduce all-to-all communication caused by qubit reordering. We develop these methods tailored for two primary procedures in variational quantum eigensolver (VQE) simulation.
  arXiv  Detail & Related papers  (2024-10-05T18:20:37Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

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.