General Probabilistic Theories Research Articles

Realization of an Arbitrary Structure of Perfect Distinguishability of States in General Probability Theory

Realization of an Arbitrary Structure of Perfect Distinguishability of States in General Probability Theory

Symmetries and Wigner representations of operational theories

Abstract We develop the theory of Wigner representations for general probabilistic theories (GPTs), a large class of operational theories that include both classical and quantum theory. The Wigner representations that we introduce are a natural way to describe the theory in terms of some fixed observables; these observables are often picked to be position and momentum or spin observables. This allows us to introduce symmetries which transform the outcomes of the observables used to construct the Wigner representation; we obtain several results for when these symmetries are well defined or when they uniquely specify the Wigner representation.

Encoding and decoding of information in general probabilistic theories

Encoding and decoding are the two key steps in information processing. In this work, we study the encoding and decoding capabilities of operational theories in the context of information-storability game, where the task is to freely choose a set of states from which one state is chosen at random and by measuring the state it must be identified; a correct guess results in as many utiles as the number of states in the chosen set and an incorrect guess means a penalty of a fixed number of utiles. We connect the optimal winning strategy of the game to the amount of information that can be stored in a given theory, called the information storability of the theory, and show that one must use so-called nondegradable sets of states and nondegradable measurements whose encoding and decoding properties cannot be reduced. We demonstrate that there are theories where the perfect discrimination strategy is not the optimal one so that the introduced game can be used as an operational test for super information storability. We further develop the concept of information storability by giving new useful conditions for calculating it in specific theories.

Derivation of standard quantum theory via state discrimination

It is a key issue to characterize the model of standard quantum theory out of general models by an operational condition. The framework of general probabilistic theories (GPTs) is a new information theoretical approach to single out standard quantum theory. It is known that traditional properties, for example, Bell-CHSH inequality, are not sufficient to single out standard quantum theory among possible models in GPTs. As a more precise property, we focus on the bound of the performance for an information task called state discrimination in general models. We give an equivalent condition for outperforming the minimum discrimination error probability under the standard quantum theory given by the trace norm. Besides, by applying the equivalent condition, we characterize standard quantum theory out of general models in GPTs by the bound of the performance for state discrimination.

Semantic analysis of two-syllabic terms of metrology. Part 2: Risk in measurements and calculations

Prior to the requirement for testing and calibration laboratories to take into account the risk of statistical assumptions, false positive and false negative decisions in international documents, it was found that the methodology of the “Guide to Expressing Measurement Uncertainty” based on the Bayes approach and the Monte Carlo method for calculating probabilistic risk characteristics is not applicable. A later draft revision of the “Manual on the Expression of Measurement Uncertainty” attempted to shift the interpretation of measurement uncertainty from the scattering parameter to the probability distribution. An attempt to contribute to solving the problem of definitional uncertainty in the International Dictionary of Basic and Basic Terms of Metrology was also unsuccessful. In the new version of the dictionary of general statistical terms and probability theory terms, the term measurement uncertainty is excluded, and one of the notes states that “the probability distribution fully describes the probabilistic properties of the uncertainty of the result”. However, due to the new requirements for risk calculations, international documents were urgently put into effect without radical assessments of the inapplicability of the Bayes approach and the Monte Carlo method, the disadvantages were renamed limitations, but there are no specific instructions for calculating risks. Based on the experience of the compositional approach to estimating accuracy, a procedure based on the convolution of probability distributions in the form of a modified reversal formula is recommended, which allows taking into account the definitive uncertainty in the moment approach. It is established that the method of accounting for the definitive uncertainty by convolution of uniform distributions is practically suggested in the text of the “Manual on the expression of measurement uncertainty”, but not used.

What is Quantum in probabilistic explanations of the sure-thing principle violation?

The Prisoner’s Dilemma game (PDG) is one of the simple test-beds for the probabilistic nature of the human decision-making process. Behavioral experiments have been conducted on this game for decades and show a violation of the so-called sure-thing principle, a key principle in the rational theory of decision. Quantum probabilistic models can explain this violation as a second-order interference effect, which cannot be accounted for by classical probability theory. Here, we adopt the framework of generalized probabilistic theories and approach this explanation from the viewpoint of quantum information theory to identify the source of the interference. In particular, we reformulate one of the existing quantum probabilistic models using density matrix formalism and consider different amounts of classical and quantum uncertainties for one player’s prediction about another player’s action in PDG. This enables us to demonstrate that what makes possible the explanation of the violation is the presence of quantum coherence in the player’s initial prediction and its conversion to probabilities during the dynamics. Moreover, we discuss the role of other quantum information-theoretical quantities, such as quantum entanglement, in the decision-making process. Finally, we propose a three-choice extension of the PDG to compare the predictive powers of quantum probability theory and a more general probabilistic theory that includes it as a particular case and exhibits third-order interference.

