GPU-Accelerated Quantum Simulation: Empirical Backend Selection, Gate Fusion, and Adaptive Precision

• URL: http://arxiv.org/abs/2604.03816v1
• Date: Sat, 04 Apr 2026 17:46:37 GMT
• Title: GPU-Accelerated Quantum Simulation: Empirical Backend Selection, Gate Fusion, and Adaptive Precision
• Abstract summary: This paper presents a GPU-accelerated quantum circuit simulation framework.<n>An empirical backend selection algorithm benchmarks CuPy, PyTorchCUDA, and NumPy CPU backends at runtime.<n>A gate fusion engine reduces circuit depth through automated identification of gate sequences.<n>A fallback mechanism monitors GPU memory consumption and gracefully degrades to memory execution when resources are exhausted.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Classical simulation of quantum circuits remains indispensable for algorithm development, hardware validation, and error analysis in the noisy intermediate-scale quantum (NISQ) era. However, state-vector simulation faces exponential memory scaling, with an n-qubit system requiring O(2^n) complex amplitudes, and existing simulators often lack the flexibility to exploit heterogeneous computing resources at runtime. This paper presents a GPU-accelerated quantum circuit simulation framework that introduces three contributions: (1) an empirical backend selection algorithm that benchmarks CuPy, PyTorch-CUDA, and NumPy-CPU backends at runtime and selects the optimal execution path based on measured throughput; (2) a directed acyclic graph (DAG) based gate fusion engine that reduces circuit depth through automated identification of fusible gate sequences, coupled with adaptive precision switching between complex64 and complex128 representations; and (3) a memory-aware fallback mechanism that monitors GPU memory consumption and gracefully degrades to CPU execution when resources are exhausted. The framework integrates with Qiskit, Cirq, PennyLane, and Amazon Braket through a unified adapter layer. Benchmarks on an NVIDIA A100-SXM4 (40 GiB) GPU demonstrate speedups of 64x to 146x over NumPy CPU execution for state-vector simulation of circuits with 20 to 28 qubits, with speedups exceeding 5x from 16 qubits onward. Hardware validation on an IBM quantum processing unit (QPU) confirms Bell state fidelity of 0.939, a five-qubit Greenberger-Horne-Zeilinger (GHZ) state fidelity of 0.853, and circuit depth reduction from 42 to 14 gates through the fusion pipeline. The system is designed for portability across NVIDIA consumer and data-center GPUs, requiring no vendor-specific compilation steps.

Related papers

• Accelerating State-Vector Quantum Simulation on Integrated GPUs via Cache Locality Optimization: A Cross-Architecture Evaluation [33.72751145910978]
  This work proposes a vendor-agnostic approach targeting the integrated GPU commonly found in consumer-grade laptops.<n>A primary challenge in state-vector simulation is its inherently poor spatial locality, which creates a memory bandwidth bottleneck.<n>We introduce a state partitioning optimization that reorganizes the quantum state vector to maximize the last-level cache locality and minimize costly main memory fetches.
  arXiv  Detail & Related papers  (2026-05-14T17:17:02Z)
• Xe-Forge: Multi-Stage LLM-Powered Kernel Optimization for Intel GPU [38.81440160993858]
  Porting deep learning algorithms to new hardware accelerators requires developers to apply the same low-level optimizations to every Triton kernel in their code-base.<n>We present Xe-Forge, a multi-stage LLM-powered pipeline that automates this process for Intel GPU.<n>A curated knowledge base encodes Intel GPU constraints that are absent from LLM training data, keeping the model within architecturally valid bounds.
  arXiv  Detail & Related papers  (2026-04-16T20:21:01Z)
• BWTA: Accurate and Efficient Binarized Transformer by Algorithm-Hardware Co-design [71.97035034203275]
  We analyze zero-point distortion in binarization and propose a Binary Weights & Ternary Activations (BWTA) quantization scheme.<n>For training, we propose Smooth Multi-Stage Quantization, combining a Levelwise Degradation Strategy and a MagnitudeAlignment Projection Factor.<n>Experiments show that BWTA approaches full-precision performance for Transformer-based models, with an average 3.5% drop on GLUE and less than 2% drop on five tasks.
  arXiv  Detail & Related papers  (2026-04-05T04:25:07Z)
