Conference item icon

Conference item

The quantum monad on relational structures

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 h...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

Actions


Access Document


Files:
Publisher copy:
10.4230/LIPIcs.MFCS.2017.35

Authors


More by this author
Department:
Wolfson College
More by this author
Department:
Oxford, Colleges and Halls, Wolfson College
de Silva, N More by this author
Mexican National Council of Science and Technology More from this funder
Cambridge Quantum Computing Ltd More from this funder
Publisher:
Schloss Dagstuhl – Leibniz Center for Informatics Publisher's website
Publication date:
2017-11-05
Acceptance date:
2017-06-12
DOI:
ISSN:
1868-8969
Pubs id:
pubs:710491
URN:
uri:ff966d42-a16f-45bd-af9c-21b32f9ed28d
UUID:
uuid:ff966d42-a16f-45bd-af9c-21b32f9ed28d
Local pid:
pubs:710491

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP