$$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations
From MaRDI portal
Publication:2988843
DOI10.1007/978-3-319-55911-7_33zbMath1462.81061OpenAlexW2602553693WikidataQ57722139 ScholiaQ57722139MaRDI QIDQ2988843
Margherita Zorzi, Luca Paolini
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
Quantum computation (81P68) Functional programming and lambda calculus (68N18) Quantum measurement theory, state operations, state preparations (81P15) Quantum control (81Q93) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (5)
Unnamed Item ⋮ The fixed point problem of a simple reversible language ⋮ A logic for quantum register measurements ⋮ qPCF ⋮ QPCF: higher-order languages and quantum circuits
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantics of higher-order quantum computation via geometry of interaction
- A class of reversible primitive recursive functions
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Quantum implicit computational complexity
- LCF considered as a programming language
- An Overview of QML With a Concrete Implementation in Haskell
- Confluence Results for a Quantum Lambda Calculus with Measurements
- Probabilistic operational semantics for the lambda calculus
- Quantum State Transformations and Branching Distributed Temporal Logic
- On quantum lambda calculi: a foundational perspective
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- On a measurement-free quantum lambda calculus with classical control
- Towards a quantum programming language
- Linearity and PCF
- Non-determinism, Non-termination and the Strong Normalization of System T
- Applying quantitative semantics to higher-order quantum computing
- A lambda calculus for quantum computation with classical control
- On the reification of semantic linearity
- Foundations of Software Science and Computation Structures
This page was built for publication: $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations
