Quantum Computing lies at the frontier of computing, offering a radically different and unconventional model of computation. In the absence of practical quantum computers today, we must simulate their execution. This creates a performance problem, as quantum computing simulation is very costly. However, quantum computing simulation does contain an abundance of parallelism. The research question becomes: how to expose this parallelism? Although it is easy to show the problem inherently contains a large amount of parallelism, the type of parallelism is non-trivial to exploit in a scalable way using current mainstream parallelization techniques. This paper presents the formulation a virtual machine for quantum computing as a fine-grained dataflow schema, which aims to expose and exploit the abundance of parallelism in a way that avoids the observed scalability issues. We present the formal mapping from the linear algebra description of elementary quantum operations to dataflow graphs, analyze its theoretical parallel characteristics and present experimental performance results of a prototype implementation.
Original languageEnglish
Title of host publicationWorkshop on Data-Flow Execution Models for Extreme Scale Computing (DFM 2013), co-located with PACT
Number of pages9
Publication statusPublished - 2013
EventWorkshop on Data-Flow Execution Models for Extreme Scale Computing - Edinburgh, United Kingdom
Duration: 8 Sep 20138 Sep 2013

Workshop

WorkshopWorkshop on Data-Flow Execution Models for Extreme Scale Computing
CountryUnited Kingdom
CityEdinburgh
Period8/09/138/09/13

    Research areas

  • parallel computing, quantum computing, dataflow, virtual machines

ID: 20485787