# Gleason's theorem

Gleason's theorem In mathematical physics, Gleason's theorem shows that the rule one uses to calculate probabilities in quantum physics, the Born rule, can be derived from the usual mathematical representation of measurements in quantum physics together with the assumption of non-contextuality. Andrew M. Gleason first proved the theorem in 1957,[1] answering a question posed by George W. Mackey, an accomplishment that was historically significant for the role it played in showing that wide classes of hidden-variable theories are inconsistent with quantum physics. Multiple variations have been proven in the years since. Gleason's theorem is of particular importance for the field of quantum logic and its attempt to find a minimal set of mathematical axioms for quantum theory.

Contents 1 Statement of the theorem 1.1 Conceptual background 1.2 Deriving the state space and the Born rule 2 History and outline of Gleason's proof 3 Implications 3.1 Hidden variables 3.2 Quantum logic 4 Generalizations 5 Notes 6 References Statement of the theorem Part of a series of articles about Quantum mechanics {displaystyle ihbar {frac {partial }{partial t}}|psi (t)rangle ={hat {H}}|psi (t)rangle } Schrödinger equation IntroductionGlossaryHistory show Background show Fundamentals show Experiments show Formulations show Equations show Interpretations hide Advanced topics Relativistic quantum mechanics Quantum field theory Quantum information science Quantum computing Quantum chaos Density matrix Scattering theory Quantum statistical mechanics Quantum machine learning show Scientists vte Conceptual background In quantum mechanics, each physical system is associated with a Hilbert space. For the purposes of this overview, the Hilbert space is assumed to be finite-dimensional. In the approach codified by John von Neumann, a measurement upon a physical system is represented by a self-adjoint operator on that Hilbert space sometimes termed an "observable". The eigenvectors of such an operator form an orthonormal basis for the Hilbert space, and each possible outcome of that measurement corresponds to one of the vectors comprising the basis. A density operator is a positive-semidefinite operator on the Hilbert space whose trace is equal to 1. In the language of von Weizsäcker, a density operator is a "catalogue of probabilities": for each measurement that can be defined, the probability distribution over the outcomes of that measurement can be computed from the density operator.[2] The procedure for doing so is the Born rule, which states that {displaystyle P(x_{i})=operatorname {Tr} (Pi _{i}rho ),} where {displaystyle rho } is the density operator, and {displaystyle Pi _{i}} is the projection operator onto the basis vector corresponding to the measurement outcome {displaystyle x_{i}} .

The Born rule associates a probability with each unit vector in the Hilbert space, in such a way that these probabilities sum to 1 for any set of unit vectors comprising an orthonormal basis. Moreover, the probability associated with a unit vector is a function of the density operator and the unit vector, and not of additional information like a choice of basis for that vector to be embedded in. Gleason's theorem establishes the converse: all assignments of probabilities to unit vectors (or, equivalently, to the operators that project onto them) that satisfy these conditions take the form of applying the Born rule to some density operator. Gleason's theorem holds if the dimension of the Hilbert space is 3 or greater; counterexamples exist for dimension 2.

Deriving the state space and the Born rule The probability of any outcome of a measurement upon a quantum system must be a real number between 0 and 1 inclusive, and in order to be consistent, for any individual measurement the probabilities of the different possible outcomes must add up to 1. Gleason's theorem shows that any function that assigns probabilities to measurement outcomes, as identified by projection operators, must be expressible in terms of a density operator and the Born rule. This gives not only the rule for calculating probabilities, but also determines the set of possible quantum states.