• GRAB-ANNS: High-Throughput Indexing and Hybrid Search via GPU-Native Bucketing [39.763467046232584]
  We present GRAB-ANNS, a GPU-native graph index for dynamic hybrid search.<n>We show that GRAB-ANNS achieves up to 240.1 times higher query throughput and 12.6 times faster index construction than state-of-the-art CPU-based systems.
  arXiv  Detail & Related papers  (2026-03-31T11:00:10Z)
• Understand and Accelerate Memory Processing Pipeline for Disaggregated LLM Inference [45.78442013449325]
  Large language models rely on efficient long-context processing and generation mechanisms to support complex reasoning.<n>We show that these optimizations can be unified into a four-step memory processing pipeline: Prepare Memory, Compute Relevancy, Retrieval, and Apply to Inference.<n>Motivated by this insight, we argue that textbfheterogeneous systems are well-suited to accelerate memory processing and thus end-to-end inference.
  arXiv  Detail & Related papers  (2026-03-30T21:03:39Z)
• The Quest for Quantum Advantage in Combinatorial Optimization: End-to-end Benchmarking of Quantum Solvers vs. Multi-core Classical Solvers [34.734652426291525]
  We perform an end-to-end benchmark of a hybrid sequential quantum computing solver for higher-order unconstrained binary optimization (HUBO) on IBM Heron r3 quantum processors.<n>Across 20 benchmark instances, a single hybrid attempt produces high-quality solutions in less than one second, matching the ground-state energy in 14 cases.
  arXiv  Detail & Related papers  (2026-03-13T21:29:20Z)
• FlashSchNet: Fast and Accurate Coarse-Grained Neural Network Molecular Dynamics [36.3434800328807]
  Graph neural network (GNN) potentials such as SchNet improve the accuracy and transferability of molecular dynamics (MD) simulation.<n>We show that a missing principle is making GNN-MD IO-aware, carefully accounting for reads and writes between high-bandwidth memory (HBM) and on-chip.<n>We present FlashSchNet, an efficient and accurate IO-aware GNN-MD framework built on four techniques.
  arXiv  Detail & Related papers  (2026-02-13T17:49:12Z)
• AEQUAM: Accelerating Quantum Algorithm Validation through FPGA-Based Emulation [0.46873264197900916]
  AEQUAM is a toolchain that enables faster and more accessible quantum circuit verification.<n>It consists of a compiler that translates OpenQASM 2.0 into RISC-like instructions, Cython software models for selecting number representations and simulating circuits, and a VHDL generator that produces RTL descriptions for FPGA-based hardware emulators.
  arXiv  Detail & Related papers  (2025-06-01T14:17:23Z)
• phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale [0.8223023312645978]
  Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms.<n>We present a full-state vector simulation algorithm and software implementation designed to perform HPC simulation of layers of rotations around a string of Pauli operators.
  arXiv  Detail & Related papers  (2025-04-24T18:41:23Z)
• Comparative Benchmarking of Utility-Scale Quantum Emulators [0.0]
  evaluating quantum algorithms at utility-scale is a key step toward advancing real-world applications of quantum computing.<n>We benchmark seven state-the-art quantum emulators employing techniques such as tensor networks, matrix product states (MPS), decision diagrams, and factorized ket based methods.
  arXiv  Detail & Related papers  (2025-04-18T18:32:47Z)
• FQsun: A Configurable Wave Function-Based Quantum Emulator for Power-Efficient Quantum Simulations [0.5359378066251386]
  We propose FQsun, a quantum emulator that enhances performance by integrating four key innovations.<n>Five FQsun versions with different number precisions are implemented on the Xilinx ZCU102, consuming a maximum power of 2.41W.
  arXiv  Detail & Related papers  (2024-11-07T06:44:40Z)
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization [35.18016233072556]
  Combinatorial optimization plays a crucial role in many industrial applications.<n>We present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO)<n>Our results show that BF-DCQO offers an effective path for solving large-scale HUBO problems on current and near-term quantum processors.
  arXiv  Detail & Related papers  (2024-09-05T17:38:59Z)
• DeepGEMM: Accelerated Ultra Low-Precision Inference on CPU Architectures using Lookup Tables [49.965024476651706]
  DeepGEMM is a lookup table based approach for the execution of ultra low-precision convolutional neural networks on SIMD hardware. Our implementation outperforms corresponding 8-bit integer kernels by up to 1.74x on x86 platforms.
  arXiv  Detail & Related papers  (2023-04-18T15:13:10Z)

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.