Quantum contextuality

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Quantum contextuality is a feature of quantum mechanics whereby measurements of quantum observables cannot simply be thought of as revealing pre-existing values. Any attempt to do so leads to values that are dependent upon which other measurements are being performed (the measurement context). More formally, the measurement result of a quantum observable is dependent upon which other commuting observables are within the same measurement set.

Contextuality was first demonstrated to be a feature of quantum mechanics by the Bell–Kochen–Specker theorem.[1][2] The study of contextuality has developed into a major topic of interest in quantum foundations as the phenomenon crystallises certain non-classical and counter-intuitive aspects of quantum theory. A number of powerful mathematical frameworks have been developed to study and better understand contextuality, from the perspective of sheaf theory,[3] graph theory,[4] hypergraphs,[5] and algebraic topology.[6]

Nonlocality, in the sense of Bell's theorem, may be viewed as a special case of the more general phenomenon of contextuality, in which measurement contexts contain measurements that are distributed over spacelike separated regions. This follows from the Fine–Abramsky–Brandenburger theorem.[7][3]

Quantum contextuality has been identified as a source of quantum computational speedups and quantum advantage in quantum computing.[8][9][10][11] Contemporary research has increasingly focused on exploring its utility as a computational resource.

Kochen and Specker[edit]

Simon B. Kochen and Ernst Specker, and separately John Bell, constructed proofs that quantum mechanics is contextual for systems of Hilbert space dimension three and greater. The Kochen–Specker theorem proves that noncontextual hidden variable theories cannot reproduce the empirical predictions of quantum mechanics.[12] Such a theory would suppose the following.

  1. All quantum-mechanical observables may be assigned definite values. These global value assignments may be 'hidden' in the sense that the state of a quantum system could be described by a probabilistic mixture of assignments.
  2. Value assignments are independent of which other commuting observables are also measured.

In addition, Kochen and Specker constructed an explicitly noncontextual hidden variable model for the two-dimensional qubit case in their paper on the subject,[1] thereby completing the characterisation of the dimensionality of quantum systems that can demonstrate contextual behaviour. Bell's proof invoked a weaker version of Gleason's theorem, reinterpreting the theorem to show that quantum contextuality exists only in Hilbert space dimension greater than two.[2]

Frameworks for contextuality[edit]

Sheaf-theoretic framework[edit]

The sheaf-theoretic, or Abramsky–Brandenburger, approach to contextuality initiated by Samson Abramsky and Adam Brandenburger is theory-independent and can be applied beyond quantum theory to any situation in which empirical data arises in contexts. As well as being used to study forms of contextuality arising in quantum theory and other physical theories, it has also been used to study formally equivalent phenomena in logic,[13] relational databases,[14] natural language processing,[15] and constraint satisfaction.[16]

In essence, contextuality arises when empirical data is locally consistent but globally inconsistent. Analogies may be drawn with impossible figures like the Penrose staircase, which in a formal sense may also be said to exhibit a kind of contextuality.[1]

This framework gives rise in a natural way to a qualitative hierarchy of contextuality.

  • (Probabilistic) contextuality may be witnessed in measurement statistics, e.g. by the violation of an inequality. A representative example is the KCBS proof of contextuality.
  • Logical contextuality may be witnessed in the 'possibilistic' information about which outcome events are possible and which are not possible. A representative example is Hardy's nonlocality proof of nonlocality.
  • Strong contextuality is a maximal form of contextuality. Whereas (probabilistic) contextuality arises when measurement statistics cannot be reproduced by a mixture of global value assignments, strong contextuality arises when no global value assignment is even compatible with the possible outcome events. A representative example is the original Kochen–Specker proof of contextuality.

Each level in this hierarchy strictly includes the next. An important intermediate level that lies strictly between the logical and strong contextuality classes is all-versus-nothing contextuality,[13] a representative example of which is the Greenberger–Horne–Zeilinger proof of nonlocality.

Graph and hypergraph frameworks[edit]

Adán Cabello, Simone Severini, and Andreas Winter introduced a general graph-theoretic framework for studying contextuality of different physical theories.[17] Within this framework experimental scenarios are described by graphs, and certain invariants of these graphs were shown have particular physical significance. One way in which contextuality may be witnessed in measurement statistics is though the violation of noncontextuality inequalities (also known as generalized Bell inequalities). With respect to certain appropriately normalised inequalities, the independence number, Lovász number, and fractional packing number of the graph of an experimental scenario provide tight upper bounds on the degree to which classical theories, quantum theory, and generalised probabilistic theories, respectively, may exhibit contextuality in an experiment of that kind. A more refined framework based on hypergraphs rather than graphs is also used.[5]