Contextual measurement model and quantum theory.

We develop a contextual measurement model (CMM) that is used for the clarification of the quantum foundations. This model matches Bohr's views on the role of experimental contexts. CMM is based on a contextual probability theory that is connected with generalized probability theory. CMM covers measurements in classical, quantum and semi-classical physics. The CMM formalism is illustrated by a few examples. We consider the CMM framing of classical probability, the von Neumann measurement theory and the quantum instrument theory. CMM can also be applied outside of physics, e.g. in cognition, decision-making and psychology, the so-called quantum-like modelling.

Quantum Theory in Finite Dimension Cannot Explain Every General Process with Finite Memory

Arguably, the largest class of stochastic processes generated by means of a finite memory consists of those that are sequences of observations produced by sequential measurements in a suitable generalized probabilistic theory (GPT). These are constructed from a finite-dimensional memory evolving under a set of possible linear maps, and with probabilities of outcomes determined by linear functions of the memory state. Examples of such models are given by classical hidden Markov processes, where the memory state is a probability distribution, and at each step it evolves according to a non-negative matrix, and hidden quantum Markov processes, where the memory is a finite-dimensional quantum system, and at each step it evolves according to a completely positive map. Here we show that the set of processes admitting a finite-dimensional explanation do not need to be explainable in terms of either classical probability or quantum mechanics. To wit, we exhibit families of processes that have a finite-dimensional explanation, defined manifestly by the dynamics of an explicitly given GPT, but that do not admit a quantum, and therefore not even classical, explanation in finite dimension. Furthermore, we present a family of quantum processes on qubits and qutrits that do not admit a classical finite-dimensional realization, which includes examples introduced earlier by Fox, Rubin, Dharmadikari and Nadkarni as functions of infinite-dimensional Markov chains, and lower bound the size of the memory of a classical model realizing a noisy version of the qubit processes.

Research on dependent evidence combination based on principal component analysis.

Dempster-Shafer evidence theory, as a generalization of probability theory, is a powerful tool for dealing with a variety of uncertainties, such as incompleteness, ambiguity, and conflict. Because of its advantages in information fusion compared with traditional probability theory, it is widely used in various fields. However, the classic Dempster's combination rule assumes that evidences are independent of each other, which is difficult to satisfy in real life. Ignoring the dependence among the evidences will lead to unreasonable fusion results, and even wrong conclusions. Considering the limitations of D-S evidence theory, this paper proposed a new evidence fusion model based on principal component analysis (PCA) to deal with the dependence among evidences. First, the approximate independent principal components of each information source were obtained based on principal component analysis. Second, the principal component data set was used as a new information source for evidence theory. Third, the basic belief assignments (BBAs) were constructed. As the fundamental construct of evidence theory, a BBA is a probabilistic function corresponding to each hypothesis, quantifying the belief assigned based on the evidence at hand. This function facilitates the synthesis of disparate evidence sources into a mathematically coherent and unified belief structure. After constructing the BBAs, the BBAs were fused and a conclusion was drawn. The case study verified that the proposed method is more robust than several traditional methods and can deal with redundant information effectively to obtain more stable results.

Totality, Regularity, and Cardinality in Probability Theory

Abstract Recent developments in generalized probability theory have renewed a debate about whether regularity (i.e., the constraint that only logical contradictions get assigned probability $0$ ) should be a necessary feature of both chances and credences. Crucial to this debate, however, are some mathematical facts regarding the interplay between the existence of regular generalized probability measures and various cardinality assumptions. We improve on several known results in the literature regarding the existence of regular generalized probability measures. In particular, we give necessary and sufficient conditions for the existence of regular generalized probability measures defined on the whole powerset of any sample space.

A post-quantum associative memory

Associative memories are devices storing information that can be fully retrieved given partial disclosure of it. We examine a toy model of associative memory and the ultimate limitations to which it is subjected within the framework of general probabilistic theories (GPTs), which represent the most general class of physical theories satisfying some basic operational axioms. We ask ourselves how large the dimension of a GPT should be so that it can accommodate 2 m states with the property that any N of them are perfectly distinguishable. Call the minimal such dimension. Invoking an old result by Danzer and Grünbaum, we prove that , to be compared with when the GPT is required to be either classical or quantum. This yields an example of a task where GPTs outperform both classical and quantum theory exponentially. More generally, we resolve the case of fixed N and asymptotically large m, proving that (as ) for every , which yields again an exponential improvement over classical and quantum theories. Finally, we develop a numerical approach to the general problem of finding the largest N-wise mutually distinguishable set for a given GPT, which can be seen as an instance of the maximum clique problem on N-regular hypergraphs.

