[HTML][HTML] Overview and comparison of gate level quantum software platforms

R LaRose - Quantum, 2019 - quantum-journal.org
Quantum computers are available to use over the cloud, but the recent explosion of quantum
software platforms can be overwhelming for those deciding on which to use. In this paper …

OpenQL: A portable quantum programming framework for quantum accelerators

N Khammassi, I Ashraf, JV Someren, R Nane… - ACM Journal on …, 2021 - dl.acm.org
With the potential of quantum algorithms to solve intractable classical problems, quantum
computing is rapidly evolving, and more algorithms are being developed and optimized …

A new connective in natural deduction, and its application to quantum computing

A Díaz-Caro, G Dowek - Theoretical Computer Science, 2023 - Elsevier
We investigate an unsuspected connection between logical connectives with non-
harmonious deduction rules, such as Prior's tonk, and quantum computing. We argue that …

Causality in higher order process theories

M Wilson, G Chiribella - arXiv preprint arXiv:2107.14581, 2021 - arxiv.org
Quantum supermaps provide a framework in which higher order quantum processes can act
on lower order quantum processes. In doing so, they enable the definition and analysis of …

Information at the threshold of interpretation: Science as human construction of sense

G Longo - A Critical Reflection on Automated Science: Will …, 2020 - Springer
This text will first discuss the great and productive “linguistic turn” that originated in Logic, at
the end of the nineteenth century. After Turing's work on the Logical Computing Machine …

QPCF: Higher-order languages and quantum circuits

L Paolini, M Piccolo, M Zorzi - Journal of Automated Reasoning, 2019 - Springer
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 …

Typing quantum superpositions and measurement

A Díaz-Caro, G Dowek - International Conference on Theory and Practice …, 2017 - Springer
We propose a way to unify two approaches of non-cloning in quantum lambda-calculi. The
first approach is to forbid duplicating variables, while the second is to consider all lambda …

On a class of reversible primitive recursive functions and its turing-complete extensions

L Paolini, M Piccolo, L Roversi - New Generation Computing, 2018 - Springer
Reversible computing is both forward and backward deterministic. This means that a
uniquely determined step exists from the previous computational configuration (backward …

[HTML][HTML] On natural deduction in classical first-order logic: Curry–Howard correspondence, strong normalization and Herbrand's theorem

F Aschieri, M Zorzi - Theoretical Computer Science, 2016 - Elsevier
We present a new Curry–Howard correspondence for classical first-order natural deduction.
We add to the lambda calculus an operator which represents, from the viewpoint of …

Linear lambda-calculus is linear

A Díaz-Caro, G Dowek - … on Formal Structures for Computation and …, 2022 - inria.hal.science
We prove a linearity theorem for an extension of linear logic with addition and multiplication
by a scalar: the proofs of some propositions in this logic are linear in the algebraic sense …