Operational Probabilistic Theories Research Articles

Incompatibility of observables, channels and instruments in information theories

Every theory of information, including classical and quantum, can be studied in the framework of operational probabilistic theories—where the notion of test generalizes that of quantum instrument, namely a collection of quantum operations summing to a channel, and simple rules are given for the composition of tests in parallel and in sequence. Here we study the notion of compatibility for tests of a causal operational probabilistic theory. Following the quantum literature, we first introduce the notion of strong compatibility, and then we illustrate its ultimate relaxation, that we deem weak compatibility. It is shown that the two notions coincide in the case of observation tests—which are the counterpart of quantum POVMs—while there exist weakly compatible channels that are not strongly compatible. We prove necessary and sufficient conditions for a theory to exhibit incompatible tests. We show that a theory admits of incompatible tests if and only if some information cannot be extracted without disturbance.

Generalised probabilistic theories in a new light

In this paper, a modified formulation of generalized probabilistic theories that will always give rise to the structure of Hilbert space of quantum mechanics, in any finite outcome space, is presented and the guidelines to how to extend this work to infinite dimensional Hilbert spaces are given. Moreover, this new formulation which will be called as extended operational probabilistic theories, applies not only to quantum systems, but also equally well to classical systems, without violating Bell's theorem, and at the same time solves the measurement problem. A new answer to the question of why our universe is quantum mechanical rather than classical will be presented. Besides, this extended probability theory shows that it is non determinacy, or to be more precise, the non deterministic description of the universe, that makes the laws of physics the way they are. In addition, this paper shows that there is still a possibility that there might be a deterministic level from which our universe emerges, which if understood correctly, may open the door wide to applications in areas such as quantum computing. In addition, this paper explains the deep reason why complex Hilbert spaces in quantum mechanics are needed.

Shannon theory beyond quantum: Information content of a source

The information content of a source is defined in terms of the minimum number of bits needed to store the output of the source in a perfectly recoverable way. A similar definition can be given in the case of quantum sources, with qubits replacing bits. In the mentioned cases the information content can be quantified through Shannon's and von Neumann's entropy, respectively. Here we extend the definition of information content to operational probabilistic theories, and prove relevant properties such as the subadditivity and the relation between purity and information content of a state. We prove the consistency of the present notion of information content when applied to the classical and the quantum case. Finally, the relation with one of the notions of entropy that can be introduced in general probabilistic theories, the maximum accessible information, is given in terms of a lower bound.

Causal influence in operational probabilistic theories

We study the relation of causal influence between input systems of a reversible evolution and its output systems, in the context of operational probabilistic theories. We analyse two different definitions that are borrowed from the literature on quantum theory—where they are equivalent. One is the notion based on signalling, and the other one is the notion used to define the neighbourhood of a cell in a quantum cellular automaton. The latter definition, that we adopt in the general scenario, turns out to be strictly weaker than the former: it is possible for a system to have causal influence on another one without signalling to it. Remarkably, the counterexample comes from classical theory, where the proposed notion of causal influence determines a redefinition of the neighbourhood of a cell in cellular automata. We stress that, according to our definition, it is impossible anyway to have causal influence in the absence of an interaction, e.g. in a Bell-like scenario. We study various conditions for causal influence, and introduce the feature that we call no interaction without disturbance, under which we prove that signalling and causal influence coincide. The proposed definition has interesting consequences on the analysis of causal networks, and leads to a revision of the notion of neighbourhood for classical cellular automata, clarifying a puzzle regarding their quantisation that apparently makes the neighbourhood larger than the original one.

Simple Upper and Lower Bounds on the Ultimate Success Probability for Discriminating Arbitrary Finite-Dimensional Quantum Processes.

We consider the problem of discriminating finite-dimensional quantum processes, also called quantum supermaps, that can consist of multiple time steps. Obtaining the ultimate performance for discriminating quantum processes is of fundamental importance, but is challenging mainly due to the necessity of considering all discrimination strategies allowed by quantum mechanics, including entanglement-assisted strategies and adaptive strategies. In the case in which the processes to be discriminated have internal memories, the ultimate performance would generally be more difficult to analyze. In this Letter, we present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes. In the special case of multishot channel discrimination, it can be shown that the ultimate success probability increases by at most a constant factor determined by the given channels if the number of channel evaluations increases by one. We also present a lower bound based on Bayesian updating, which has a low computational cost. Our numerical experiments demonstrate that the proposed bounds are reasonably tight. The proposed bounds do not explicitly depend on any quantum phenomena, and can be readily extended to a general operational probabilistic theory.

Information and disturbance in operational probabilistic theories

