Skip to main content

Research Repository

Advanced Search

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.

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


Authors

S. Zohren

P.A. Warburton

S.C. Benjamin

S. Roberts



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 Mar 28, 2024
Journal Scientific Reports
Publisher Nature Research
Peer Reviewed Peer Reviewed
Volume 6
Article Number 37107
DOI https://doi.org/10.1038/srep37107

Files

Published Journal Article (959 Kb)
PDF

Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/

Copyright Statement
This work is licensed under a Creative Commons Attribution 4.0 International License. The images
or other third party material in this article are included in the article’s Creative Commons license,
unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/





You might also like



Downloadable Citations