paolini2017lncs (In proceedings)

Author(s)  Luca Paolini and Margherita Zorzi 
Title  « qPCF: a language for quantum circuit computations » 
In  14th Annual Conference on Theory and Applications of Models of Computation 
Series  Lecture Notes in Computer Science 
Editor(s)  T.V. Gopal, Gerhard Jäger and Silvia Steila 
Volume  10185 
Page(s)  455469 
Year  2017 
Publisher  Springer, Germany 
URL  http://dx.doi.org/10.1007/9783319559117_33 
Abstract 
We propose QPCF a functional language able to define and manipulate quantum circuits in an easy and intuitive way. QPCF follows the tradition of ``quantum data & classical control'' languages, inspired to the QRAM model. Ideally, QPCF computes finite circuit descriptions which are offloaded to a quantum coprocessor (i.e. a quantum device) for the execution. QPCF extends PCF with a new kind of datatype: quantum circuits. The typing of QPCF is quite different from the mainstream of ``quantum data & classical control'' languages that involves linear/exponential modalities. QPCF uses a simple form of dependent types to manage circuits and an implicit form of monad to manage quantum states via a destructivemeasurement operator. 
@inproceedings{paolini2017lncs,
volume = 10185,
author = {Paolini, Luca and Zorzi, Margherita},
series = {Lecture Notes in Computer Science},
booktitle = { 14th Annual Conference on Theory and Applications of Models of
Computation},
editor = {Gopal, T.V. and J{\"a}ger , Gerhard and Steila, Silvia},
url = {http://dx.doi.org/10.1007/9783319559117\_33},
abstract = { We propose QPCF a functional language able to define and
manipulate quantum circuits in an easy and intuitive way. QPCF
follows the tradition of ``quantum data \& classical control''
languages, inspired to the QRAM model. Ideally, QPCF computes
finite circuit descriptions which are offloaded to a quantum
coprocessor (i.e. a quantum device) for the execution. QPCF
extends PCF with a new kind of datatype: quantum circuits. The
typing of QPCF is quite different from the mainstream of ``quantum
data \& classical control'' languages that involves
linear/exponential modalities. QPCF uses a simple form of
dependent types to manage circuits and an implicit form of monad
to manage quantum states via a destructivemeasurement operator.
},
title = {{qPCF}: a language for quantum circuit computations},
tag = {Lecture Notes in Computer Science},
publisher = {Springer, Germany},
doi = {10.1007/9783319559117\_33},
year = 2017,
pages = {455469},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)