Making inferences in incomplete Bayesian networks: A Dempster-Shafer belief function approach

How do you make inferences from a Bayesian network (BN) model with missing information? For example, we may not have priors for some variables or may not have conditionals for some states of the parent variables. It is well-known that the Dempster-Shafer (D-S) belief function theory is a generalization of probability theory. So, a solution is to embed an incomplete BN model in a D-S belief function model, omit the missing data, and then make inferences from the belief function model. We will demonstrate this using an implementation of a local computation algorithm for D-S belief function models called the “Belief function machine.” One advantage of this approach is that we get interval estimates of the probabilities of interest. Using Laplacian (equally likely) or maximum entropy priors or conditionals for missing data in a BN may lead to point estimates for the probabilities of interest, masking the uncertainty in these estimates. Bayesian reasoning cannot reason from an incomplete model. A Bayesian sensitivity analysis of the missing parameters is not a substitute for a belief-function analysis.

Accessible fragments of generalized probabilistic theories, cone equivalence, and applications to witnessing nonclassicality

The formalism of generalized probabilistic theories (GPTs) was originally developed as a way to characterize the landscape of conceivable physical theories. Thus, the GPT describing a given physical theory necessarily includes all physically possible processes. We here consider the question of how to provide a GPT-like characterization of a particular experimental setup within a given physical theory. We show that the resulting characterization is not generally a GPT in and of itself, rather, it is described by a more general mathematical object that we introduce and term an accessible GPT fragment. We then introduce an equivalence relation, termed cone equivalence, between accessible GPT fragments (and, as a special case, between standard GPTs). We give a number of examples of experimental scenarios that are best described using accessible GPT fragments, and where moreover, cone-equivalence arises naturally. We then prove that an accessible GPT fragment admits of a classical explanation if and only if every other fragment that is cone equivalent to it also admits of a classical explanation. Finally, we leverage this result to prove several fundamental results regarding the experimental requirements for witnessing the failure of generalized noncontextuality. In particular, we prove that neither incompatibility among measurements nor the assumption of freedom of choice is necessary for witnessing failures of generalized noncontextuality, and moreover, that such failures can be witnessed even when using arbitrarily inefficient detectors.

Programming of channels in generalized probabilistic theories

For a given target system and apparatus described by quantum theory, the so-called quantum no-programming theorem indicates that a family of states called programs in the apparatus with a fixed unitary operation on total system programs distinct unitary dynamics to the target system only if the initial programs are orthogonal to each other. The current study aims at revealing whether a similar behavior can be observed in generalized probabilistic theories (GPTs). Generalizing the programming scheme to GPTs, we derive a similar theorem to the quantum no-programming theorem. We, furthermore, demonstrate that programming of reversible dynamics is closely related to a curious structure named a quasi-classical structure on the state space. Programming of irreversible dynamics, i.e., channels, in GPTs is also investigated.

Fractional Probability Theory of Arbitrary Order

A generalization of probability theory is proposed by using the Riemann–Liouville fractional integrals and the Caputo and Riemann–Liouville fractional derivatives of arbitrary (non-integer and integer) orders. The definition of the fractional probability density function (fractional PDF) is proposed. The basic properties of the fractional PDF are proven. The definition of the fractional cumulative distribution function (fractional CDF) is also suggested, and the basic properties of these functions are also proven. It is proven that the proposed fractional cumulative distribution functions generate unique probability spaces that are interpreted as spaces of a fractional probability theory of arbitrary order. Various examples of the distributions of the fractional probability of arbitrary order, which are defined on finite intervals of the real line, are suggested.

Pseudo standard entanglement structure cannot be distinguished from standard entanglement structure

An experimental verification of the maximally entangled state ensures that the constructed state is close to the maximally entangled state, but it does not guarantee that the state is exactly the same as the maximally entangled state. Further, the entanglement structure is not uniquely determined in general probabilistic theories even if we impose that the local subsystems are fully equal to quantum systems. Therefore, the existence of the maximally entangled state depends on whether the standard entanglement structure (SES) is valid. To examine this issue, we introduce pseudo SES as a structure of quantum composite system under natural assumptions based on the existence of projective measurements and the existence of approximations of all maximally entangled standard states. Surprisingly, there exist infinitely many pseudo SESs different from the SES. In our setting, any maximally entangled state can be arbitrarily approximated by an entangled state that belongs to our obtained pseudo standard entanglement structure. That is, experimental verification does not exclude the possibility of our obtained pseudo standard entanglement structure that is different from the standard entanglement structure. On the other hand, such pseudo structures never possess global unitary symmetry, i.e. global unitary symmetry is essential condition for the SES.

