Concurrency in DD-based Quantum Circuit Simulation
Authors:
- 1 January 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 115-120
Abstract
Despite recent progress in physical implementations of quantum computers, a significant amount of research still depends on simulating quantum computations on classical computers. Here, most state-of-the-art simulators rely on array-based approaches which are perfectly suited for acceleration through concurrency using multi- or many-core processors. However, those methods have exponential memory complexities and, hence, become infeasible if the considered quantum circuits are too large. To address this drawback, complementary approaches based on decision diagrams (called DD-based simulation) have been proposed which provide more compact representations in many cases. While this allows to simulate quantum circuits that could not be simulated before, it is unclear whether DD-based simulation also allows for similar acceleration through concurrency as array-based approaches. In this work, we investigate this issue. The resulting findings provide a better understanding about when DD-based simulation can be accelerated through concurrent executions of sub-tasks and when not.Keywords
This publication has 12 references indexed in Scilit:
- Characterizing quantum supremacy in near-term devicesNature Physics, 2018
- Low-Depth Quantum Simulation of MaterialsPhysical Review X, 2018
- ProjectQ: an open source software framework for quantum computingQuantum, 2018
- Quantum algorithms: an overviewnpj Quantum Information, 2016
- QMDDs: Efficient Quantum Function Representation and ManipulationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2015
- Improved BDD Algorithms for the Simulation of Quantum Circuits2008
- High-performance QuIDD-based simulation of quantum circuits2004
- Algorithms for quantum computation: discrete logarithms and factoring2002
- Efficient implementation of a BDD package2002
- A fast quantum mechanical algorithm for database search1996