Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.35
URN: urn:nbn:de:0030-drops-81290
URL: https://drops.dagstuhl.de/opus/volltexte/2017/8129/
Abramsky, Samson ; Barbosa, Rui Soares ; de Silva, Nadish ; Zapata, Octavio
The Quantum Monad on Relational Structures
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{abramsky_et_al:LIPIcs:2017:8129,
author = {Samson Abramsky and Rui Soares Barbosa and Nadish de Silva and Octavio Zapata},
title = {{The Quantum Monad on Relational Structures}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {35:1--35:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8129},
URN = {urn:nbn:de:0030-drops-81290},
doi = {10.4230/LIPIcs.MFCS.2017.35},
annote = {Keywords: non-local games, quantum computation, monads}
}
| Keywords: | non-local games, quantum computation, monads | |
| Seminar: | 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 01.12.2017 |
