A quantum Lovász local lemma

DOI10.1145/2371656.2371659zbMath1281.68110arXiv0911.1696OpenAlexW1993731868WikidataQ124829448 ScholiaQ124829448MaRDI QIDQ5395693

Or Sattath, Andris Ambainis, Julia Kempe

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.1696

zbMATH Keywords

quantum computationprobabilistic methodlocal lemmarandom quantum SATquanum SAT

Mathematics Subject Classification ID

Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Quantum algorithms and complexity in the theory of computing (68Q12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Quantum Max-flow/Min-cut ⋮ Total functions in QMA ⋮ On efficiently solvable cases of quantum \(k\)-SAT

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