@InProceedings{debeaudrap:LIPIcs.TQC.2014.118,
author = {de Beaudrap, Niel},
title = {{Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical}},
booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)},
pages = {118--140},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-73-6},
ISSN = {1868-8969},
year = {2014},
volume = {27},
editor = {Flammia, Steven T. and Harrow, Aram W.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.118},
URN = {urn:nbn:de:0030-drops-48129},
doi = {10.4230/LIPIcs.TQC.2014.118},
annote = {Keywords: Frustration-free, Hamiltonian, quantum, counting, satisfiability}
}