scientific article; zbMATH DE number 7450006

zbMath1486.68024arXiv1711.00774MaRDI QIDQ5018491

Luca Roversi, Margherita Zorzi, Luca Paolini

Publication date: 20 December 2021

Full work available at URL: https://arxiv.org/abs/1711.00774

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Quantum computation (81P68) Theory of programming languages (68N15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

The fixed point problem of a simple reversible language ⋮ QPCF: higher-order languages and quantum circuits

Cites Work

• 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
• A class of reversible primitive recursive functions
• An approach to deciding the observational equivalence of Algol-like languages
• A class of recursive permutations which is primitive recursive complete
• QPCF: higher-order languages and quantum circuits
• Formal meta-level analysis framework for quantum programming languages
• A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations
• A stable programming language
• Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits
• An Overview of QML With a Concrete Implementation in Haskell
• An Introduction to Quantum Programming in Quipper
• 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)
• On the Power of Quantum Computation
• Towards a quantum programming language
• Non-determinism, Non-termination and the Strong Normalization of System T
• Computational Complexity
• QWIRE: a core language for quantum circuits
• Applying quantitative semantics to higher-order quantum computing
• A lambda calculus for quantum computation with classical control
• Probabilistic game semantics

This page was built for publication: