Related papers: A feasible and unitary quantum programming languag…
We develop an algebraic frame for the simultaneous treatment of actual and possible properties of quantum systems. We show that, in spite of the fact that the language is enriched with the addition of a modal operator to the orthomodular…
Resetting a system's state plays a fundamental role in physics, engineering, computer science, and many other fields. Here we focus on a method originally proposed in automata theory. The state of an automaton evolves according to a set of…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…
Quantum computing leverages the principles of quantum mechanics to perform computations far beyond the capabilities of classical systems, particularly in fields such as cryptography and optimization. However, current quantum programming…
Although the laws of classical physics are deterministic, thermodynamics gives rise to an arrow of time through irreversible processes. In quantum mechanics the unitary nature of the time evolution makes it intrinsically reversible, however…
We present an imperative quantum programming language LanQ which was designed to support combination of quantum and classical programming and basic process operations - process creation and interprocess communication. The language can thus…
Polynomial--time constant--space quantum Turing machines (QTMs) and logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakary\i lmaz 2014, arXiv:1411.7647). In this…
Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was proposed as an imperative programming language for quantum…
Creating quantum algorithms is a difficult task, especially for computer scientist not used to quantum computing. But quantum algorithms often use similar elements. Thus, these elements provide proven solutions to recurring problems, i.e. a…
We set up a parametrised monadic translation for a class of call-by-value functional languages, and prove a corresponding soundness theorem. We then present a series of concrete instantiations of our translation, demonstrating that a number…
Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an…
Quantum signal processing (QSP) is a framework which was proven to unify and simplify a large number of known quantum algorithms, as well as discovering new ones. QSP allows one to transform a signal embedded in a given unitary using…
We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive…
We show that recent approaches of static analysis based on quantitative typing systems can be extended to programming languages with global state. More precisely, we define a call-by-value language equipped with operations to access a…
We present the quantum programming language cQPL which is an extended version of QPL [P. Selinger, Math. Struct. in Comp. Sci. 14(4):527-586, 2004]. It is capable of quantum communication and it can be used to formulate all possible quantum…
A quantum codeword is a redundant representation of a logical qubit by means of several physical qubits. It is constructed in such a way that if one of the physical qubits is perturbed, for example if it gets entangled with an unknown…
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.…
Based on ideas of quantum theory of open systems we propose the consistent approach to the formulation of logic of plausible propositions. To this end we associate with every plausible proposition diagonal matrix of its likelihood and…
Overcoming the influence of noise and imperfections is a major challenge in quantum computing. Here, we present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary…
The quantum singular value transformation has revolutionised quantum algorithms. By applying a polynomial to an arbitrary matrix, it provides a unifying picture of quantum algorithms. However, polynomials are restricted to definite parity…