Jump to content

Generalized probabilistic theory

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by WikiCleanerBot (talk | contribs) at 21:30, 3 February 2021 (v2.04b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A generalized probabilistic theory (GPT) is a general framework to describe the operational features of arbitrary physical theories. A GPT must specify what kind of physical systems one can find in the lab, as well as rules to compute the outcome statistics of any experiment involving labeled preparations, transformations and measurements. The framework of GPTs has been used to define hypothetical non-quantum physical theories which nonetheless possess quantum theory's most remarkable features, such as entanglement or teleportation. Notably, a small set of physically motivated axioms is enough to single out the GPT representation of quantum theory.[1][2][3]

Frameworks similar to that of GPTs have been used since at least the 1960's,[4][5][6] but the term "generalized probabilistic theory" itself was coined by Jonathan Barrett in 2007,[7] based on the framework introduced by Lucien Hardy.[1] Note that some authors also use the term operational probabilistic theory to denote a particular variant of GPTs.[2][8]

Definition

A GPT is specified by a number of mathematical structures, which are:

  • set of types of state spaces, each of which represents a class of physical systems;
  • composition rule (usually corresponds to a tensor product), which specifies how joint state spaces are formed;
  • set of measurement outcomes, which map states to probabilities and are usually described by an effect algebra;
  • set of possible physical operations, i.e., transformations that map state spaces to state spaces.

It can be argued that if one can prepare a state and a different state , then one can also toss a (possibly biased) coin which lands on one side with probability and on the other with probability and prepare either or , depending on the side the coin lands on. The resulting state is a statistical mixture of the states and and in GPTs such statistical mixtures are described by convex combinations, in this case . For this reason all state spaces are assumed to be convex sets. Following a similar reasoning, one can argue that also the set of measurement outcomes and set of physical operations must be convex.

Additionally it is always assumed that measurement outcomes and physical operations are affine maps, i.e. that if is a physical transformation, then we must have and similarly for measurement outcomes. This follows from the argument that we should obtain the same outcome if we first prepare a statistical mixture and then apply the physical operation, or if we prepare a statistical mixture of the outcomes of the physical operations.

Note that physical operations are a subset of all affine maps which transform states into states as we must require that a physical operation yields a valid state even when it is applied to a part of a system (the notion of "part: is subtle: it is specified by explaining how different system types compose and how the global parameters of the composite system are affected by local operations).

For practical reasons it is often assumed that a general GPT is embedded in a finite-dimensional vector space, although infinite-dimensional formulations exist.[9][10]

Classical, quantum, and beyond

Classical theory is a GPT where states correspond to probability distributions and both measurements and physical operations are stochastic maps. One can see that in this case all state spaces are simplexes.

Quantum theory is a GPT where system types are described by a natural number which corresponds to the Hilbert space dimension. States of the systems of Hilbert space dimension are described by the normalized positive semidefinite matrices, i.e. by the density matrices. Measurements are identified with Positive Operator valued Measures (POVMs), and the physical operations are completely positive maps. Systems compose via the tensor product of the underlying Hilbert spaces.

The framework of GPTs has provided examples of consistent physical theories which cannot be embedded in quantum theory and indeed exhibit very non-quantum features. One of the first ones was Box-world, the theory with maximal non-local correlations.[7] Other examples are theories with third-order interference[11] and the family of GPTs known as generalized bits.[12]

Many features that were considered purely quantum are actually present in all non-classical GPTs. These include the impossibility of universal broadcasting, i.e., the no-cloning theorem;[13] the existence of incompatible measurements;[10][14] and the existence of entangled states or entangled measurements.[15]

See also

References

  1. ^ a b Hardy, L. (2001). "Quantum Theory From Five Reasonable Axioms". arXiv:quant-ph/0101012.
  2. ^ a b Chiribella, Giulio; D’Ariano, Giacomo Mauro; Perinotti, Paolo (2011-07-11). "Informational derivation of quantum theory". Physical Review A. 84 (1): 012311. arXiv:1011.6451. Bibcode:2011PhRvA..84a2311C. doi:10.1103/PhysRevA.84.012311. ISSN 1050-2947. S2CID 15364117.
  3. ^ Wetering, John van de (2019-12-18). "An effect-theoretic reconstruction of quantum theory". Compositionality. 1: 1. doi:10.32408/compositionality-1-1. ISSN 2631-4444.
  4. ^ Edwards, David A. (1979-09-01). "The mathematical foundations of quantum mechanics". Synthese. 42 (1): 1–70. doi:10.1007/BF00413704. ISSN 1573-0964.
  5. ^ Gunson, J. (1967-12-01). "On the algebraic structure of quantum mechanics". Communications in Mathematical Physics. 6 (4): 262–285. doi:10.1007/BF01646019. ISSN 1432-0916.
  6. ^ Ludwig, G. (2012-12-06). An Axiomatic Basis for Quantum Mechanics: Volume 1 Derivation of Hilbert Space Structure. Springer Science & Business Media. ISBN 978-3-642-70029-3.
  7. ^ a b Barrett, J. (2007). "Information processing in generalized probabilistic theories". Phys. Rev. A. 75 (3): 032304. arXiv:quant-ph/0508211. Bibcode:2007PhRvA..75c2304B. doi:10.1103/PhysRevA.75.032304. S2CID 119504263.
  8. ^ Chiribella, Giulio; D’Ariano, Giacomo Mauro; Perinotti, Paolo (2010-06-30). "Probabilistic theories with purification". Physical Review A. 81 (6): 062348. doi:10.1103/PhysRevA.81.062348.
  9. ^ Nuida, Koji; Kimura, Gen; Miyadera, Takayuki (September 2010). "Optimal observables for minimum-error state discrimination in general probabilistic theories". Journal of Mathematical Physics. 51 (9): 093505. arXiv:0906.5419. Bibcode:2010JMP....51i3505N. doi:10.1063/1.3479008. ISSN 0022-2488. S2CID 16911930.
  10. ^ a b Kuramochi, Yui (2020-02-17). "Compatibility of any pair of 2-outcome measurements characterizes the Choquet simplex". Positivity. arXiv:1912.00563. doi:10.1007/s11117-020-00742-0. ISSN 1385-1292. S2CID 208527451.
  11. ^ Dakić, B.; Paterek, T.; Brukner, C. (2014). "Density cubes and higher-order interference theories". New J. Phys. 16 (2): 023028. arXiv:1308.2822. Bibcode:2014NJPh...16b3028D. doi:10.1088/1367-2630/16/2/023028.
  12. ^ Pawłowski, M.; Winter, A. (2012). ""Hyperbits": The information quasiparticles". Phys. Rev. A. 85 (2): 022331. arXiv:1106.2409. Bibcode:2012PhRvA..85b2331P. doi:10.1103/PhysRevA.85.022331. S2CID 119269862.
  13. ^ Barnum, Howard; Barrett, Jonathan; Leifer, Matthew; Wilce, Alexander (2007-12-13). "Generalized No-Broadcasting Theorem". Physical Review Letters. 99 (24): 240501. arXiv:0707.0620. Bibcode:2007PhRvL..99x0501B. doi:10.1103/PhysRevLett.99.240501. ISSN 0031-9007. PMID 18233430. S2CID 20228165.
  14. ^ Plávala, Martin (2016-10-12). "All measurements in a probabilistic theory are compatible if and only if the state space is a simplex". Physical Review A. 94 (4): 042108. arXiv:1608.05614. Bibcode:2016PhRvA..94d2108P. doi:10.1103/PhysRevA.94.042108. ISSN 2469-9926. S2CID 119115973.
  15. ^ Aubrun, Guillaume; Lami, Ludovico; Palazuelos, Carlos; Plavala, Martin (2020-02-07). "Entangleability of cones". arXiv:1911.09663 [math.FA].