利用二次无约束二元优化求解(Max) 3-SAT

International Conference on Conceptual Structures Pub Date : 2023-02-07 DOI:10.48550/arXiv.2302.03536

Jonas Nusslein, Sebastian Zieliński, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld

{"title":"利用二次无约束二元优化求解(Max) 3-SAT","authors":"Jonas Nusslein, Sebastian Zieliński, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld","doi":"10.48550/arXiv.2302.03536","DOIUrl":null,"url":null,"abstract":"We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA). Our approach requires fewer couplings and fewer physical qubits than the current state-of-the-art, which results in higher solution quality. We verified the practical applicability of the approach by testing it on a D-Wave quantum annealer.","PeriodicalId":125954,"journal":{"name":"International Conference on Conceptual Structures","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization\",\"authors\":\"Jonas Nusslein, Sebastian Zieliński, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld\",\"doi\":\"10.48550/arXiv.2302.03536\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA). Our approach requires fewer couplings and fewer physical qubits than the current state-of-the-art, which results in higher solution quality. We verified the practical applicability of the approach by testing it on a D-Wave quantum annealer.\",\"PeriodicalId\":125954,\"journal\":{\"name\":\"International Conference on Conceptual Structures\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Conceptual Structures\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2302.03536\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Conceptual Structures","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2302.03536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

我们介绍了一种将任意3-SAT实例转化为二次无约束二进制优化(QUBO)的新方法，因为它们被量子退火(QA)或量子近似优化算法(QAOA)所使用。我们的方法比目前最先进的技术需要更少的耦合和更少的物理量子位，从而产生更高的解决方案质量。我们通过在D-Wave量子退火机上进行测试，验证了该方法的实际适用性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization

We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA). Our approach requires fewer couplings and fewer physical qubits than the current state-of-the-art, which results in higher solution quality. We verified the practical applicability of the approach by testing it on a D-Wave quantum annealer.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Conference on Conceptual Structures

自引率

0.00%

发文量