Difficult instances of the counting problem for 2-quantum-SAT are very atypical

Additional Metadata
THEME	Other (theme 6)
Persistent URL	doi.org/10.4230/LIPIcs.TQC.2014.118
Project	Quantum computing: fault-tolerance, communication, and classical spin-offs , Quantum Algorithmics
Conference	Conference on Theory of Quantum Computation, Communication and Cryptography
Grant	This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/639.072.803 - Quantum computing: fault-tolerance, communication, and classical spin-offs
Organisation	Algorithms and Complexity
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	de Beaudrap, J. (2014). Difficult instances of the counting problem for 2-quantum-SAT are very atypical. In Proceedings of Conference on Theory of Quantum Computation, Communication and Cryptography 2014 (TQC 0). doi:10.4230/LIPIcs.TQC.2014.118

Additional Files
23040B.pdf Author Manuscript , 299kb
Publisher Version

Publication