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

Niel de Beaudrap. Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical. In Steven T. Flammia, Aram Wettroth Harrow, editors, 9th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2014, May 21-23, 2014, Singapore. Volume 27 of LIPIcs, pages 118-140, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]

Abstract

Abstract is missing.