BGLS: A Python Package for the Gate-by-Gate Sampling Algorithm to Simulate Quantum Circuits
arXiv:2311.11787 · doi:10.1145/3624062.3624215
Abstract
The classical simulation of quantum computers is in general a computationally hard problem. To emulate the behavior of realistic devices, it is sufficient to sample bitstrings from circuits. Recently, arXiv:2112.08499 introduced the so-called gate-by-gate sampling algorithm to sample bitstrings and showed it to be computationally favorable in many cases. Here we present bgls, a Python package which implements this sampling algorithm. bgls has native support for several states and is highly flexible for use with additional states. We show how to install and use bgls, discuss optimizations in the algorithm, and demonstrate its utility on several problems.
arXiv comment7 pages, 9 figures, included in Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis (SC-W 2023)
References in corpus (12)
- A Quantum Approximate Optimization Algorithm
- Improved Simulation of Stabilizer Circuits
- Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Resource-Aware Quantum Programming with General Recursion and Quantum Control
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Simulation of quantum circuits by low-rank stabilizer decompositions
- What limits the simulation of quantum computers?
- Tensor Networks in a Nutshell
- How to simulate quantum measurement without computing marginals
- BGLS: A Python Package for the Gate-by-Gate Sampling Algorithm to Simulate Quantum Circuits