Linear Time Algorithm for Quantum 2SAT

DOI10.4230/LIPIcs.ICALP.2016.15zbMath1388.68064arXiv1508.06340OpenAlexW2887977568MaRDI QIDQ4598148

Shengyu Zhang, Aarthi Sundaram, Itai Arad, Miklos Santha

Publication date: 19 December 2017

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

zbMATH Keywords

linear-time algorithmDavis-Putnam procedurequantum SAT

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (4)

The complexity of translationally invariant spin chains with low local dimension ⋮ Unnamed Item ⋮ On efficiently solvable cases of quantum \(k\)-SAT ⋮ Linear-Time Algorithm for Quantum 2SAT

This page was built for publication: Linear Time Algorithm for Quantum 2SAT