Related papers: Paraconsistent Foundations for Quantum Probability
I consider the "Quantum Bayesian" view of quantum theory as expounded in a 2006 paper of Caves, Fuchs, and Schack. I argue that one can accept a generally personalist, decision-theoretic view of probability, including probability as…
In this paper, we show that coherent sets of gambles and coherent lower and upper previsions can be embedded into the algebraic structure of information algebra. This leads firstly, to a new perspective of the algebraic and logical…
The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising…
We derive a computable analytical formula for the quantum fidelity between two arbitrary multimode Gaussian states which is simply expressed in terms of their first- and second-order statistical moments. We also show how such a formula can…
Estimation of unknown qubit elementary gates and alignment of reference frames are formally the same problem. Using quantum states made out of $N$ qubits, we show that the theoretical precision limit for both problems, which behaves as…
This paper proposes a general quantum algorithm that can be applied to any classical computer program. Each computational step is written using reversible operators, but the operators remain classical in that the qubits take on values of…
Probabilistic logic programs are logic programs where some facts hold with a specified probability. Here, we investigate these programs with a causal framework that allows counterfactual queries. Learning the program structure from…
The uncertainty relation is a fundamental concept in quantum theory, plays a pivotal role in various quantum information processing tasks. In this study, we explore the additive uncertainty relation pertaining to two or more observables, in…
Errors in quantum computers are of two kinds: sudden perturbations to isolated qubits, and slow random drifts of all the qubits. The latter may be reduced, but not eliminated, by means of symmetrization, namely by using many replicas of the…
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
The predictions that quantum theory makes about the outcomes of measurements are generally probabilistic. This has raised the question whether quantum theory can be considered complete, or whether there could exist alternative theories that…
Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…
We consider some natural connections which arise between right-flat (p, q) paraconformal structures and integrable systems. We find that such systems may be formulated in Lax form, with a "Lax p-tuple" of linear differential operators,…
Quantum measurements with feed-forward are crucial components of fault-tolerant quantum computers. We show how the error rate of such a measurement can be directly estimated by fitting the probability that successive randomly compiled…
This note is intended to foster a discussion about the extent to which typical problems arising in quantum information theory are algorithmically decidable (in principle rather than in practice). Various problems in the context of…
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate.Moreover, to model concurrent and…
Covariant codes are quantum codes such that a symmetry transformation on the logical system could be realized by a symmetry transformation on the physical system, usually with limited capability of performing quantum error correction (an…
In many physical systems it is expected that environmental decoherence will exhibit an asymmetry between dephasing and relaxation that may result in qubits experiencing discrete phase errors more frequently than discrete bit errors. In the…
The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…
Query complexity measures the amount of information an algorithm needs about a problem to compute a solution. On a quantum computer there are different realizations of a query and we will show that these are not always equivalent. Our…