Standard

A highly-parallel formulation of quantum computing simulation through fine-grained dataflow. / Vandriessche, Yves; D'Hondt, Ellie; Van Cutsem, Tom; D'Hondt, Theo.

Workshop on Data-Flow Execution Models for Extreme Scale Computing (DFM 2013), co-located with PACT. 2013.

Research output: Chapter in Book/Report/Conference proceedingMeeting abstract (Book)

Harvard

Vandriessche, Y, D'Hondt, E, Van Cutsem, T & D'Hondt, T 2013, A highly-parallel formulation of quantum computing simulation through fine-grained dataflow. in Workshop on Data-Flow Execution Models for Extreme Scale Computing (DFM 2013), co-located with PACT. Workshop on Data-Flow Execution Models for Extreme Scale Computing, Edinburgh, United Kingdom, 8/09/13.

APA

Vandriessche, Y., D'Hondt, E., Van Cutsem, T., & D'Hondt, T. (2013). A highly-parallel formulation of quantum computing simulation through fine-grained dataflow. In Workshop on Data-Flow Execution Models for Extreme Scale Computing (DFM 2013), co-located with PACT

Vancouver

Vandriessche Y, D'Hondt E, Van Cutsem T, D'Hondt T. A highly-parallel formulation of quantum computing simulation through fine-grained dataflow. In Workshop on Data-Flow Execution Models for Extreme Scale Computing (DFM 2013), co-located with PACT. 2013

Author

Vandriessche, Yves ; D'Hondt, Ellie ; Van Cutsem, Tom ; D'Hondt, Theo. / A highly-parallel formulation of quantum computing simulation through fine-grained dataflow. Workshop on Data-Flow Execution Models for Extreme Scale Computing (DFM 2013), co-located with PACT. 2013.

BibTeX

@inbook{fbdaf2dff0f74a19ba0776450f6c8178,
title = "A highly-parallel formulation of quantum computing simulation through fine-grained dataflow",
abstract = "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.",
keywords = "parallel computing, quantum computing, dataflow, virtual machines",
author = "Yves Vandriessche and Ellie D'Hondt and {Van Cutsem}, Tom and Theo D'Hondt",
year = "2013",
language = "English",
booktitle = "Workshop on Data-Flow Execution Models for Extreme Scale Computing (DFM 2013), co-located with PACT",

}

RIS

TY - CHAP

T1 - A highly-parallel formulation of quantum computing simulation through fine-grained dataflow

AU - Vandriessche, Yves

AU - D'Hondt, Ellie

AU - Van Cutsem, Tom

AU - D'Hondt, Theo

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - parallel computing

KW - quantum computing

KW - dataflow

KW - virtual machines

M3 - Meeting abstract (Book)

BT - Workshop on Data-Flow Execution Models for Extreme Scale Computing (DFM 2013), co-located with PACT

ER -

ID: 20485787