Let {displaystyle f} be a function from projection operators to the unit interval with the property that, if a set {displaystyle {Pi _{i}}} of projection operators sum to the identity matrix (that is, if they correspond to an orthonormal basis), then {displaystyle sum _{i}f(Pi _{i})=1.} Such a function expresses an assignment of probability values to the outcomes of measurements, an assignment that is "noncontextual" in the sense that the probability for an outcome does not depend upon which measurement that outcome is embedded within, but only upon the mathematical representation of that specific outcome, i.e., its projection operator.[3][4]: §1.3 [5]: §2.1 [6] Gleason's theorem states that for any such function {displaystyle f} , there exists a positive-semidefinite operator {displaystyle rho } with unit trace such that {displaystyle f(Pi _{i})=operatorname {Tr} (Pi _{i}rho ).} Both the Born rule and the fact that "catalogues of probability" are positive-semidefinite operators of unit trace follow from the assumptions that measurements are represented by orthonormal bases, and that probability assignments are "noncontextual". In order for Gleason's theorem to be applicable, the space on which measurements are defined must be a real or complex Hilbert space, or a quaternionic module.[a] (Gleason's argument is inapplicable if, for example, one tries to construct an analogue of quantum mechanics using p-adic numbers.) History and outline of Gleason's proof Gleason in 1959 In 1932, John von Neumann also managed to derive the Born rule in his textbook Mathematische Grundlagen der Quantenmechanik [Mathematical Foundations of Quantum Mechanics]. However, the assumptions on which von Neumann built his proof were rather strong and eventually regarded to not be well-motivated.[14] Specifically, von Neumann assumed that the probability function must be linear on all observables, commuting or non-commuting. His proof was derided by John Bell as "not merely false but foolish!".[15][16] Gleason, on the other hand, did not assume linearity, but merely additivity for commuting projectors together with noncontextuality, assumptions seen as better motivated and more physically meaningful.[16][17] By the late 1940s, George Mackey had grown interested in the mathematical foundations of quantum physics, wondering in particular whether the Born rule was the only possible rule for calculating probabilities in a theory that represented measurements as orthonormal bases on a Hilbert space.[18][19] Mackey discussed this problem with Irving Segal at the University of Chicago, who in turn raised it with Richard Kadison, then a graduate student. Kadison showed that for 2-dimensional Hilbert spaces there exists a probability measure that does not correspond to quantum states and the Born rule. Gleason's result implies that this only happens in dimension 2.[19] Gleason's original proof proceeds in three stages.[20]: §2 In Gleason's terminology, a frame function is a real-valued function {displaystyle f} on the unit sphere of a Hilbert space such that {displaystyle sum _{i}f(x_{i})=1} whenever the vectors {displaystyle x_{i}} comprise an orthonormal basis. A noncontextual probability assignment as defined in the previous section is equivalent to a frame function.[b] Any such measure that can be written in the standard way, that is, by applying the Born rule to a quantum state, is termed a regular frame function. Gleason derives a sequence of lemmas concerning when a frame function is necessarily regular, culminating in the final theorem. First, he establishes that every continuous frame function on the Hilbert space {displaystyle mathbb {R} ^{3}} is regular. This step makes use of the theory of spherical harmonics. Then, he proves that frame functions on {displaystyle mathbb {R} ^{3}} have to be continuous, which establishes the theorem for the special case of {displaystyle mathbb {R} ^{3}} . This step is regarded as the most difficult of the proof.[21][22] Finally, he shows that the general problem can be reduced to this special case. Gleason credits one lemma used in this last stage of the proof to his doctoral student Richard Palais.[1]: fn 3 Robin Lyth Hudson described Gleason's theorem as "celebrated and notoriously difficult".[23] Cooke, Keane and Moran later produced a proof that is longer than Gleason's but requires fewer prerequisites.[21] Implications Gleason's theorem highlights a number of fundamental issues in quantum measurement theory. As Fuchs argues, the theorem "is an extremely powerful result", because "it indicates the extent to which the Born probability rule and even the state-space structure of density operators are dependent upon the theory's other postulates". In consequence, quantum theory is "a tighter package than one might have first thought".[24]: 94–95 Various approaches to rederiving the quantum formalism from alternative axioms have, accordingly, employed Gleason's theorem as a key step, bridging the gap between the structure of Hilbert space and the Born rule.[3][12]: §2 [25][26]: §1.4 Hidden variables Moreover, the theorem is historically significant for the role it played in ruling out the possibility of hidden variables in quantum mechanics. A hidden-variable theory that is deterministic implies that the probability of a given outcome is always either 0 or 1. For example, a Stern–Gerlach measurement on a spin-1 atom will report that the atom's angular momentum along the chosen axis is one of three possible values, which can be designated {displaystyle -} , {displaystyle 0} and {displaystyle +} . In a deterministic hidden-variable theory, there exists an underlying physical property that fixes the result found in the measurement. Conditional on the value of the underlying physical property, any given outcome (for example, a result of {displaystyle +} ) must be either impossible or guaranteed. But Gleason's theorem implies that there can be no such deterministic probability measure. The mapping {displaystyle uto langle rho u,urangle } is continuous on the unit sphere of the Hilbert space for any density operator {displaystyle rho } . Since this unit sphere is connected, no continuous probability measure on it can be deterministic.[26]: §1.3 Gleason's theorem therefore suggests that quantum theory represents a deep and fundamental departure from the classical intuition that uncertainty is due to ignorance about hidden degrees of freedom.[27] More specifically, Gleason's theorem rules out hidden-variable models that are "noncontextual". Any hidden-variable model for quantum mechanics must, in order to avoid the implications of Gleason's theorem, involve hidden variables that are not properties belonging to the measured system alone but also dependent upon the external context in which the measurement is made. This type of dependence is often seen as contrived or undesirable; in some settings, it is inconsistent with special relativity.[27][28] In the Bloch sphere representation of a qubit, each point on the unit sphere stands for a pure state. All other density matrices correspond to points in the interior.

To construct a counterexample for 2-dimensional Hilbert space, known as a qubit, let the hidden variable be a unit vector {displaystyle {vec {lambda }}} in 3-dimensional Euclidean space. Using the Bloch sphere, each possible measurement on a qubit can be represented as a pair of antipodal points on the unit sphere. Defining the probability of a measurement outcome to be 1 if the point representing that outcome lies in the same hemisphere as {displaystyle {vec {lambda }}} and 0 otherwise yields an assignment of probabilities to measurement outcomes that obeys Gleason's assumptions. However, this probability assignment does not correspond to any valid density operator. By introducing a probability distribution over the possible values of {displaystyle {vec {lambda }}} , a hidden-variable model for a qubit that reproduces the predictions of quantum theory can be constructed.[27][29] Gleason's theorem motivated later work by John Bell, Ernst Specker and Simon Kochen that led to the result often called the Kochen–Specker theorem, which likewise shows that noncontextual hidden-variable models are incompatible with quantum mechanics. As noted above, Gleason's theorem shows that there is no probability measure over the rays of a Hilbert space that only takes the values 0 and 1 (as long as the dimension of that space exceeds 2). The Kochen–Specker theorem refines this statement by constructing a specific finite subset of rays on which no such probability measure can be defined.[27][30] The fact that such a finite subset of rays must exist follows from Gleason's theorem by way of a logical compactness argument, but this method does not construct the desired set explicitly.[20]: §1 In the related no-hidden-variables result known as Bell's theorem, the assumption that the hidden-variable theory is noncontextual instead is replaced by the assumption that it is local. The same sets of rays used in Kochen–Specker constructions can also be employed to derive Bell-type proofs.[27][31][32] Pitowsky uses Gleason's theorem to argue that quantum mechanics represents a new theory of probability, one in which the structure of the space of possible events is modified from the classical, Boolean algebra thereof. He regards this as analogous to the way that special relativity modifies the kinematics of Newtonian mechanics.[4][5] The Gleason and Kochen–Specker theorems have been cited in support of various philosophies, including perspectivism, constructive empiricism and agential realism.[33][34][35] Quantum logic Gleason's theorem finds application in quantum logic, which makes heavy use of lattice theory. Quantum logic treats the outcome of a quantum measurement as a logical proposition and studies the relationships and structures formed by these logical propositions. They are organized into a lattice, in which the distributive law, valid in classical logic, is weakened, to reflect the fact that in quantum physics, not all pairs of quantities can be measured simultaneously.[36] The representation theorem in quantum logic shows that such a lattice is isomorphic to the lattice of subspaces of a vector space with a scalar product.[5]: §2 Using Solèr's theorem, the (skew) field K over which the vector space is defined can be proven, with additional hypotheses, to be either the real numbers, complex numbers, or the quaternions, as is needed for Gleason's theorem to hold.[12]: §3 [37][38] By invoking Gleason's theorem, the form of a probability function on lattice elements can be restricted. Assuming that the mapping from lattice elements to probabilities is noncontextual, Gleason's theorem establishes that it must be expressible with the Born rule.

Generalizations Gleason originally proved the theorem assuming that the measurements applied to the system are of the von Neumann type, i.e., that each possible measurement corresponds to an orthonormal basis of the Hilbert space. Later, Busch[39] and independently Caves et al.[24]: 116 [40] proved an analogous result for a more general class of measurements, known as positive-operator-valued measures (POVMs). The set of all POVMs includes the set of von Neumann measurements, and so the assumptions of this theorem are significantly stronger than Gleason's. This made the proof of this result simpler than Gleason's, and the conclusions stronger. Unlike the original theorem of Gleason, the generalized version using POVMs also applies to the case of a single qubit.[41][42] Assuming noncontextuality for POVMs is, however, controversial, as POVMs are not fundamental, and some authors defend that noncontextuality should be assumed only for the underlying von Neumann measurements.[43] Gleason's theorem, in its original version, does not hold if the Hilbert space is defined over the rational numbers, i.e., if the components of vectors in the Hilbert space are restricted to be rational numbers, or complex numbers with rational parts. However, when the set of allowed measurements is the set of all POVMs, the theorem holds.[40]: §3.D The original proof by Gleason was not constructive: one of the ideas on which it depends is the fact that every continuous function defined on a compact space attains its minimum. Because one cannot in all cases explicitly show where the minimum occurs, a proof that relies upon this principle will not be a constructive proof. However, the theorem can be reformulated in such a way that a constructive proof can be found.[20][44] Gleason's theorem can be extended to some cases where the observables of the theory form a von Neumann algebra. Specifically, an analogue of Gleason's result can be shown to hold if the algebra of observables has no direct summand that is representable as the algebra of 2×2 matrices over a commutative von Neumann algebra (i.e., no direct summand of type I2). In essence, the only barrier to proving the theorem is the fact that Gleason's original result does not hold when the Hilbert space is that of a qubit.[45] Notes ^ For additional discussion on this point, see Piron,[7]: §6 Drisch,[8] Horwitz and Biedenharn,[9] Razon and Horwitz,[10] Varadarajan,[11]: 83 Cassinelli and Lahti,[12]: §2 and Moretti and Oppio.[13] ^ Gleason allows for the possibility that a frame function is normalized to a constant other than 1, but focusing on the case of "unit weight" as done here does not result in any loss of generality. References ^ Jump up to: a b Gleason, Andrew M. (1957). "Measures on the closed subspaces of a Hilbert space". Indiana University Mathematics Journal. 6 (4): 885–893. doi:10.1512/iumj.1957.6.56050. MR 0096113. ^ Drieschner, M.; Görnitz, Th.; von Weizsäcker, C. F. (1988-03-01). "Reconstruction of abstract quantum theory". International Journal of Theoretical Physics. 27 (3): 289–306. Bibcode:1988IJTP...27..289D. doi:10.1007/bf00668895. ISSN 0020-7748. S2CID 122866239. ^ Jump up to: a b Barnum, H.; Caves, C. M.; Finkelstein, J.; Fuchs, C. A.; Schack, R. (2000-05-08). "Quantum probability from decision theory?". Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences. 456 (1997): 1175–1182. arXiv:quant-ph/9907024. Bibcode:2000RSPSA.456.1175B. CiteSeerX 10.1.1.769.8732. doi:10.1098/rspa.2000.0557. ISSN 1364-5021. S2CID 11563591. ^ Jump up to: a b Pitowsky, Itamar (2003). "Betting on the outcomes of measurements: a Bayesian theory of quantum probability". Studies in History and Philosophy of Modern Physics. 34 (3): 395–414. arXiv:quant-ph/0208121. Bibcode:2003SHPMP..34..395P. doi:10.1016/S1355-2198(03)00035-2. ^ Jump up to: a b c Pitowsky, Itamar (2006). "Quantum mechanics as a theory of probability". In Demopoulos, William; Pitowsky, Itamar (eds.). Physical Theory and its Interpretation: Essays in Honor of Jeffrey Bub. Springer. p. 213. arXiv:quant-ph/0510095. Bibcode:2005quant.ph.10095P. ISBN 9781402048760. OCLC 917845122. ^ Kunjwal, Ravi; Spekkens, Rob W. (2015-09-09). "From the Kochen–Specker theorem to noncontextuality inequalities without assuming determinism". Physical Review Letters. 115 (11): 110403. arXiv:1506.04150. Bibcode:2015PhRvL.115k0403K. doi:10.1103/PhysRevLett.115.110403. PMID 26406812. S2CID 10308680. ^ Piron, C. (1972-10-01). "Survey of general quantum physics". Foundations of Physics. 2 (4): 287–314. Bibcode:1972FoPh....2..287P. doi:10.1007/bf00708413. ISSN 0015-9018. S2CID 123364715. ^ Drisch, Thomas (1979-04-01). "Generalization of Gleason's theorem". International Journal of Theoretical Physics. 18 (4): 239–243. Bibcode:1979IJTP...18..239D. doi:10.1007/bf00671760. ISSN 0020-7748. S2CID 121825926. ^ Horwitz, L. P.; Biedenharn, L. C. (1984). "Quaternion quantum mechanics: Second quantization and gauge fields". Annals of Physics. 157 (2): 432–488. Bibcode:1984AnPhy.157..432H. doi:10.1016/0003-4916(84)90068-x. ^ Razon, Aharon; Horwitz, L. P. (1991-08-01). "Projection operators and states in the tensor product of quaternion Hilbert modules". Acta Applicandae Mathematicae. 24 (2): 179–194. doi:10.1007/bf00046891. ISSN 0167-8019. S2CID 119666741. ^ Varadarajan, Veeravalli S. (2007). Geometry of Quantum Theory (2nd ed.). Springer Science+Business Media. ISBN 978-0-387-96124-8. OCLC 764647569. ^ Jump up to: a b c Cassinelli, G.; Lahti, P. (2017-11-13). "Quantum mechanics: why complex Hilbert space?". Philosophical Transactions of the Royal Society A. 375 (2106): 20160393. Bibcode:2017RSPTA.37560393C. doi:10.1098/rsta.2016.0393. ISSN 1364-503X. PMID 28971945. ^ Moretti, Valter; Oppio, Marco (2018-10-16). "The Correct Formulation of Gleason's Theorem in Quaternionic Hilbert Spaces". Annales Henri Poincaré. 19 (11): 3321–3355. arXiv:1803.06882. Bibcode:2018AnHP...19.3321M. doi:10.1007/s00023-018-0729-8. S2CID 53630146. ^ John Bell (1966). "On the Problem of Hidden Variables in Quantum Mechanics". Reviews of Modern Physics. 38 (3): 447. doi:10.1103/RevModPhys.38.447. OSTI 1444158. ^ Jeffrey Bub (2010). "Von Neumann's 'No Hidden Variables' Proof: A Re-Appraisal". Foundations of Physics. 40 (9–10): 1333–1340. arXiv:1006.0499. doi:10.1007/s10701-010-9480-9. S2CID 118595119. ^ Jump up to: a b Mermin, N. David; Schack, Rüdiger (2018). "Homer nodded: von Neumann's surprising oversight". Foundations of Physics. 48 (9): 1007–1020. arXiv:1805.10311. Bibcode:2018FoPh...48.1007M. doi:10.1007/s10701-018-0197-5. S2CID 118951033. ^ Peres, Asher (1992). "An experimental test for Gleason's theorem". Physics Letters A. 163 (4): 243–245. doi:10.1016/0375-9601(92)91005-C. ^ Mackey, George W. (1957). "Quantum Mechanics and Hilbert Space". The American Mathematical Monthly. 64 (8P2): 45–57. doi:10.1080/00029890.1957.11989120. JSTOR 2308516. ^ Jump up to: a b Chernoff, Paul R. "Andy Gleason and Quantum Mechanics" (PDF). Notices of the AMS. 56 (10): 1253–1259. ^ Jump up to: a b c Hrushovski, Ehud; Pitowsky, Itamar (2004-06-01). "Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem". Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics. 35 (2): 177–194. arXiv:quant-ph/0307139. Bibcode:2004SHPMP..35..177H. doi:10.1016/j.shpsb.2003.10.002. S2CID 15265001. ^ Jump up to: a b Cooke, Roger; Keane, Michael; Moran, William (1985). "An elementary proof of Gleason's theorem". Mathematical Proceedings of the Cambridge Philosophical Society. 98 (1): 117–128. doi:10.1017/S0305004100063313. ^ Pitowsky, Itamar (1998). "Infinite and finite Gleason's theorems and the logic of indeterminacy". Journal of Mathematical Physics. 39 (1): 218–228. Bibcode:1998JMP....39..218P. doi:10.1063/1.532334. ^ Hudson, Robin Lyth (1986). "Geometry of quantum theory". The Mathematical Gazette. 70 (454): 332–333. doi:10.2307/3616230. JSTOR 3616230. ^ Jump up to: a b Fuchs, Christopher A. (2011). Coming of Age with Quantum Information: Notes on a Paulian Idea. Cambridge: Cambridge University Press. ISBN 978-0-521-19926-1. OCLC 535491156. ^ Stairs, Allen (2015). "Quantum Logic and Quantum Reconstruction". Foundations of Physics. 45 (10): 1351–1361. arXiv:1501.05492. Bibcode:2015FoPh...45.1351S. doi:10.1007/s10701-015-9879-4. S2CID 126435. ^ Jump up to: a b Wilce, A. (2017). "Quantum Logic and Probability Theory". In The Stanford Encyclopedia of Philosophy (Spring 2017 Edition), Edward N. Zalta (ed.). ^ Jump up to: a b c d e Mermin, N. David (1993-07-01). "Hidden variables and the two theorems of John Bell". Reviews of Modern Physics. 65 (3): 803–815. arXiv:1802.10119. Bibcode:1993RvMP...65..803M. doi:10.1103/RevModPhys.65.803. S2CID 119546199. ^ Shimony, Abner (1984). "Contextual Hidden Variable Theories and Bell's Inequalities". British Journal for the Philosophy of Science. 35 (1): 25–45. doi:10.1093/bjps/35.1.25. ^ Harrigan, Nicholas; Spekkens, Robert W. (2010). "Einstein, incompleteness, and the epistemic view of quantum states". Foundations of Physics. 40 (2): 125–157. arXiv:0706.2661. doi:10.1007/s10701-009-9347-0. S2CID 32755624. ^ Peres, Asher (1991). "Two simple proofs of the Kochen-Specker theorem". Journal of Physics A: Mathematical and General. 24 (4): L175–L178. Bibcode:1991JPhA...24L.175P. doi:10.1088/0305-4470/24/4/003. ISSN 0305-4470. ^ Stairs, Allen (1983). "Quantum Logic, Realism, and Value Definiteness". Philosophy of Science. 50 (4): 578–602. doi:10.1086/289140. S2CID 122885859. ^ Heywood, Peter; Redhead, Michael L. G. (1983). "Nonlocality and the Kochen–Specker paradox". Foundations of Physics. 13 (5): 481–499. doi:10.1007/BF00729511. S2CID 120340929. ^ Edwards, David (1979). "The Mathematical Foundations of Quantum Mechanics". Synthese. 42: 1–70. doi:10.1007/BF00413704. S2CID 46969028. ^ van Fraassen, Bas (1991). Quantum Mechanics: An Empiricist View. Clarendon Press. ISBN 9780198239802. OCLC 1005285550. ^ Barad, Karen (2007). Meeting the Universe Halfway: Quantum Physics and the Entanglement of Matter and Meaning. Duke University Press. ISBN 9780822339175. OCLC 894219980. ^ Dvurecenskij, Anatolij (1992). Gleason's Theorem and Its Applications. Mathematics and its Applications, Vol. 60. Dordrecht: Kluwer Acad. Publ. p. 348. ISBN 978-0-7923-1990-0. OCLC 751579618. ^ Baez, John C. (2010-12-01). "Solèr's Theorem". The n-Category Café. Retrieved 2017-04-24. ^ Moretti, Valter; Oppio, Marco (2019-06-01). "Quantum theory in quaternionic Hilbert space: How Poincaré symmetry reduces the theory to the standard complex one". Reviews in Mathematical Physics. 31 (4): 1950013–502. arXiv:1709.09246. Bibcode:2019RvMaP..3150013M. doi:10.1142/S0129055X19500132. S2CID 119733863. ^ Busch, Paul (2003). "Quantum States and Generalized Observables: A Simple Proof of Gleason's Theorem". Physical Review Letters. 91 (12): 120403. arXiv:quant-ph/9909073. Bibcode:2003PhRvL..91l0403B. doi:10.1103/PhysRevLett.91.120403. PMID 14525351. S2CID 2168715. ^ Jump up to: a b Caves, Carlton M.; Fuchs, Christopher A.; Manne, Kiran K.; Renes, Joseph M. (2004). "Gleason-Type Derivations of the Quantum Probability Rule for Generalized Measurements". Foundations of Physics. 34 (2): 193–209. arXiv:quant-ph/0306179. Bibcode:2004FoPh...34..193C. doi:10.1023/B:FOOP.0000019581.00318.a5. S2CID 18132256. ^ Robert W. Spekkens (2014). "The Status of Determinism in Proofs of the Impossibility of a Noncontextual Model of Quantum Theory". Foundations of Physics. 44 (11): 1125–1155. arXiv:1312.3667. doi:10.1007/s10701-014-9833-x. S2CID 118469528. ^ Wright, Victoria J.; Weigert, Stephan (2019). "A Gleason-type theorem for qubits based on mixtures of projective measurements". Journal of Physics A. 52 (5): 055301. arXiv:1808.08091. doi:10.1088/1751-8121/aaf93d. S2CID 119309162. ^ Andrzej Grudka; Paweł Kurzyński (2008). "Is There Contextuality for a Single Qubit?". Physical Review Letters. 100 (16): 160401. arXiv:0705.0181. doi:10.1103/PhysRevLett.100.160401. PMID 18518167. S2CID 13251108. ^ Richman, Fred; Bridges, Douglas (1999-03-10). "A Constructive Proof of Gleason's Theorem". Journal of Functional Analysis. 162 (2): 287–312. doi:10.1006/jfan.1998.3372. ^ Hamhalter, Jan (2003-10-31). Quantum Measure Theory. Springer Science & Business Media. ISBN 9781402017148. MR 2015280. OCLC 928681664. Zbl 1038.81003. Categories: Hilbert spaceQuantum measurementProbability theorems

Si quieres conocer otros artículos parecidos a **Gleason's theorem** puedes visitar la categoría **Hilbert space**.

Deja una respuesta