Work

Approximate Constraint Satisfaction in the Quantum Setting.

Year: 2018
Type: article
Abstract: Approximation algorithms for constraint satisfaction problems are a central direction of study in theoretical computer science.In this work, we study approximation algorithms from a quantum perspective in two complementary settings: Classical approximation algorithms for quantum constraint satisfaction problems (quantum CSPs), and quantum algorithms for classical CSPs.Our results are as follows:
Language: English
Open Access status: green
OpenAlex ID: W4295092768
FWCI:
Cites: 37
Cited by:
Related to: 10