Any measurement is intended to provide information on a system, namely knowledge about its state. However, we learn from quantum theory that it is generally impossible to extract information without disturbing the state of the system or its correlations with other systems. In this paper we address the issue of the interplay between information and disturbance for a general operational probabilistic theory. The traditional notion of disturbance considers the fate of the system state after the measurement. However, the fact that the system state is left untouched ensures that also correlations are preserved only in the presence of local discriminability. Here we provide the definition of disturbance that is appropriate for a general theory. Moreover, since in a theory without causality information can be gathered also on the effect, we generalise the notion of no-information test. We then prove an equivalent condition for no-information without disturbance---atomicity of the identity---namely the impossibility of achieving the trivial evolution---the identity---as the coarse-graining of a set of non trivial ones. We prove a general theorem showing that information that can be retrieved without disturbance corresponds to perfectly repeatable and discriminating tests. Based on this, we prove a structure theorem for operational probabilistic theories, showing that the set of states of any system decomposes as a direct sum of perfectly discriminable sets, and such decomposition is preserved under system composition. As a consequence, a theory is such that any information can be extracted without disturbance only if all its systems are classical. Finally, we show via concrete examples that no-information without disturbance is independent of both local discriminability and purification.

Classicality without local discriminability: Decoupling entanglement and complementarity

An operational probabilistic theory where all systems are classical, and all pure states of composite systems are entangled, is constructed. The theory is endowed with a rule for composing an arbitrary number of systems, and with a nontrivial set of transformations. Hence, we demonstrate that the presence of entanglement is independent of the existence of incompatible measurements. We then study a variety of phenomena occurring in the theory -- some of them contradicting both Classical and Quantum Theories -- including: cloning, entanglement swapping, dense coding, additivity of classical capacities, non-monogamous entanglement, hypersignaling. We also prove the existence, in the theory, of a universal processor. The theory is causal and satisfies the no-restriction hypothesis. At the same time, it violates a number of information-theoretic principles enjoyed by Quantum Theory, most notably: local discriminability, purity of parallel composition of states, and purification. Moreover, we introduce an exhaustive procedure to construct generic operational probabilistic theories, and a sufficient set of conditions to verify their consistency. In addition, we prove a characterisation theorem for the parallel composition rules of arbitrary theories, and specialise it to the case of bilocal-tomographic theories. We conclude pointing out some open problems. In particular, on the basis of the fact that every separable state of the theory is a statistical mixture of entangled states, we formulate a no-go conjecture for the existence of a local-realistic ontological model.

Cellular automata in operational probabilistic theories

The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite systems. The notion of causal influence is introduced, and its relation with the usual property of signalling is discussed. We then introduce homogeneity, namely the property of an update rule to evolve every system in the same way, and prove that systems evolving by a homogeneous rule always correspond to vertices of a Cayley graph. Next, we define the notion of locality for update rules. Cellular automata are then defined as homogeneous and local update rules. Finally, we prove a general version of the wrapping lemma, that connects CA on different Cayley graphs sharing some small-scale structure of neighbourhoods.

Classical theories with entanglement

We investigate operational probabilistic theories where the pure states of every system are the vertices of a simplex. A special case of such theories is that of classical theories, i.e. simplicial theories whose pure states are jointly perfectly discriminable. The usual Classical Theory satisfies also local discriminability. However, simplicial theories---including the classical ones---can violate local discriminability, thus admitting of entangled states. First, we prove sufficient conditions for the presence of entangled states in arbitrary probabilistic theories. Then, we prove that simplicial theories are necessarily causal, and this represents a no-go theorem for conceiving non-causal classical theories. We then provide necessary and sufficient conditions for simplicial theories to exhibit entanglement, and classify their system-composition rules. We conclude proving that, in simplicial theories, an operational formulation of the superposition principle cannot be satisfied, and that---under the hypothesis of $n$-local discriminability---no mixed state admits of a purification. Our results hold also in the general case where the sets of states fail to be convex.

Theoretical framework for higher-order quantum theory.

Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes recursively, with the construction of a full hierarchy of maps of increasingly higher order. The analysis of special cases already showed that higher-order quantum functions exhibit features that cannot be tracked down to the usual circuits, such as indefinite causal structures, providing provable advantages over circuital maps. The present treatment provides a general framework where this kind of analysis can be carried out in full generality. The hierarchy of higher-order quantum maps is introduced axiomatically with a formulation based on the language of types of transformations. Complete positivity of higher-order maps is derived from the general admissibility conditions instead of being postulated as in previous approaches. The recursive characterization of convex sets of maps of a given type is used to prove equivalence relations between different types. The axioms of the framework do not refer to the specific mathematical structure of quantum theory, and can therefore be exported in the context of any operational probabilistic theory.

Causality re-established