Intermediate determinism in general probabilistic theories

Quantum theory is indeterministic, but not completely so. When a system is in a pure state there are properties it possesses with certainty, known as actual properties. The actual properties of a quantum system (in a pure state) fully determine the probability of finding the system to have any other property. We will call this principle, wherein the deterministic elements of a theory completely characterise the probabilistic elements, intermediate determinism. In dimensions of at least three, intermediate determinism in quantum theory is guaranteed by the structure of its lattice of properties. This observation follows from Gleason’s theorem, which is why it fails to hold in dimension two. In this work we extend the idea of intermediate determinism from properties to measurements. Under this extension intermediate determinism follows from the structure of quantum effects for separable Hilbert spaces of any dimension, including dimension two. Then, we find necessary and sufficient conditions for a general probabilistic theory to obey intermediate determinism. We show that, although related, both the no-restriction hypothesis and a Gleason-type theorem are neither necessary nor sufficient for intermediate determinism.

Assemblages and steering in general probabilistic theories

We study steering in the framework of general probabilistic theories. We show that for dichotomic assemblages, steering can be characterized in terms of a certain tensor cross norm, which is also related to a steering degree given by steering robustness. Another contribution is the observation that steering in general probabilistic theories (GPTs) can be conveniently treated using Choquet theory for probability measures on the state space. In particular, we find a variational expression for universal steering degree for dichotomic assemblages and obtain conditions characterizing unsteerable states analogous to some conditions recently found for the quantum case. The setting also enables us to rather easily extend the results to infinite dimensions and arbitrary numbers of measurements with arbitrary outcomes.

Dense Coding with Locality Restriction on Decoders: Quantum Encoders versus Superquantum Encoders

We investigate practical dense coding by imposing locality restrictions on decoders and symmetry restrictions on encoders within the resource theory of asymmetry framework. In this task, the sender Alice and the helper Fred preshare an entangled state. Alice encodes a classical message into the quantum state using a symmetric preserving encoder and sends the encoded state to Bob through a noiseless quantum channel. The receiver Bob and helper Fred are limited to performing quantum measurements satisfying certain locality restrictions to decode the classical message. We are interested in the ultimate dense coding capacity under these constraints. Our contributions are summarized as follows. First, we derive both one-shot and asymptotic optimal achievable transmission rates of the dense coding task under different encoder and decoder combinations. Surprisingly, our results reveal that the transmission rate cannot be improved even when the decoder is relaxed from one-way local operations and classical communication (LOCC) to two-way LOCC, separable measurements, and partial transpose positive measurements of the bipartite system. Second, depending on the class of allowed decoders with certain locality restrictions, we relax the class of encoding operations to superquantum encoders in the general probability theory framework and derive dense coding transmission rates under this setting. For example, when the decoder is fixed to a separable measurement, theoretically, a positive operation is allowed as an encoding operation. Remarkably, even under this superquantum relaxation, the transmission rate still cannot be lifted. This fact highlights the universal validity of our analysis on practical dense coding beyond quantum theory.Received 10 October 2021Revised 6 May 2022Accepted 29 August 2022DOI:https://doi.org/10.1103/PRXQuantum.3.030346Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.Published by the American Physical SocietyPhysics Subject Headings (PhySH)Research AreasQuantum channelsQuantum communicationQuantum entanglementResource theoriesQuantum Information

Nonlocality under uncertainty-disturbance relations and self-duality

We exploit the interplay between uncertainty, disturbance, nonlocality, and self-duality within the framework of generalized probabilistic theories (GPTs). We first introduce an operational uncertainty-disturbance relation that reveals the discrepancies of GPTs in uncertainty and disturbance exhibited by one single measurement. We then apply the relation to Bell's scenarios and derive upper bounds for the basic spatial Clauser-Horne-Shimony-Holt and the temporal Leggett-Garg inequalities with and without the assumption of strong self-duality, respectively. It turns out that self-duality, though being thought of as one pillar of the axiomatization of quantum theory and implying additional constraints, is insufficient to explain the quantum violations. These insights may serve as a seed for a universal understanding of these basic properties in GPTs.