This paper presents AURORA-Q, a tiered-memory quantum circuit simulation framework designed to overcome the memory bottleneck and scalability limits of large-scale quantum circuit simulation on Perlmutter. Its primary strategy is to extend beyond GPU-centric designs bounded by VRAM and introduce a unified tiered-memory architecture that integrates GPU VRAM, DRAM, and storage into a simulation framework. With this design, AURORA-Q partitions the full state vector into subsets, manages their residency across memory tiers, overlaps computation with data movement through an async execution pipeline, and employs a dynamic two-level cache with adaptive resource control to exploit access locality under constrained resources. Our evaluation demonstrates that AURORA-Q executes up to 43 qubit simulations on 512 GPUs, a scale unattainable by existing state-of-the-art simulators due to limited memory resources. AURORA-Q achieves up to$2.91 \times$speedup compared to baselines, while maintaining up to a 79.3% cache hit rate and reducing pipeline stalls by 73% to hide I/O latency.
This paper presents AURORA-Q, a tiered-memory quantum circuit simulation framework designed to overcome the memory bottleneck and scalability limits of large-scale quantum circuit simulation on Perlmutter. Its primary strategy is to extend beyond GPU-centric designs bounded by VRAM and introduce a unified tiered-memory architecture that integrates GPU VRAM, DRAM, and storage into a simulation framework. With this design, AURORA-Q partitions the full state vector into subsets, manages their residency across memory tiers, overlaps computation with data movement through an async execution pipeline, and employs a dynamic two-level cache with adaptive resource control to exploit access locality under constrained resources. Our evaluation demonstrates that AURORA-Q executes up to 43 qubit simulations on 512 GPUs, a scale unattainable by existing state-of-the-art simulators due to limited memory resources. AURORA-Q achieves up to2.91×speedup compared to baselines, while maintaining up to a 79.3% cache hit rate and reducing pipeline stalls by 73% to hide I/O latency.
This paper presents EdgeQuantum, a tiered-memory quantum circuit simulator designed to overcome the memory wall of resource-constrained edge devices. As quantum algorithms scale toward dozens of qubits for on-device NISQ workloads, simulating their state vectors demands coordinated multi-tier memory management beyond the device’s physical DRAM capacity. EdgeQuantum introduces a unified storage hierarchy that integrates unified DRAM and commodity NVMe storage into a 2-tier memory architecture. With this design, EdgeQuantum achieves zero-copy data movement through UVM visibility control, hides write latency through a 4-buffer asynchronous pipeline with serialized NVMe access, and expands capacity via ping-pong mantissa-truncated LZ4 compression. Our evaluation across six quantum circuits on an 8 GB NVIDIA Jetson Orin Nano shows that EdgeQuantum enables up to 40-qubit (8 TB) simulation for high-compression circuits and 36 qubits for dense circuits, while expanding effective memory capacity by up to 1024×. Without compression, EdgeQuantum outperforms the blocking I/O baseline by up to 1.64×. With compression, overlapping CPU compression and storage I/O with GPU computation improves end-to-end pipeline efficiency by 1.40× to 1.60×.
Large-scale quantum circuit simulation on high-performance computing (HPC) systems is crucial for developing and verifying quantum algorithms to overcome the limitations of current noisy quantum computers. However, existing simulators face scalability bottlenecks due to memory limits and communication overhead. Many state-of-the-art approaches rely on static circuit partitioning, which makes it difficult to address the exponential growth in problem size as the number of qubits increases. To overcome these challenges, we present ScaleQsim, a highly scalable quantum circuit simulation framework for large-scale HPC systems. ScaleQsim focuses on providing a unified representation of the full qubit state, yet provides scalability through efficient synchronization and communication. ScaleQsim adopts a novel full state vector partitioning strategy that evenly distributes the full state vector across multiple nodes and GPUs. This distributed structure enables efficient parallel gate execution without costly synchronization, and ScaleQsim applies adaptive kernel configuration, which adjusts execution parameters based on GPU resources and task granularity to enhance simulation efficiency. Our evaluation on the Perlmutter supercomputer with up to 512 GPUs demonstrates that ScaleQsim simulates quantum circuits with up to 42 qubits and outperforms state-of-the-art simulators by up to 77.40× across various quantum circuits.
The classical simulation of quantum algorithms is a crucial tool for circuit development, testing, and validation. Although acceleration using GPUs significantly reduces simulation time, most high-performance simulators rely on vendor-specific frameworks that target data-center hardware. To broaden access to quantum simulation, this work proposes a vendor-agnostic approach targeting the integrated GPUs commonly found in consumer-grade laptops. A primary challenge in state-vector simulation is its inherently poor spatial locality, which creates a memory bandwidth bottleneck. Consequently, baseline implementations experience a severe degradation in relative GPU speedup as the number of simulated qubits increases. To address this limitation, 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. We evaluate this strategy using a Quantum Phase Estimation algorithm across diverse architectures from Intel, AMD, and Apple. The experimental results demonstrate that the proposed optimization successfully mitigates performance degradation at larger qubit scales. In particular, for a 28-qubit simulation, the optimization reversed a performance deficit on an Intel Core i5, improving the GPU speedup over the CPU from 0.95x to 1.89x, and increased the Apple M1 Pro speedup from 3.71x to 5.88x. Overall, this approach yields consistent execution time improvements, demonstrating the viability of integrated GPUs for efficient quantum circuit simulation.
Quantum circuit simulation is crucial for the development of quantum algorithms, particularly given the high cost and noise limitations of physical quantum hardware. While full-state quantum circuit simulation is commonly employed for prototyping and debugging, it poses challenges because of the exponential increase in simulation time for large quantum systems. In this work, we propose an extensible framework designed to enhance simulation performance by optimizing both data locality and computational efficiency, thereby addressing these challenges. This framework is seamlessly integrated with an optimizer that restructures quantum circuits and a simulator that adjusts execution strategies for various quantum operations. For the newly developed components, merge booster and diagonal detector, the underlying algorithms are inspired by the principles of quantum entanglement and gate fusion, as well as by the limitations identified in existing third-party simulation libraries. The experiments were conducted on eight DGX-H100 workstations, each equipped with eight NVIDIA H100 GPUs, employing both gate-level and circuit-level benchmarks. The results indicate a speedup of up to 160 times for circuit-level benchmarks and an acceleration of up to 34 times for diagonal-heavy gate-level benchmarks compared to existing simulators. The proposed methodologies are anticipated to deliver more robust and faster quantum circuit simulations, thereby fostering the advancement of novel quantum algorithms.
Quantum circuit simulations are applied in more and more circumstances as the quantum computing community becomes broader. It helps researchers to evaluate the quantum algorithms and relieve the burden of limited quantum computing resources. However, most of the state-of-the-art quantum simulators utilizes either CPU or GPU to store and calculate the state vector, which results in resources stravation. Morever, the mamximum number of qubits supported by simulator is bounded by the memory, since the memory utilization increases exponentially with the number of qubits. In this study, we leverage Heterogeneous computing to utilize both CPU and GPU to store and update state vectors. We also integrate lossy data compression to reduce memory requirements. Specifically, we develop a heterogeous framework that has a dynamic scheduler to fully utilize the computing resources. We apply lossy compression to chunked state vector to make the maximum number of qubits higher than the regular simulators, the compression also benifits the data movement between CPU and GPU.
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.