Operational framework[edit]

An extended notion of contextuality due to Robert Spekkens applies to preparations and transformations as well as to measurements, within a general framework of operational physical theories.[18] With respect to measurements, it removes the assumption of determinism of value assignments that is present in standard definitions of contextuality. This breaks the interpretation of nonlocality as a special case of contextuality, and does not treat irreducible randomness as nonclassical. Nevertheless, it recovers the usual notion of contextuality when outcome determinism is imposed.

Spekkens' contextuality can be motivated using Leibniz's law of the identity of indiscernibles. The law applied to physical systems in this framework mirrors the entended definition of noncontextuality. This was further explored by Simmons et al,[19] who demonstrated that other notions of contextuality could also be motivated by Leibnizian principles, and could be thought of as tools enabling ontological conclusions from operational statistics.

Other frameworks and extensions[edit]

  • A framework due to Ehtibar Dzhafarov, Janne Kujala and Victor Cervantes known as contextuality-by-default[20] has recently inspired researchers to apply the concept of contextuality to human psychology and sociology. This has met with mixed results.[21][22]
  • A form of contextuality that may present in the dynamics of a quantum system was introduced by Shane Mansfield and Elham Kashefi, and has been shown to relate to computational quantum advantages.[23] As a notion of contextuality that applies to transformations it is inequivalent to that of Spekkens. Examples explored to date rely on additional memory constraints which have a more computational than foundational motivation. Contextuality may be traded-off against Landauer erasure to obtain equivalent advantages.[24]

Fine–Abramsky–Brandenburger theorem[edit]

The Kochen–Specker theorem proves that quantum mechanics is incompatible with noncontextual hidden variable models. On the other hand Bell's theorem proves that quantum mechanics is incompatible with factorisable hidden variable models in an experiment in which measurements are performed at distinct spacelike separated locations. Arthur Fine showed that in the experimental scenario in which the famous CHSH inequalities and proof of nonlocality apply, a factorisable hidden variable model exists if and only if an noncontextual hidden variable model exists.[7] This equivalence was proven to hold more generally in any experimental scenario by Samson Abramsky and Adam Brandenburger.[3] It is for this reason that we may consider nonlocality to be a special case of contextuality.

Contextual fraction[edit]

A number of methods exist for quantifying contextuality. One approach is by measuring the degree to which some particular noncontextuality inequality is violated, e.g. the KCBS inequality, the Yu–Oh inequality,[25] or some Bell inequality. A more general measure of contextuality is the contextual fraction.[10]

Given a set of measurement statistics e, consisting of a probability distribution over joint outcomes for each measurement context, we may consider factoring e into a noncontextual part eNC and some remainder e',

The maximum value of λ over all such decompositions is the noncontextual fraction of e denoted NCF(e), while the remainder CF(e)=(1-NCF(e)) is the contextual fraction of e. The idea is that we look for a noncontextual explanation for the highest possible fraction of the data, and what is left over is the irreducibly contextual part. Indeed for any such decomposition that maximises λ the leftover e' is known to be strongly contextual. This measure of contextuality takes values in the interval [0,1], where 0 corresponds to noncontextuality and 1 corresponds to strong contextuality. The contextual fraction may be computed using linear programming.

It has also been proved that CF(e) is an upper bound on the extent to which e violates any normalised noncontextuality inequality.[10] Here normalisation means that violations are expressed as fractions of the algebraic maximum violation of the inequality. Moreover, the dual linear program to that which maximises λ computes a noncontextual inequality for which this violation is attained. In this sense the contextual fraction is a more neutral measure of contextuality, since it optimises over all possible noncontextual inequalities rather than checking the statistics against one inequality in particular.

Contextuality as a resource for quantum computing[edit]

Recently, quantum contextuality has been investigated as a source of quantum advantage and computational speedups in quantum computing.

Magic state injection[edit]

Magic state injection is a scheme for quantum computing in which quantum circuits constructed only of Clifford operators, which by themselves are fault-tolerant but efficiently classically simulable, are injected with certain "magic" states that promote the computational power to universal fault-tolerant quantum computing.[26] In 2014, Mark Howard, et al. showed that contextuality characterises magic states for qudits of odd prime dimension and for qubits with real wavefunctions.[27] Extensions to the qubit case have been investigated by Juani Bermejo-Vega et al.[25] This line of research builds on earlier work by Ernesto Galvão,[24] which showed that Wigner function negativity is necessary for a state to be "magic"; it later emerged that Wigner negativity and contextuality are in a sense equivalent notions of nonclassicality.[28]

