Giannicola Scarpa

Intersubjective consistency asks when different observers of a physical system, reasoning from a shared theory, will agree on their probability assessments. Classical probability theory provides a benchmark in the form of the Agreement Theorem [R. J. Aumann, Ann. Stat. 4 , 1236–1239 (1976)]. We study the quantum mechanics (QM) analog to the classical Agreement Theorem in a finite-dimensional tripartite setting in which two observers obtain information via local projective measurements. We represent their mutual awareness by common certainty, which is formally an infinite hierarchy of certainty operators concerning the probability of an event of interest. We first prove that if the observers’ measurements commute with one another and with the property of interest, common certainty forces their probability assessments to coincide, thereby recovering a QM analog to the classical Agreement Theorem. We then construct a one-parameter family of qutrit–qubit–qubit models in which one observer’s measurement does not commute with the property and common certainty of disagreement occurs—a distinctively QM phenomenon. The mechanism is coherence between branches distinguished by one but not the other observer’s measurement. When measurement outcomes are stored in a classical register, the resulting dephasing removes this coherence and restores agreement. Finally, we prove that QM does not permit the extreme 0 - 1 configuration in which Alice is certain of a property and is also certain that Bob is certain of its negation. These results aim to turn debate in QM about observer-dependent facts into precise mathematical conditions for when intersubjective agreement or disagreement in QM can be sustained.

The Agreement Theorem Aumann (1976 Ann. Stat. 4 , 1236–1239. ( doi:10.1214/aos/1176343654 )) states that if two Bayesian agents start with a common prior, then they cannot have common knowledge that they hold different posterior probabilities of some underlying event of interest. In short, the two agents cannot ‘agree to disagree’. This result applies in the classical domain where classical probability theory applies. But in non-classical domains, such as the quantum world, classical probability theory does not apply. Inspired principally by their use in quantum mechanics, we employ signed probabilities to investigate the epistemics of the non-classical world. We find that here, too, it cannot be common knowledge that two agents assign different probabilities to an event of interest. However, in a non-classical domain, unlike the classical case, it can be common certainty that two agents assign different probabilities to an event of interest. Finally, in a non-classical domain, it cannot be common certainty that two agents assign different probabilities, if communication of their common certainty is possible—even if communication does not take place. This article is part of the theme issue ‘Quantum contextuality, causality and freedom of choice’.

Is the world quantum? An active research line in quantum foundations is devoted to exploring what constraints can rule out the postquantum theories that are consistent with experimentally observed results. We explore this question in the context of epistemics, and ask whether agreement between observers can serve as a physical principle that must hold for any theory of the world. Aumann's seminal Agreement Theorem states that two observers (of classical systems) cannot agree to disagree. We propose an extension of this theorem to no-signaling settings. In particular, we establish an Agreement Theorem for observers of quantum systems, while we construct examples of (postquantum) no-signaling boxes where observers can agree to disagree. The PR box is an extremal instance of this phenomenon. These results make it plausible that agreement between observers might be a physical principle, while they also establish links between the fields of epistemics and quantum information that seem worthy of further exploration.

Is the world quantum? An active research line in quantum foundations is devoted to exploring what constraints can rule out the postquantum theories that are consistent with experimentally observed results. We explore this question in the context of epistemics, and ask whether agreement between observers can serve as a physical principle that must hold for any theory of the world. Aumann’s seminal Agreement Theorem states that two observers (of classical systems) cannot agree to disagree. We propose an extension of this theorem to no-signaling settings. In particular, we establish an Agreement Theorem for observers of quantum systems, while we construct examples of (postquantum) no-signaling boxes where observers can agree to disagree. The PR box is an extremal instance of this phenomenon. These results make it plausible that agreement between observers might be a physical principle, while they also establish links between the fields of epistemics and quantum information that seem worthy of further exploration.

Matrix product states and projected entangled pair states (PEPS) are powerful analytical and numerical tools to assess quantum many-body systems in one and higher dimensions, respectively. While matrix product states are comprehensively understood, in PEPS fundamental questions, relevant analytically as well as numerically, remain open, such as how to encode symmetries in full generality, or how to stabilize numerical methods using canonical forms. Here, we show that these key problems, as well as a number of related questions, are algorithmically undecidable, that is, they cannot be fully resolved in a systematic way. Our work thereby exposes fundamental limitations to a full and unbiased understanding of quantum many-body systems using PEPS.

We study the use of quantum entanglement in the zero-error source-channel coding problem. Here, Alice and Bob are connected by a noisy classical one-way channel, and are given correlated inputs from a random source. Their goal is for Bob to learn Alice's input while using the channel as little as possible. In the zero-error regime, the optimal rates of source codes and channel codes are given by graph parameters known as the Witsenhausen rate and Shannon capacity, respectively. The Lov\'asz theta number, a graph parameter defined by a semidefinite program, gives the best efficiently-computable upper bound on the Shannon capacity and it also upper bounds its entanglement-assisted counterpart. At the same time it was recently shown that the Shannon capacity can be increased if Alice and Bob may use entanglement. Here we partially extend these results to the source-coding problem and to the more general source-channel coding problem. We prove a lower bound on the rate of entanglement-assisted source-codes in terms Szegedy's number (a strengthening of the theta number). This result implies that the theta number lower bounds the entangled variant of the Witsenhausen rate. We also show that entanglement can allow for an unbounded improvement of the asymptotic rate of both classical source codes and classical source-channel codes. Our separation results use low-degree polynomials due to Barrington, Beigel and Rudich, Hadamard matrices due to Xia and Liu and a new application of remote state preparation.

We study the use of quantum entanglement in the zero-error source-channel coding problem. Here, Alice and Bob are connected by a noisy classical one-way channel, and are given correlated inputs from a random source. Their goal is for Bob to learn Alice's input while using the channel as little as possible. In the zero-error regime, the optimal rates of source codes and channel codes are given by graph parameters known as the Witsenhausen rate and Shannon capacity, respectively. The Lovász theta number, a graph parameter defined by a semidefinite program, gives the best efficiently computable upper bound on the Shannon capacity and it also upper bounds its entanglement-assisted counterpart. At the same time, it was recently shown that the Shannon capacity can be increased if Alice and Bob may use entanglement. Here, we partially extend these results to the source-coding problem and to the more general source-channel coding problem. We prove a lower bound on the rate of entanglement-assisted source-codes in terms of Szegedy's number (a strengthening of the theta number). This result implies that the theta number lower bounds the entangled variant of the Witsenhausen rate. We also show that entanglement can allow for an unbounded improvement of the asymptotic rate of both classical source codes and classical source-channel codes. Our separation results use low-degree polynomials due to Barrington, Beigel and Rudich, Hadamard matrices due to Xia and Liu, and a new application of remote state preparation.

We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicate a common message to multiple receivers. We show that if the number of receivers is greater than a certain threshold then entanglement does not allow for an improvement in the communication for any finite number of uses of the channel. On the other hand, when the number of receivers is fixed, we exhibit a class of channels for which entanglement gives an advantage. The second problem we consider features multiple collaborating senders and one receiver. Classically, cooperation among the senders might allow them to communicate on average more messages than the sum of their individual possibilities. We show that whenever a channel allows single-sender entanglement-assisted advantage, then the gain extends also to the multisender case. Furthermore, we show that entanglement allows for a peculiar amplification of information which cannot happen classically, for a fixed number of uses of the channels.