cuQuantum SDK: A High-Performance Library for Accelerating Quantum Science

Auteurs : Harun Bayraktar, Ali Charara, David Clark, Saul Cohen, Timothy Costa, Yao-Lung L. Fang, Yang Gao, Jack Guan, John Gunnels, Azzam Haidar, Andreas Hehn, Markus Hohnerbach, Matthew Jones, Tom Lubowe, Dmitry Lyakh, Shinya Morino, Paul Springer, Sam Stanwyck, Igor Terentyev, Satya Varadhan, Jonathan Wong, Takuma Yamaguchi

arXiv: 2308.01999v1 - DOI (quant-ph)
Soumis à arXiv le 03 Aoû. 2023
Résumé scientifique

We present the NVIDIA cuQuantum SDK, a state-of-the-art library of composable primitives for GPU-accelerated quantum circuit simulations. As the size of quantum devices continues to increase, making their classical simulation progressively more difficult, the availability of fast and scalable quantum circuit simulators becomes vital for quantum algorithm developers, as well as quantum hardware engineers focused on the validation and optimization of quantum devices. The cuQuantum SDK was created to accelerate and scale up quantum circuit simulators developed by the quantum information science community by enabling them to utilize efficient scalable software building blocks optimized for NVIDIA GPU platforms. The functional building blocks provided cover the needs of both state vector- and tensor network- based simulators, including approximate tensor network simulation methods based on matrix product state, projected entangled pair state, and other factorized tensor representations. By leveraging the enormous computing power of the latest NVIDIA GPU architectures, quantum circuit simulators that have adopted the cuQuantum SDK demonstrate significant acceleration, compared to CPU-only execution, for both the state vector and tensor network simulation methods. Furthermore, by utilizing the parallel primitives available in the cuQuantum SDK, one can easily transition to distributed GPU-accelerated platforms, including those furnished by cloud service providers and high-performance computing systems deployed by supercomputing centers, extending the scale of possible quantum circuit simulations. The rich capabilities provided by the SDK are conveniently made available via both Python and C application programming interfaces, where the former is directly targeting a broad Python quantum community and the latter allows tight integration with simulators written in any programming language.

Les articles autour de lui, par date et par proximité

Plus haut, c’est plus proche de cet article ; à gauche, c’est plus ancien. Les traits relient les articles proches entre eux : les groupes de traits sont des sous-thèmes. Sélectionnez un point pour voir pourquoi il est là. Retour au résumé de cet article

Comment lire cette carte ? Guide illustré

Les articles les plus proches Les travaux antérieurs sur lesquels il s’appuie Les articles qui le citent

Les articles autour de celui-ci

Classés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.

