QPCF: higher-order languages and quantum circuits
From MaRDI portal
Publication:2331073
DOI10.1007/s10817-019-09518-yzbMath1468.68049arXiv1809.05723OpenAlexW2891621506WikidataQ128232989 ScholiaQ128232989MaRDI QIDQ2331073
Margherita Zorzi, Luca Paolini, Mauro Piccolo
Publication date: 25 October 2019
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.05723
Related Items (4)
Quantum symbolic execution ⋮ Unnamed Item ⋮ An automated deductive verification framework for circuit-building quantum programs ⋮ qPCF
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
- Semantics of higher-order quantum computation via geometry of interaction
- Quantum computation: from a programmer's perspective
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
- Constructive quantum scaling of unitary matrices
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- 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
- Indexed types
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Quantum computation by measurement and quantum memory
- Algorithmic probabilistic game semantics. Playing games with automata
- A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations
- A stable programming language
- Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
- Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits
- An Overview of QML With a Concrete Implementation in Haskell
- Confluence Results for a Quantum Lambda Calculus with Measurements
- An Algebra of Pure Quantum Programming
- An Introduction to Quantum Programming in Quipper
- A System F accounting for scalars
- Probabilistic operational semantics for the lambda calculus
- Quantum State Transformations and Branching Distributed Temporal Logic
- On quantum lambda calculi: a foundational perspective
- $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations
- Quantum Computation and Quantum Information
- A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- The measurement calculus
- On a measurement-free quantum lambda calculus with classical control
- The algebraic lambda calculus
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Full Abstraction for Probabilistic PCF
- Towards a quantum programming language
- Lectures on Quantum Theory
- Non-determinism, Non-termination and the Strong Normalization of System T
- QWIRE: a core language for quantum circuits
- QIP = PSPACE
- Applying quantitative semantics to higher-order quantum computing
- Quantum Computing
- A lambda calculus for quantum computation with classical control
- Logic for Programming, Artificial Intelligence, and Reasoning
- On the reification of semantic linearity
- Foundations of Software Science and Computation Structures
This page was built for publication: QPCF: higher-order languages and quantum circuits
