Related papers: Bisimulation for quantum processes
We introduce a protocol addressing the conformance test problem, which consists in determining whether a process under test conforms to a reference one. We consider a process to be characterized by the set of end-product it produces, which…
This chapter is a short pedagogical introduction to the use of quantum logic for the simulation of complex quantum systems, including a simulation example on actual quantum hardware.
In the Bayesian approach to probability theory, probability quantifies a degree of belief for a single trial, without any a priori connection to limiting frequencies. In this paper we show that, despite being prescribed by a fundamental…
Quantum computers are expected to offer substantial speedups over their classical counterparts and to solve problems that are intractable for classical computers. Beyond such practical significance, the concept of quantum computation opens…
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…
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is applied to a typed, call-by-value, lambda-calculus.…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…
Linearizability and progress properties are key correctness notions for concurrent objects. However, model checking linearizability has suffered from the PSPACE-hardness of the trace inclusion problem. This paper proposes to exploit…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
Approximation based on perturbation theory is the foundation for most of the quantitative predictions of quantum mechanics, whether in quantum many-body physics, chemistry, quantum field theory or other domains. Quantum computing provides…
Classical simulation is important because it sets a benchmark for quantum computer performance. Classical simulation is currently the only way to exercise larger numbers of qubits. To achieve larger simulations, sparse matrix processing is…
A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and new sequences are ``refuelled'' from a shared provably…
In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highlighted recently. Currently, most of efficient quantum…
The advent of hybrid computing platforms consisting of quantum processing units integrated with conventional high-performance computing brings new opportunities for algorithm design. By strategically offloading select portions of the…
The act of describing how a physical process changes a system is the basis for understanding observed phenomena. For quantum-mechanical processes in particular, the affect of processes on quantum states profoundly advances our knowledge of…
It is well known in quantum optics that any process involving the preparation of a multimode gaussian state, followed by a gaussian operation and gaussian measurements, can be efficiently simulated by classical computers. Here, we provide…
Time evolution of quantum systems is of interest in physics, in chemistry, and, more recently, in computer science. Quantum computers are suggested as one route to propagating quantum systems far more efficiently than ordinary numerical…
In this introductory review, we focus on applications of quantum computation to problems of interest in physics and chemistry. We describe quantum simulation algorithms that have been developed for electronic-structure problems,…
Despite their importance as subfields of mathematics and engineering, signal and image processing have not received much attention in the field of quantum computation. Cross-correlations are instrumental to all the aforementioned fields. In…