Les articles les plus proches

  1. Très proche
    KuadroSim: An Optimized and Practical Quantum Circuit Simulator
    Niyazi Furkan Bar, Mehmet Karakose · 2026 · Turkish journal of science and technology · cité 1 fois · Pas encore résumé
    Résumé scientifique

    Quantum circuit simulators play a crucial role in the design, validation, and testing of quantum algorithms on classical hardware. Although numerous simulators exist in the literature, creating complex quantum circuits, especially those with highly controlled and specialized gates, typically requires significant implementation effort and low-level programming. This study introduces KuadroSim, a developer-centric quantum circuit simulator designed to simplify and modularize the quantum circuit construction process. KuadroSim is based on statevector simulation using NumPy and employs procedural algorithms for automated multi-controlled gate synthesis, modular circuit composition, and direct cu…

  2. Très proche Cite cet article Utilise cet article en profondeur
    Queen: A quick, scalable, and comprehensive quantum circuit simulation for supercomputing
    Chuan-Chi Wang, Yu-Cheng Lin, Yan-Jun Wang et al. · 2024 · arXiv.org · preprint, non relu par les pairs · cité 10 fois · Pas encore résumé
    Résumé scientifique

    The state vector-based simulation offers a convenient approach to developing and validating quantum algorithms with noise-free results. However, limited by the absence of cache-aware implementations and unpolished circuit optimizations, the past simulators were severely constrained in performance, leading to stagnation in quantum computing. In this paper, we present an innovative quantum circuit simulation toolkit comprising gate optimization and simulation modules to address these performance challenges. For the performance, scalability, and comprehensive evaluation, we conduct a series of particular circuit benchmarks and strong scaling tests on a DGX-A100 workstation and achieve averaging…

  3. Très proche Cite cet article
    Q-GEAR: Improving quantum simulation framework
    Zi-Qing Guo, Jan Balewski, Zi-Wen Pan · 2025 · ICPP Workshops · cité 5 fois · Pas encore résumé
    Résumé scientifique

    The rapid execution of complex quantum circuit simulations is essential for validating theoretical algorithms, thereby facilitating their successful implementation on quantum hardware. Although mainstream CPU-based platforms for circuit simulations are well established, they tend to be slower. Conversely, the adoption of GPU platforms remains limited because of the necessity for specialized quantum simulation frameworks tailored to different hardware architectures, each requiring distinct implementation and optimization strategies. Therefore, we introduced Q-Gear, a platform-agnostic framework that transforms Qiskit quantum circuits into Cuda-Q kernels. By leveraging Cuda-Q seamless executio…

  4. Très proche Cite cet article
    Swiftn: Accelerating Quantum Circuit Simulation Through Tensor Optimization
    Seunghwan Kim, Changjong Kim, Alex Sim et al. · 2025 · IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing · Pas encore résumé
    Résumé scientifique

    Quantum computers are evolving at a rapid pace and are considered next-generation computers with high computational capabilities. However, due to the unique characteristics of qubits, state-of-the-art quantum computers are vulnerable to noise caused by qubit instability. To overcome this, highperformance computing (HPC) systems are utilized for quantum circuit simulations to evaluate complex quantum algorithms with great accuracy. However, quantum circuit simulations have high computational demands, and the data volume increases exponentially as the number of qubits increases. In this paper, we propose SWIFTN, a quantum circuit simulation optimization framework for HPC systems with scalabili…

  5. Très proche Cite cet article
    Aicir: A Full-Stack Quantum Circuit Simulator with AscendNPU Support
    Xian Lu, Xinying Li, Fei Wang et al. · 2026 · Pas encore résumé
    Résumé scientifique

    Quantum computing is a promising way to study problems that are difficult for classical methods, but current quantum hardware still faces limits in scale, noise, and fidelity. Running quantum algorithms on physical machines can also be costly. Quantum circuit simulators therefore remain important because they let researchers design and test algorithms on classical computers before using quantum hardware. Most high-performance simulators provide GPU backends, while few offer native support for NPUs. This gap limits the computing platforms available for quantum-algorithm research. We developed Aicir to provide a full-stack quantum circuit simulator with a native Huawei Ascend NPU backend. Aici…

  6. Très proche Cite cet article
    Multi-GPU Quantum Circuit Simulation and the Impact of Network Performance
    W. M. Brown, Anurag Ramesh, Thomas Lubinski et al. · 2025 · Computer Physics Communications · cité 8 fois · Pas encore résumé
    Résumé scientifique

    As is intrinsic to the fundamental goal of quantum computing, classical simulation of quantum algorithms is notoriously demanding in resource requirements. Nonetheless, simulation is critical to the success of the field and a requirement for algorithm development and validation, as well as hardware design. GPU-acceleration has become standard practice for simulation, and due to the exponential scaling inherent in classical methods, multi-GPU simulation can be required to achieve representative system sizes. In this case, inter-GPU communications can bottleneck performance. In this work, we present the introduction of MPI into the QED-C Application-Oriented Benchmarks to facilitate benchmarki…

  7. Très proche Cite cet article
    Parallel Tensor Network Contraction for Efficient Quantum Circuit Simulation on Multicore CPUs and GPUs
    Alfred M. Pastor, M. Castillo, José M. Badía · 2025 · IQSOFT · cité 1 fois · Pas encore résumé
    Résumé scientifique

    : Quantum computing has the potential to transform fields such as cryptography, optimisation and materials science. However, the limited scalability and high error rates of current and near-term quantum hardware require efficient classical simulation of quantum circuits for validation and benchmarking. One of the most effective approaches to this problem is to represent quantum circuits as tensor networks, where simulation is equivalent to contracting the network. Given the computational cost of tensor network contraction, exploiting parallelism on modern high performance computing architectures is key to accelerating these simulations. In this work, we evaluate the performance of first-leve…

  8. Proche Cite cet article Utilise cet article en profondeur
    C-3PQ: A Closeness Centrality-based Circuit Partitioner for Quantum Simulations
    Doru-Thom Popovici, Harlin Lee, Naoki Yoshioka et al. · 2026 · International Conference on Supercomputing · cité 2 fois · Pas encore résumé
    Résumé scientifique

    Simulating quantum circuits (QC) on high-performance computing (HPC) systems is essential for validating quantum algorithms and probing the potential of large-scale quantum computation before the advent of scalable quantum hardware. However, state vector simulations are resource-intensive, often requiring large clusters with thousands of compute nodes and large amounts of memory. To address this, we introduce C-3PQ, an end-to-end framework that minimizes inter-node data movement through an efficient circuit partitioning scheme alongside a flexible code generator to offer a portable simulation solution. By formulating the distribution of the state vector and circuit over multiple nodes as a g…

