\textsc{qPCF}: a language for quantum circuit computations

DOI10.1007/978-3-319-55911-7_33MaRDI QIDQ2988843zbMATH OpenOpenAlexWikidataFDO

Authors Luca Paolini, Margherita Zorzi

Publication date 19 May 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-55911-7_33

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum measurement theory, state operations, state preparations (81P15) Quantum computation (81P68) Quantum control (81Q93)

Recommendations

• QPCF: higher-order languages and quantum circuits
• QWIRE: a core language for quantum circuits
• A categorical model for a quantum circuit description language (extended abstract)
• Quantum data and control made easier
• Quantum programming made easy

Cites work

• A class of reversible primitive recursive functions
• A lambda calculus for quantum computation with classical control
• An overview of QML with a concrete implementation in Haskell
• Applying quantitative semantics to higher-order quantum computing
• Confluence results for a quantum lambda calculus with measurements
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5076264 (Why is no real title available?)
• scientific article; zbMATH DE number 5162350 (Why is no real title available?)
• scientific article; zbMATH DE number 5708038 (Why is no real title available?)
• LCF considered as a programming language
• Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
• Linearity and PCF: a semantic insight!
• Modal deduction systems for quantum state transformations
• Non-determinism, non-termination and the strong normalization of System T
• On a measurement-free quantum lambda calculus with classical control
• On quantum lambda calculi: a foundational perspective
• On the reification of semantic linearity
• Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
• Probabilistic operational semantics for the lambda calculus
• Quantum implicit computational complexity
• Quantum State Transformations and Branching Distributed Temporal Logic
• Semantics of higher-order quantum computation via geometry of interaction
• Towards a quantum programming language
• Types and programing languages

Cited in

(8)

• The fixed point problem of a simple reversible language
• A logic for quantum register measurements
• QPCF: higher-order languages and quantum circuits
• qPCF
• A categorical model for a quantum circuit description language (extended abstract)
• Quantum programming made easy
• Sized Types for Low-Level Quantum Metaprogramming
• QWIRE: a core language for quantum circuits

Describes a project that uses

Uses Software

• QWire

This page was built for publication: \textsc{qPCF}: a language for quantum circuit computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988843)