QCLAB++: Simulating Quantum Circuits on GPUs

• URL: http://arxiv.org/abs/2303.00123v1
• Date: Tue, 28 Feb 2023 22:56:48 GMT
• Title: QCLAB++: Simulating Quantum Circuits on GPUs
• Authors: Roel Van Beeumen, Daan Camps, Neil Mehta
• Abstract summary: We introduce qclab++, a light-weight, fully-templated C++ package for GPU-accelerated quantum circuit simulations. qclab++ is designed for performance and numerical stability through highly optimized gate simulation algorithms. We also introduce qclab, a quantum circuit toolbox for Matlab with a syntax that mimics qclab++.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce qclab++, a light-weight, fully-templated C++ package for GPU-accelerated quantum circuit simulations. The code offers a high degree of portability as it has no external dependencies and the GPU kernels are generated through OpenMP offloading. qclab++ is designed for performance and numerical stability through highly optimized gate simulation algorithms for 1-qubit, controlled 1-qubit, and 2-qubit gates. Furthermore, we also introduce qclab, a quantum circuit toolbox for Matlab with a syntax that mimics qclab++. This provides users the flexibility and ease of use of a scripting language like Matlab for studying their quantum algorithms, while offering high-performance GPU acceleration when required. As such, the qclab++ library offers a unique combination of features. We compare the CPU simulator in qclab++ with the GPU kernels generated by OpenMP and observe a speedup of over $40\times$. Furthermore, we also compare qclab++ to other circuit simulation packages, such as cirq-qsim and qibo, in a series of benchmarks conducted on NERSC's Perlmutter system and illustrate its competitiveness.

Related papers

• GPU-accelerated Effective Hamiltonian Calculator [70.12254823574538]
  We present numerical techniques inspired by Nonperturbative Analytical Diagonalization (NPAD) and the Magnus expansion for the efficient calculation of effective Hamiltonians. Our numerical techniques are available as an open-source Python package, $rm qCH_eff$.
  arXiv  Detail & Related papers  (2024-11-15T06:33:40Z)
• Atlas: Hierarchical Partitioning for Quantum Circuit Simulation on GPUs (Extended Version) [9.483321080040131]
  This paper presents techniques for theoretically and practically efficient and scalable quantum circuit simulation. Our approach partitions a quantum circuit into a hierarchy of subcircuits and simulates subcircuits on multi-node GPU. To minimize communication costs, we formulate an Linear Program that rewards simulation of "nearby" gates on "nearby" To maximize throughput, we use a dynamic programming algorithm to compute the subcircuit simulated by each kernel at a GPU.
  arXiv  Detail & Related papers  (2024-08-17T00:34:43Z)
• Fast Simulation of High-Depth QAOA Circuits [10.778538580079365]
  We present a simulator for the Quantum Approximate Optimization Algorithm (QAOA) Our simulator is designed with the goal of reducing the computational cost of QAOA parameter optimization. We reduce the time for a typical QAOA parameter optimization by eleven times for $n = 26$ qubits compared to a state-of-the-art GPU quantum circuit simulator based on cuQuantum.
  arXiv  Detail & Related papers  (2023-09-09T17:01:29Z)
• Classically Simulating Quantum Supremacy IQP Circuits trough a Random Graph Approach [0.0]
  A good candidate for demonstrating quantum supremacy with random circuit sampling is to use emphIQP circuits. We introduce improved techniques for classically simulating random IQP circuits. We estimate that 70-qubit circuits are within reach for a large computing cluster.
  arXiv  Detail & Related papers  (2022-12-16T17:38:42Z)
• Performance Evaluation and Acceleration of the QTensor Quantum Circuit Simulator on GPUs [6.141912076989479]
  We implement NumPy, PyTorch, and CuPy backends and benchmark the codes to find the optimal allocation of tensor simulations to either a CPU or a GPU. Our method achieves $176times$ speedup on a GPU over the NumPy baseline on a CPU for the benchmarked QAOA circuits to solve MaxCut problem.
  arXiv  Detail & Related papers  (2022-04-12T19:03:44Z)
• PLSSVM: A (multi-)GPGPU-accelerated Least Squares Support Vector Machine [68.8204255655161]
  Support Vector Machines (SVMs) are widely used in machine learning. However, even modern and optimized implementations do not scale well for large non-trivial dense data sets on cutting-edge hardware. PLSSVM can be used as a drop-in replacement for an LVM.
  arXiv  Detail & Related papers  (2022-02-25T13:24:23Z)
• Fast quantum circuit simulation using hardware accelerated general purpose libraries [69.43216268165402]
  CuPy is a general purpose library (linear algebra) developed specifically for GPU-based quantum circuits. For supremacy circuits the speedup is around 2x, and for quantum multipliers almost 22x compared to state-of-the-art C++-based simulators.
  arXiv  Detail & Related papers  (2021-06-26T10:41:43Z)
• Extending Python for Quantum-Classical Computing via Quantum Just-in-Time Compilation [78.8942067357231]
  Python is a popular programming language known for its flexibility, usability, readability, and focus on developer productivity. We present a language extension to Python that enables heterogeneous quantum-classical computing via a robust C++ infrastructure for quantum just-in-time compilation.
  arXiv  Detail & Related papers  (2021-05-10T21:11:21Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)

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.