Les travaux antérieurs sur lesquels il s’appuie

  1. Proche Une méthode qu’il utilise
    qHiPSTER: The Quantum High Performance Software Testing Environment
    M. Smelyanskiy, Nicolas P. D. Sawaya, Alán Aspuru-Guzik · 2016 · arXiv.org · preprint, non relu par les pairs · cité 215 fois · Pas encore résumé
    Résumé scientifique

    We present qHiPSTER, the Quantum High Performance Software Testing Environment. qHiPSTER is a distributed high-performance implementation of a quantum simulator on a classical computer, that can simulate general single-qubit gates and two-qubit controlled gates. We perform a number of single- and multi-node optimizations, including vectorization, multi-threading, cache blocking, as well as overlapping computation with communication. Using the TACC Stampede supercomputer, we simulate quantum circuits ("quantum software") of up to 40 qubits. We carry out a detailed performance analysis to show that our simulator achieves both high performance and high hardware efficiency, limited only by the s…

  2. Proche Une méthode qu’il utilise
    Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq
    S. Isakov, D. Kafri, O. Martin et al. · 2021 · cité 69 fois · Pas encore résumé
    Résumé scientifique

    We introduce multinode quantum trajectory simulations with qsim, an open source high performance simulator of quantum circuits. qsim can be used as a backend of Cirq, a Python software library for writing quantum circuits. We present a novel delayed inner product algorithm for quantum trajectories which can result in an order of magnitude speedup for low noise simulation. We also provide tools to use this framework in Google Cloud Platform, with high performance virtual machines in a single mode or multinode setting. Multinode configurations are well suited to simulate noisy quantum circuits with quantum trajectories. Finally, we introduce an approximate noise model for Google's experimental…

  3. Proche Une méthode qu’il utilise
    Validating quantum-classical programming models with tensor network simulations
    A. McCaskey, E. Dumitrescu, Mengsu Chen et al. · 2018 · PLoS ONE · cité 55 fois · Pas encore résumé
    Résumé scientifique

    The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, …

  4. Proche
    QUARK: A Framework for Quantum Computing Application Benchmarking
    Jernej Rudi Finžgar, Philipp Ross, Leonhard Hölscher et al. · 2022 · International Conference on Quantum Computing and Engineering · cité 68 fois · Pas encore résumé
    Résumé scientifique

    Quantum computing (QC) is anticipated to provide a speedup over classical approaches for specific problems in optimization, simulation, and machine learning. With the advances in quantum computing toward practical applications, the need to analyze and compare different quantum solutions is increasing. While different low-level benchmarks exist, they often do not provide sufficient insights into real-world application-level performance. We propose an application-centric benchmark method and the QUantum computing Application benchmaRK (QUARK) framework to foster the investigation and creation of application benchmarks for QC. This paper establishes three significant contributions: (1) it makes…

  5. Proche Une méthode qu’il utilise
    Large-Scale Simulation of Quantum Computational Chemistry on a New Sunway Supercomputer
    Honghui Shang, Limei Shen, Yi Fan et al. · 2022 · International Conference for High Performance Computing, Networking, Storage and Analysis · cité 37 fois · Pas encore résumé
    Résumé scientifique

    Quantum computational chemistry (QCC) is the use of quantum computers to solve problems in computational quantum chemistry. We develop a high performance variational quantum eigensolver (VQE) simulator for simulating quantum computational chemistry problems on a new Sunway supercomputer. The major innovations include: (1) a Matrix Product State (MPS) based VQE simulator to reduce the amount of memory needed and increase the simulation efficiency; (2) a combination of the Density Matrix Embedding Theory with the MPS-based VQE simulator to further extend the simulation range; (3) A three-level parallelization scheme to scale up to 20 million cores; (4) Usage of the Julia script language as the…

