The Quantum Monad on Relational Structures

Homomorphisms between relational structures play a central role in finite model theory, constraint satisfaction, and database theory. A central theme in quantum computation is to show how quantum resources can be used to gain advantage in information processing tasks. In particular, non-local games have been used to exhibit quantum advantage in boolean constraint satisfaction, and to obtain quantum versions of graph invariants such as the chromatic number. We show how quantum strategies for homomorphism games between relational structures can be viewed as Kleisli morphisms for a quantum monad on the (classical) category of relational structures and homomorphisms. We use these results to exhibit a wide range of examples of contextuality-powered quantum advantage, and to unify several apparently diverse strands of previous work.

[1]  David E. Roberson,et al.  Variations on a Theme: Graph Homomorphisms , 2013 .

[2]  Kohei Kishida,et al.  Contextuality, Cohomology and Paradox , 2015, CSL.

[3]  Zheng-Feng Ji,et al.  Binary Constraint System Games and Locally Commutative Reductions , 2013, ArXiv.

[4]  N. Mermin.  Quantum mysteries revisited , 1990 .

[5]  William Slofstra,et al.  Perfect Commuting-Operator Strategies for Linear System Games , 2016, 1606.02278.

[6]  B. Blackadar,et al.  Operator Algebras: Theory of C*-Algebras and von Neumann Algebras , 2005 .

[7]  Stefan Milius,et al.  Generic Trace Semantics and Graded Monads , 2015, CALCO.

[8]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[9]  Rajat Mittal,et al.  Characterization of Binary Constraint System Games , 2012, ICALP.

[10]  R. F. Werner,et al.  Tsirelson's Problem , 2008, 0812.4305.

[11]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[12]  Kohei Kishida,et al.  Minimum Quantum Resources for Strong Non-Locality , 2017, TQC.

[13]  Philip D. Plowright,et al.  Convexity , 2019, Optimization for Chemical and Biochemical Engineering.

[14]  David E. Roberson,et al.  Quantum and non-signalling graph isomorphisms , 2016, J. Comb. Theory B.

[15]  Samson Abramsky,et al.  Categorical quantum mechanics , 2008, 0808.1023.

[16]  S. Lane.  Categories for the Working Mathematician , 1971 .

[17]  Mermin Nd.  Simple unified form for the major no-hidden-variables theorems. , 1990 .

[18]  Teiko Heinosaari,et al.  Notes on Joint Measurability of Quantum Observables , 2008, 0811.0783.

[19]  William Slofstra,et al.  Tsirelson’s problem and an embedding theorem for groups arising from non-local games , 2016, Journal of the American Mathematical Society.

[20]  David E. Roberson,et al.  Quantum homomorphisms , 2016, J. Comb. Theory, Ser. B.

[21]  Phokion G. Kolaitis,et al.  Conjunctive-Query Containment and Constraint Satisfaction , 2000, J. Comput. Syst. Sci..

[22]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[23]  M. Redhead,et al.  Nonlocality and the Kochen-Specker paradox , 1983 .

[24]  Samson Abramsky,et al.  A categorical semantics of quantum protocols , 2004, LICS 2004.

[25]  Simone Severini,et al.  On the Quantum Chromatic Number of a Graph , 2007, Electron. J. Comb..

[26]  E. Specker,et al.  The Problem of Hidden Variables in Quantum Mechanics , 1967 .

[27]  A. Kock.  Monads on symmetric monoidal closed categories , 1970 .

[28]  Samson Abramsky,et al.  The sheaf-theoretic structure of non-locality and contextuality , 2011, 1102.0264.

[29]  Rui Soares Barbosa,et al.  Contextual Fraction as a Measure of Contextuality. , 2017, Physical review letters.

[30]  A. Zeilinger,et al.  Going Beyond Bell’s Theorem , 2007, 0712.0921.

[31]  S. Popescu,et al.  Quantum nonlocality as an axiom , 1994 .

[32]  A. Cabello,et al.  Bell-Kochen-Specker theorem: A proof with 18 vectors , 1996, quant-ph/9706009.

[33]  Pengming Wang,et al.  The pebbling comonad in Finite Model Theory , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).