A quantum lovász local lemma

DOI10.1145/1806689.1806712zbMath1293.68125OpenAlexW2104793281MaRDI QIDQ2875141

Or Sattath, Julia Kempe, Andris Ambainis

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806712

zbMATH Keywords

quantum computationprobabilistic methodLovász local lemmaquantum SATrandom quantum SAT

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Quantum 3-SAT Is QMA$_1$-Complete

This page was built for publication: A quantum lovász local lemma