Causality has never gained the status of a 'law' or 'principle' in physics. Some recent literature has even popularized the false idea that causality is a notion that should be banned from theory. Such misconception relies on an alleged universality of the reversibility of the laws of physics, based either on the determinism of classical theory, or on the multiverse interpretation of quantum theory, in both cases motivated by mere interpretational requirements for realism of the theory. Here, I will show that a properly defined unambiguous notion of causality is a theorem of quantum theory, which is also a falsifiable proposition of the theory. Such a notion of causality appeared in the literature within the framework of operational probabilistic theories. It is a genuinely theoretical notion, corresponding to establishing a definite partial order among events, in the same way as we do by using the future causal cone on Minkowski space. The notion of causality is logically completely independent of the misidentified concept of 'determinism', and, being a consequence of quantum theory, is ubiquitous in physics. In addition, as classical theory can be regarded as a restriction of quantum theory, causality holds also in the classical case, although the determinism of the theory trivializes it. I then conclude by arguing that causality naturally establishes an arrow of time. This implies that the scenario of the 'block Universe' and the connected 'past hypothesis' are incompatible with causality, and thus with quantum theory: they are both doomed to remain mere interpretations and, as such, are not falsifiable, similar to the hypothesis of 'super-determinism'.This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'.

Categorical Probabilistic Theories

We present a simple categorical framework for the treatment of probabilistic theories, with the aim of reconciling the fields of Categorical Quantum Mechanics (CQM) and Operational Probabilistic Theories (OPTs). In recent years, both CQM and OPTs have found successful application to a number of areas in quantum foundations and information theory: they present many similarities, both in spirit and in formalism, but they remain separated by a number of subtle yet important differences. We attempt to bridge this gap, by adopting a minimal number of operationally motivated axioms which provide clean categorical foundations, in the style of CQM, for the treatment of the problems that OPTs are concerned with.

Which causal structures might support a quantum–classical gap?

A causal scenario is a graph that describes the cause and effect relationships between all relevant variables in an experiment. A scenario is deemed ‘not interesting’ if there is no device-independent way to distinguish the predictions of classical physics from any generalised probabilistic theory (including quantum mechanics). Conversely, an interesting scenario is one in which there exists a gap between the predictions of different operational probabilistic theories, as occurs for example in Bell-type experiments. Henson, Lal and Pusey (HLP) recently proposed a sufficient condition for a causal scenario to not be interesting. In this paper we supplement their analysis with some new techniques and results. We first show that existing graphical techniques due to Evans can be used to confirm by inspection that many graphs are interesting without having to explicitly search for inequality violations. For three exceptional cases—the graphs numbered in HLP—we show that there exist non-Shannon type entropic inequalities that imply these graphs are interesting. In doing so, we find that existing methods of entropic inequalities can be greatly enhanced by conditioning on the specific values of certain variables.

Quantum Theory is an Information Theory

In this paper we review the general framework of operational probabilistic theories (OPT), along with the six axioms from which quantum theory can be derived. We argue that the OPT framework along with a relaxed version of five of the axioms, define a general information theory. We close the paper with considerations about the role of the observer in an OPT, and the interpretation of the von Neumann postulate and the Schrodinger-cat paradox.

Higher-order interference and single-system postulates characterizing quantum theory

We present a new characterization of quantum theory in terms of simple physical principles that is different from previous ones in two important respects: first, it only refers to properties of single systems without any assumptions on the composition of many systems; and second, it is closer to experiment by having absence of higher-order interference as a postulate, which is currently the subject of experimental investigation. We give three postulates—no higher-order interference, classical decomposability of states, and strong symmetry—and prove that the only non-classical operational probabilistic theories satisfying them are real, complex, and quaternionic quantum theory, together with three-level octonionic quantum theory and ball state spaces of arbitrary dimension. Then we show that adding observability of energy as a fourth postulate yields complex quantum theory as the unique solution, relating the emergence of the complex numbers to the possibility of Hamiltonian dynamics. We also show that there may be interesting non-quantum theories satisfying only the first two of our postulates, which would allow for higher-order interference in experiments while still respecting the contextuality analogue of the local orthogonality principle.

The Feynman problem and fermionic entanglement: Fermionic theory versus qubit theory

The present paper is both a review on the Feynman problem, and an original research presentation on the relations between Fermionic theories and qubits theories, both regarded in the novel framework of operational probabilistic theories. The most relevant results about the Feynman problem of simulating Fermions with qubits are reviewed, and in the light of the new original results, the problem is solved. The answer is twofold. On the computational side, the two theories are equivalent, as shown by Bravyi and Kitaev [S. B. Bravyi and A. Y. Kitaev, Ann. Phys. 298, 210 (2002)]. On the operational side, the quantum theory of qubits and the quantum theory of Fermions are different, mostly in the notion of locality, with striking consequences on entanglement. Thus the emulation does not respect locality, as it was suspected by Feynman [R. Feynman, Int. J. Theor. Phys. 21, 467 (1982)].