Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical

DOI10.4230/LIPIcs.TQC.2014.118zbMath1359.68087arXiv1403.1588OpenAlexW2265000518MaRDI QIDQ2969055

Niel de Beaudrap

Publication date: 13 March 2017

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

zbMATH Keywords

Hamiltoniancountingfrustration-freequantum satisfiability

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

This page was built for publication: Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical