Quantum computing review: A decade of research

SK Sood - IEEE Transactions on Engineering Management, 2023 - ieeexplore.ieee.org
Quantum computing (QC) has the potential to be the next abstruse technology, with a wide
range of possible applications and ramifications for organizations and markets. QC provides …

[PDF][PDF] An automated deductive verification framework for circuit-building quantum programs

C Chareton, S Bardin, F Bobot, V Perrelle… - … and Systems: 30th …, 2021 - library.oapen.org
While recent progress in quantum hardware open the door for significant speedup in certain
key areas, quantum algorithms are still hard to implement right, and the validation of such …

On quantum lambda calculi: a foundational perspective

M Zorzi - Mathematical Structures in Computer Science, 2016 - cambridge.org
In this paper, we propose an approach to quantum λ-calculi. The 'quantum data-classical
control'paradigm is considered. Starting from a measurement-free untyped quantum λ …

[PDF][PDF] A Programming Language Characterizing Quantum Polynomial Time.

E Hainry, R Péchoux, M Silva - FoSSaCS, 2023 - library.oapen.org
We introduce a first-order quantum programming language, named foq, whose terminating
programs are reversible. We restrict foq to a strict and tractable subset, named pfoq, of …

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 …

: A Language for Quantum Circuit Computations

L Paolini, M Zorzi - International Conference on Theory and Applications of …, 2017 - Springer
We propose qPCF, a functional language able to define and manipulate quantum circuits in
an easy and intuitive way. qPCF follows the tradition of “quantum data & classical control” …

[HTML][HTML] A higher-order characterization of probabilistic polynomial time

U Dal Lago, PP Toldin - Information and Computation, 2015 - Elsevier
We present RSLR, an implicit higher-order characterization of the class PP of those
problems which can be decided in probabilistic polynomial time with error probability …

Circuit Width Estimation via Effect Typing and Linear Dependency

A Colledan, U Dal Lago - European Symposium on Programming, 2024 - Springer
Circuit description languages are a class of quantum programming languages in which
programs are classical and produce a description of a quantum computation, in the form of a …

Formalization of metatheory of the quipper quantum programming language in a linear logic

MY Mahmoud, AP Felty - Journal of Automated Reasoning, 2019 - Springer
We develop a linear logical framework within the Hybrid system and use it to reason about
the type system of a quantum lambda calculus. In particular, we consider a practical version …

[HTML][HTML] A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations

L Vigano, M Volpe, M Zorzi - Information and Computation, 2017 - Elsevier
Abstract The Distributed Temporal Logic DTL allows one to reason about temporal
properties of a distributed system from the local point of view of the system's agents, which …