Related papers: Quantum Hoare Type Theory
Dynamically typed object-oriented languages enable programmers to write elegant, reusable and extensible programs. However, with the current methodology for program verification, the absence of static type information creates significant…
Quantum resource theories (QRTs) offer a highly versatile and powerful framework for studying different phenomena in quantum physics. From quantum entanglement to quantum computation, resource theories can be used to quantify a desirable…
Most modern (classical) programming languages support recursion. Recursion has also been successfully applied to the design of several quantum algorithms and introduced in a couple of quantum programming languages. So, it can be expected…
We present a variant of the quantum relational Hoare logic from (Unruh, POPL 2019) that allows us to use "expectations" in pre- and postconditions. That is, when reasoning about pairs of programs, our logic allows us to quantitatively…
Quantum simulations are designed to model quantum systems, and many compilation frameworks have been developed for executing such simulations on quantum computers. Most compilers leverage the capabilities of digital and analog quantum…
Quantum hypothesis testing (QHT) concerns the statistical inference of unknown quantum states. In the general setting of composite hypotheses, the goal of QHT is to determine whether an unknown quantum state belongs to one or another of two…
Quantum decision theory (QDT) is a recently developed theory of decision making based on the mathematics of Hilbert spaces, a framework known in physics for its application to quantum mechanics. This framework formalizes the concept of…
The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…
Basic concepts of quantum theory of information, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are briefly reviewed.…
Many computationally hard problems can be encoded in quantum Hamiltonians. The solution to these problems is given by the ground states of these Hamiltonians. A state-of-the-art algorithm for finding the ground state of a Hamiltonian is the…
Quantum process tomography (QPT) methods aim at identifying a given quantum process. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the…
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…
Inductive datatypes in programming languages allow users to define useful data structures such as natural numbers, lists, trees, and others. In this paper we show how inductive datatypes may be added to the quantum programming language QPL.…
Quantum Phase Transition (QPT) is a phase transition between different quantum states by adjusting some control parameters. Based on the Principle of Hamilton Dynamics (PHD) and the Principle of Lagrangian Dynamics (PLD), a general QPT…
Abstract interpretation, Hoare logic, and incorrectness (or reverse Hoare) logic are powerful techniques for static analysis of computer programs. All of them have been successfully extended to the quantum setting, but largely developed in…
The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of…
The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine…
Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by having it follow from…
Quantum computing is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for quantum computing were designed with fault-tolerant hardware in…