A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph

Chancellor, N.; Zohren, S.; Warburton, P.A.; Benjamin, S.C.; Roberts, S.

Abstract

We demonstrate a direct mapping of max k-SAT problems (and weighted max k-SAT) to a Chimera graph, which is the non-planar hardware graph of the devices built by D-Wave Systems Inc. We further show that this mapping can be used to map a similar class of maximum satisfiability problems where the clauses are replaced by parity checks over potentially large numbers of bits. The latter is of specific interest for applications in decoding for communication. We discuss an example in which the decoding of a turbo code, which has been demonstrated to perform near the Shannon limit, can be mapped to a Chimera graph. The weighted max k-SAT problem is the most general class of satisfiability problems, so our result effectively demonstrates how any satisfiability problem may be directly mapped to a Chimera graph. Our methods faithfully reproduce the low energy spectrum of the target problems, so therefore may also be used for maximum entropy inference.

Citation

Chancellor, N., Zohren, S., Warburton, P., Benjamin, S., & Roberts, S. (2016). A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph. Scientific Reports, 6, Article 37107. https://doi.org/10.1038/srep37107

• Journal Article Type: Article
• Acceptance Date: Oct 21, 2016
• Online Publication Date: Nov 18, 2016
• Publication Date: Nov 18, 2016
• Deposit Date: Dec 9, 2016
• Publicly Available Date: Dec 15, 2016
• Journal: Scientific Reports
• Electronic ISSN: 2045-2322
• Publisher: Nature Research
• Peer Reviewed: Peer Reviewed
• Volume: 6
• Article Number: 37107
• DOI: https://doi.org/10.1038/srep37107
• Public URL: https://durham-repository.worktribe.com/output/1389873