Work

Quantum advantage and CSP complexity

Year: 2025

Type: article

Abstract: Information-processing tasks modelled by homomorphisms between relational structures can witness quantum advantage when entanglement is used as a computational resource. We prove that the occurrence of quantum advantage is determined by the same algebraic structure (known as the polymorphism minion) that captures the complexity of CSPs. We investigate the connection between the minion of quantum advantage and other known minions controlling CSP tractability and width. In this way, we make use of complexity results from the algebraic theory of CSPs to characterise the occurrence of quantum advantage in the case of graphs, and to obtain new necessary and sufficient conditions in the case of arbitrary relational structures.

Source: Journal of Combinatorial Theory Series B

DOI: 10.1016/j.jctb.2025.10.002

Author: Lorenzo Ciardo

Institution: Graz University of Technology

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,150

Funder: University of Oxford