Measurement-based quantum computing[edit]

Measurement-based quantum computation (MBQC) is a model for quantum computing in which a classical control computer interacts with a quantum system by specifying measurements to be performed and receiving measurement outcomes in return. The measurement statistics for the quantum system may or may not exhibit contextuality. A variety of results have shown that the presence of contextuality enhances the computational power of an MBQC.

In particular, researchers have considered an artificial situation in which the power of the classical control computer is restricted to only being able to compute linear Boolean functions, i.e. to solve problems in the Parity L complexity class ⊕L. For interactions with multi-qubit quantum systems a natural assumption is that each step of the interaction consists of a binary choice of measurement which in turn returns a binary outcome. An MBQC of this restricted kind is known as an l2-MBQC.[29]

Anders and Browne[edit]

In 2009, Janet Anders and Dan Browne showed that two specific examples of nonlocality and contextuality were sufficient to compute a non-linear function. This in turn could be used to boost computational power to that of a universal classical computer, i.e. to solve problems in the complexity class P.[30] This is sometimes referred to as measurement-based classical computation.[31] The specific examples made use of the Greenberger–Horne–Zeilinger nonlocality proof and the supra-quantum Popescu–Rohrlich box.

Raussendorf[edit]

In 2013, Robert Raussendorf showed more generally that access to strongly contextual measurement statistics is necessary and sufficient for an l2-MBQC to compute a non-linear function. He also showed that to compute non-linear Boolean functions with sufficiently high probability requires contextuality.[29]

Abramsky, Barbosa and Mansfield[edit]

A further generalisation and refinement of these results due to Samson Abramsky, Rui Soares Barbosa and Shane Mansfield appeared in 2017, proving a precise quantifiable relationship between the probability of successfully computing any given non-linear function and the degree of contextuality present in the l2-MBQC as measured by the contextual fraction.[10] Specifically,

where are the probability of success, the contextual fraction of the measurement statistics e, and a measure of the non-linearity of the function to be computed , respectively.

Further examples[edit]

  • The above inequality was also shown to relate quantum advantage in non-local games to the degree of contextuality required by the strategy and an appropriate measure of the difficulty of the game.[10]
  • Similarly the inequality arises in a transformation-based model of quantum computation analogous to l2-MBQC where it relates the degree of sequential contextuality present in the dynamics of the quantum system to the probability of success and the degree of non-linearity of the target function.[23]
  • Preparation contextuality has been shown to enable quantum advantages in cryptographic random-access codes[32] and in state-discrimination tasks.[33]
  • In classical simulations of quantum systems, contextuality has been shown to incur memory costs.[34]

See also[edit]

