Additional Metadata
THEME Other (theme 6)
Persistent URL dx.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
Citation
de Beaudrap, J.R.N. (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