Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

paolini2019jar (Article)
Author(s) Luca Paolini, Mauro Piccolo and Margherita Zorzi
Title« QPCF: Higher-Order Languages and Quantum Circuits »
JournalJournal of Automated Reasoning
Volume63
Number4
Page(s)941--966
Year2019
ISSN number1573-0670
URLhttps://doi.org/10.1007/s10817-019-09518-y
Abstract
qPCF is a paradigmatic quantum programming language that extends PCF with quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data that can be duplicated and manipulated in flexible ways by means of a dependent type system. The co-processor is essentially a standard QRAM device, albeit we avoid to store permanently quantum states in between two co-processor's calls. Despite its quantum features, qPCF retains the classic programming approach of PCF. We introduce qPCF syntax, typing rules, and its operational semantics. We prove fundamental syntactic properties of the system. Moreover, we provide some higher-order examples of circuit encoding.

BibTeX code

@article{paolini2019jar,
  number = {4},
  volume = {63},
  month = {Dec},
  issn = {1573-0670},
  author = {Paolini, Luca and Piccolo, Mauro and Zorzi, Margherita},
  url = {https://doi.org/10.1007/s10817-019-09518-y},
  day = {01},
  abstract = {qPCF is a paradigmatic quantum programming language that extends
              PCF with quantum circuits and a quantum co-processor. Quantum
              circuits are treated as classical data that can be duplicated and
              manipulated in flexible ways by means of a dependent type system.
              The co-processor is essentially a standard QRAM device, albeit we
              avoid to store permanently quantum states in between two
              co-processor's calls. Despite its quantum features, qPCF retains
              the classic programming approach of PCF. We introduce qPCF syntax,
              typing rules, and its operational semantics. We prove fundamental
              syntactic properties of the system. Moreover, we provide some
              higher-order examples of circuit encoding.},
  title = {QPCF: Higher-Order Languages and Quantum Circuits},
  doi = {10.1007/s10817-019-09518-y},
  pages = {941--966},
  journal = {Journal of Automated Reasoning},
  year = {2019},
}


 Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)

Valid HTML 4.01!