References[edit]

  1. ^ a b S. Kochen and E.P. Specker, "The problem of hidden variables in quantum mechanics", Journal of Mathematics and Mechanics 17, 59–87 (1967)
  2. ^ a b Gleason, A. M, "Measures on the closed subspaces of a Hilbert space", Journal of Mathematics and Mechanics 6, 885–893 (1957).
  3. ^ a b c Abramsky, Samson; Brandenburger, Adam (2011-11-28). "The Sheaf-Theoretic Structure Of Non-Locality and Contextuality". New Journal of Physics. 13 (11): 113036. arXiv:1102.0264. Bibcode:2011NJPh...13k3036A. doi:10.1088/1367-2630/13/11/113036. ISSN 1367-2630.
  4. ^ Cabello, Adan; Severini, Simone; Winter, Andreas (2014-01-27). "Graph-Theoretic Approach to Quantum Correlations". Physical Review Letters. 112 (4): 040401. arXiv:1401.7081. Bibcode:2014PhRvL.112d0401C. doi:10.1103/PhysRevLett.112.040401. ISSN 0031-9007. PMID 24580419.
  5. ^ a b Acín, Antonio; Fritz, Tobias; Leverrier, Anthony; Sainz, Ana Belén (2015-03-01). "A Combinatorial Approach to Nonlocality and Contextuality". Communications in Mathematical Physics. 334 (2): 533–628. arXiv:1212.4084. doi:10.1007/s00220-014-2260-1. ISSN 1432-0916.
  6. ^ Abramsky, Samson; Mansfield, Shane; Barbosa, Rui Soares (2012-10-01). "The Cohomology of Non-Locality and Contextuality". Electronic Proceedings in Theoretical Computer Science. 95: 1–14. arXiv:1111.3620. doi:10.4204/EPTCS.95.1. ISSN 2075-2180.
  7. ^ a b Fine, Arthur (1982-02-01). "Hidden Variables, Joint Probability, and the Bell Inequalities". Physical Review Letters. 48 (5): 291–295. doi:10.1103/PhysRevLett.48.291.
  8. ^ Raussendorf, Robert (2013-08-19). "Contextuality in measurement-based quantum computation". Physical Review A. 88 (2). arXiv:0907.5449. doi:10.1103/PhysRevA.88.022322. ISSN 1050-2947.
  9. ^ Howard, Mark; Wallman, Joel; Veitch, Victor; Emerson, Joseph (June 2014). "Contextuality supplies the 'magic' for quantum computation". Nature. 510 (7505): 351–355. arXiv:1401.4174. doi:10.1038/nature13460. ISSN 0028-0836. PMID 24919152.
  10. ^ a b c d e Abramsky, Samson; Barbosa, Rui Soares; Mansfield, Shane (2017-08-04). "Contextual Fraction as a Measure of Contextuality". Physical Review Letters. 119 (5): 050504. arXiv:1705.07918. doi:10.1103/PhysRevLett.119.050504. ISSN 0031-9007.
  11. ^ Bermejo-Vega, Juan; Delfosse, Nicolas; Browne, Dan E.; Okay, Cihan; Raussendorf, Robert (2017-09-21). "Contextuality as a Resource for Models of Quantum Computation with Qubits". Physical Review Letters. 119 (12). doi:10.1103/PhysRevLett.119.120505. ISSN 0031-9007.
  12. ^ Carsten, Held (2000-09-11). "The Kochen–Specker Theorem". plato.stanford.edu. Retrieved 2018-11-17.
  13. ^ a b Abramsky, Samson; Soares Barbosa, Rui; Kishida, Kohei; Lal, Raymond; Mansfield, Shane (2015). "Contextuality, Cohomology and Paradox". Schloss Dagstuhl - Leibniz-Zentrum Fuer Informatik GMBH, Wadern/Saarbruecken, Germany. doi:10.4230/lipics.csl.2015.211.
  14. ^ Abramsky, Samson (2013), Tannen, Val; Wong, Limsoon; Libkin, Leonid; Fan, Wenfei (eds.), "Relational Databases and Bell's Theorem", In Search of Elegance in the Theory and Practice of Computation: Essays Dedicated to Peter Buneman, Lecture Notes in Computer Science, Springer Berlin Heidelberg, 8000, pp. 13–35, doi:10.1007/978-3-642-41660-6_2, ISBN 9783642416606
  15. ^ Abramsky, Samson; Sadrzadeh, Mehrnoosh (2014), Casadio, Claudia; Coecke, Bob; Moortgat, Michael; Scott, Philip (eds.), "Semantic Unification", Categories and Types in Logic, Language, and Physics: Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday, Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 1–13, doi:10.1007/978-3-642-54789-8_1, ISBN 9783642547898
  16. ^ Abramsky, Samson; Dawar, Anuj; Wang, Pengming (June 2017). "The pebbling comonad in Finite Model Theory". 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Reykjavik, Iceland: IEEE: 1–12. arXiv:1704.05124. doi:10.1109/LICS.2017.8005129. ISBN 9781509030187.
  17. ^ A. Cabello, S. Severini, A. Winter, Graph-Theoretic Approach to Quantum Correlations", Physical Review Letters 112 (2014) 040401.
  18. ^ Spekkens, R. W. (2005-05-31). "Contextuality for preparations, transformations, and unsharp measurements". Physical Review A. 71 (5): 052108. arXiv:quant-ph/0406166. Bibcode:2005PhRvA..71e2108S. doi:10.1103/PhysRevA.71.052108. ISSN 1050-2947.
  19. ^ A.W. Simmons, Joel J. Wallman, H. Pashayan, S. D. Bartlett, T. Rudolph, "Contextuality under weak assumptions", New J. Phys. 19 033030, (2017).
  20. ^ Dzhafarov, Ehtibar N.; Kujala, Janne V.; Cervantes, Victor H. (2015-04-02). "Contextuality-by-Default: A Brief Overview of Ideas, Concepts, and Terminology". arXiv:1504.00530. Bibcode:2015arXiv150400530D. doi:10.1007/978-3-319-28675-4-2 (inactive 2019-08-20).
  21. ^ Kujala, Janne; Zhang, Ru; Dzhafarov, Ehtibar (2015-04-28). "Is there contextuality in behavioral and social systems?". Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. 374 (2058): 20150099. arXiv:1504.07422. Bibcode:2015RSPTA.37450099D. doi:10.1098/rsta.2015.0099. PMID 26621988.
  22. ^ Cervantes, Victor H.; Dzhafarov, Ehtibar N. (2018-11-30). "True Contextuality in a Psychophysical Experiment". arXiv:1812.00105 [q-bio.NC].
  23. ^ a b Mansfield, Shane; Kashefi, Elham (2018-12-03). "Quantum Advantage from Sequential-Transformation Contextuality". Physical Review Letters. 121 (23): 230401. arXiv:1801.08150. doi:10.1103/PhysRevLett.121.230401. PMID 30576205.
  24. ^ a b Henaut, Luciana; Catani, Lorenzo; Browne, Dan E.; Mansfield, Shane; Pappa, Anna (2018-12-17). "Tsirelson's bound and Landauer's principle in a single-system game" (PDF). Physical Review A. 98 (6): 060302. doi:10.1103/PhysRevA.98.060302.
  25. ^ a b Yu, Sixia; Oh, C. H. (2012-01-18). "State-Independent Proof of Kochen-Specker Theorem with 13 Rays". Physical Review Letters. 108 (3): 030402. arXiv:1109.4396. doi:10.1103/PhysRevLett.108.030402. PMID 22400719.
  26. ^ Bravyi, Sergey; Kitaev, Alexei (2005-02-22). "Universal quantum computation with ideal Clifford gates and noisy ancillas" (PDF). Physical Review A. 71 (2): 022316. doi:10.1103/PhysRevA.71.022316.
  27. ^ Howard, Mark; Wallman, Joel; Veitch, Victor; Emerson, Joseph (June 2014). "Contextuality supplies the 'magic' for quantum computation". Nature. 510 (7505): 351–355. arXiv:1401.4174. Bibcode:2014Natur.510..351H. doi:10.1038/nature13460. ISSN 0028-0836. PMID 24919152.
  28. ^ Spekkens, Robert W. (2008-07-07). "Negativity and Contextuality are Equivalent Notions of Nonclassicality". Physical Review Letters. 101 (2): 020401. arXiv:0710.5549. doi:10.1103/PhysRevLett.101.020401. PMID 18764163.
  29. ^ a b Raussendorf, Robert (2013-08-19). "Contextuality in Measurement-based Quantum Computation". Physical Review A. 88 (2): 022322. arXiv:0907.5449. Bibcode:2013PhRvA..88b2322R. doi:10.1103/PhysRevA.88.022322. ISSN 1050-2947.
  30. ^ Anders, Janet; Browne, Dan E. (2009-02-04). "Computational Power of Correlations". Physical Review Letters. 102 (5): 050502. arXiv:0805.1002. doi:10.1103/PhysRevLett.102.050502.
  31. ^ Hoban, Matty J.; Wallman, Joel J.; Anwar, Hussain; Usher, Naïri; Raussendorf, Robert; Browne, Dan E. (2014-04-09). "Measurement-Based Classical Computation" (PDF). Physical Review Letters. 112 (14): 140505. doi:10.1103/PhysRevLett.112.140505.
  32. ^ Chailloux, André; Kerenidis, Iordanis; Kundu, Srijita; Sikora, Jamie (April 2016). "Optimal bounds for parity-oblivious random access codes". New Journal of Physics. 18 (4): 045003. doi:10.1088/1367-2630/18/4/045003. ISSN 1367-2630.
  33. ^ Schmid, David; Spekkens, Robert W. (2018-02-02). "Contextual Advantage for State Discrimination". Physical Review X. 8 (1): 011015. doi:10.1103/PhysRevX.8.011015.
  34. ^ Kleinmann, Matthias; Gühne, Otfried; Portillo, José R.; Larsson, Jan-\AAke; Cabello, Adán (November 2011). "Memory cost of quantum contextuality". New Journal of Physics. 13 (11): 113011. doi:10.1088/1367-2630/13/11/113011. ISSN 1367-2630.