Related papers: Reconstructing quantum theory from diagrammatic po…
It is quite common to use the generalized probabilistic theories (GPTs) as generic models to reconstruct quantum theory from a few basic principles and to gain a better understanding of the probabilistic or information theoretic foundations…
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate "quantum supremacy": that is, a clear…
We put forward a reconstruction scheme prompted by the relation between a von Neumann measurement and the corresponding informationally complete measurement induced in a relevant reconstruction subspace. This method is specially suited for…
We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of…
To date, there has been no experimental evidence that invalidates quantum theory. Yet it may only be an effective description of the world, in the same way that classical physics is an effective description of the quantum world. We ask…
Automated theorem proving, or more broadly automated reasoning, aims at using computer programs to automatically prove or disprove mathematical theorems and logical statements. It takes on an essential role across a vast array of…
Quantum theory combines density matrices, Born probabilities, tensor-product composites, positive-operator-valued measures (POVMs), and quantum channels. In a finite-dimensional causal operational theory, we prove that two postulates…
Classical particle mechanics on curved spaces is related to the flow of ideal fluids, by a dual interpretation of the Hamilton-Jacobi equation. As in second quantization, the procedure relates the description of a system with a finite…
Feynman's formulation of quantum theory is remarkable in its combination of formal simplicity and computational power. However, as a formulation of the abstract structure of quantum theory, it is incomplete as it does not account for most…
A remarkable feature of quantum theory is that particles with identical intrinsic properties must be treated as indistinguishable if the theory is to give valid predictions. In the quantum formalism, indistinguishability is expressed via…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
The impressive pace of advance of quantum technology calls for robust and scalable techniques for the characterization and validation of quantum hardware. Quantum process tomography, the reconstruction of an unknown quantum channel from…
In this paper, we show how information geometry, the natural geometry of discrete probability distributions, can be used to derive the quantum formalism. The derivation rests upon three elementary features of quantum phenomena, namely…
Quantum processes, including quantum gates and channels, are integral to various quantum information tasks, making the efficient characterization of these processes and their underlying noise critically important. Here, we propose a…
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…
Modern quantum engineering techniques enabled successful foundational tests of quantum mechanics. Yet, the universal validity of quantum postulates is an open question. Here we propose a new theoretical framework of Q-data tests, which…
Besides the standard quantum version of the Coulomb/Kepler problem, an alternative quantum model with not too dissimilar phenomenological (i.e., spectral and scattering) as well as mathematical (i.e., exact-solvability) properties may be…
Impressive progress has been made in the past decade in the study of technological applications of varied types of quantum systems. With industry giants like IBM laying down their roadmap for scalable quantum devices with more than…
We introduce the concept of a physical process that purifies a mixed quantum state, taken from a set of states, and investigate the conditions under which such a purification map exists. Here, a purification of a mixed quantum state is a…
We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…