Les articles qui le citent

  1. Proche Utilise cet article en profondeur
    Simulation of Quantum Computers: Review and Acceleration Opportunities
    Alessio Cicero, M. Maleki, M. Azhar et al. · 2024 · ACM Transactions on Quantum Computing · cité 32 fois · Pas encore résumé
    Résumé scientifique

    Quantum computing has the potential to revolutionise multiple fields by solving complex problems that cannot be solved in reasonable time with current classical computers. Nevertheless, the development of quantum computers is still in its early stages and the available systems have still very limited resources. As such, currently, the most practical way to develop and test quantum algorithms is to use classical simulators of quantum computers. In addition, the development of new quantum computers and their components also depends on simulations. Given the characteristics of a quantum computer, their simulation is a very demanding application in terms of both computation and memory. As such, …

  2. Proche Utilise cet article en profondeur
    Autonomous Code Migration for Quantum Programming Languages: A Case Study with QED-C Benchmarks
    W. M. Brown, Thien Nguyen, Avimita Chatterjee et al. · 2026 · Pas encore résumé
    Résumé scientifique

    Quantum programming requires concepts and intuition that differ substantially from those used in traditional programming languages. Multiple quantum programming frameworks address these requirements through different abstractions and execution models, creating tradeoffs in programmability, portability, and performance. Because quantum software is less prevalent in the training data available to large language models, autonomous coding agents might be expected to face additional challenges when working with these frameworks. We present a case study in autonomous migration of the QED-C Application-Oriented Benchmarks from Qiskit to CUDA-Q. Opus, GPT, and Gemini models were each tasked with por…

  3. Proche Utilise cet article en profondeur
    QSimAdv: A Late-Bound, Vendor-Agnostic Architecture for High-Performance Quantum-Circuit Simulation
    Shu-Sen Liu, P. Elahi, Wen Sun et al. · 2026 · arXiv.org · preprint, non relu par les pairs · Pas encore résumé
    Résumé scientifique

    Portability in high-performance quantum-circuit simulation need not begin at the kernel. We present QSimAdv, which makes late binding, rather than a common kernel, the basis of vendor independence. Representation, operator lowering, and data placement are bound only when their required inputs become available. Before full-state allocation, circuit, noise, and output inspection can route eligible generic sampled-count requests to a stabiliser tableau; explicitly requested representations remain fixed. For full-state execution, backend constraints shape fusion; an ordered fused operator binds to a native lowering only after its physical targets are known. A first-class logical-to-physical layo…

  4. Proche Utilise cet article en profondeur
    Variance-Reduced Trajectory Unravelings for GPU Noisy Quantum-Circuit Simulation: Characterization and a Qiskit-Aer Integration Gap
    Chunbo You · 2026 · cité 2 fois · Pas encore résumé
    Résumé scientifique

    Monte-Carlo trajectory (quantum-jump) methods are the practical route to simulating noisy quantum circuits once the exact density-matrix method is precluded by its $4^n$ memory cost. Their bottleneck is estimator variance: resolving one expectation value can demand thousands of trajectories. Recent tensor-network work shows that \emph{variance-reduced unravelings} -- projector and analog sampling -- sharply cut this variance, but only on CPU matrix-product-state backends, with no path into production tooling. We implement both unravelings on a \emph{GPU dense-statevector} trajectory engine and validate them against the exact density matrix (ideal-circuit fidelity $1-2.2\times10^{-16}$; $1/\s…

  5. Proche Utilise cet article en profondeur
    Comparative analysis of quantum emulation for high-performance computing centers
    J. Bravo-Montes, Miriam Bastante, Cyril Allouche et al. · 2026 · International Conference on Advances in System Simulation · Pas encore résumé
    Résumé scientifique

    Quantum computing in the NISQ era requires advanced emulation tools to facilitate the development and validation of complex quantum algorithms, as current quantum devices remain too noisy and resource-limited. This work presents a comprehensive review of quantum emulation software available for HPC centers using various comparison metrics to evaluate parallelization, precision, acceleration via Graphics Processing Unit (GPU), emulation with noise, among others. The comparative analysis evaluates four quantum emulation frameworks (QuEST, Qaptiva HPC, CUDA-Q, and PennyLane) across three hardware platforms with distinct characteristics: two HPC clusters (Spartan-Eviden and Joliot-Curie TGCC) an…

Comment ces articles sont-ils trouvés ?

Nous comparons le titre et le résumé de cet article avec ceux de tous les articles résumés sur ce site, et avec les articles que Semantic Scholar recommande, ceux qu’il cite et ceux qui le citent (pour un article très cité, ses citations les plus récentes et, depuis OpenAlex, les plus citées). Parmi les travaux antérieurs et les suites, les articles qui s’utilisent en profondeur, une méthode qu’il utilise et les suites très citées remontent un peu. Les niveaux (très proche, proche, apparenté) viennent de la similarité des textes, pas d’un jugement de qualité ; * signale un article sans résumé, comparé par son titre. La phrase sous un article est écrite par une IA à partir des deux résumés : vérifiez-la dans les articles. Un article jugé hors sujet par trois lecteurs quitte la liste.

Mis à jour le 5 novembre 2026.

Le guide illustré des articles autour d’un article