量子门和退火器件上的映射约束问题

2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI:10.1109/QCS54837.2021.00016

E. Wilson, F. Mueller, S. Pakin

{"title":"量子门和退火器件上的映射约束问题","authors":"E. Wilson, F. Mueller, S. Pakin","doi":"10.1109/QCS54837.2021.00016","DOIUrl":null,"url":null,"abstract":"This work presents NchooseK, a unified programming model for constraint satisfaction problems that can be mapped to both quantum circuit and annealing devices through Quadratic Unconstrained Binary Operators (QUBOs). Our mapping provides an approachable and effective way to program both types of quantum computers. We provide examples of NchooseK being used.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"453 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Mapping Constraint Problems onto Quantum Gate and Annealing Devices\",\"authors\":\"E. Wilson, F. Mueller, S. Pakin\",\"doi\":\"10.1109/QCS54837.2021.00016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work presents NchooseK, a unified programming model for constraint satisfaction problems that can be mapped to both quantum circuit and annealing devices through Quadratic Unconstrained Binary Operators (QUBOs). Our mapping provides an approachable and effective way to program both types of quantum computers. We provide examples of NchooseK being used.\",\"PeriodicalId\":432600,\"journal\":{\"name\":\"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)\",\"volume\":\"453 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/QCS54837.2021.00016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QCS54837.2021.00016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文提出了NchooseK，一个用于约束满足问题的统一规划模型，该模型可以通过二次无约束二进制算子(QUBOs)映射到量子电路和退火设备。我们的映射为这两种类型的量子计算机编程提供了一种可接近且有效的方法。我们提供了使用NchooseK的示例。

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

查看原文本刊更多论文

Mapping Constraint Problems onto Quantum Gate and Annealing Devices

This work presents NchooseK, a unified programming model for constraint satisfaction problems that can be mapped to both quantum circuit and annealing devices through Quadratic Unconstrained Binary Operators (QUBOs). Our mapping provides an approachable and effective way to program both types of quantum computers. We provide examples of NchooseK being used.

求助全文

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

来源期刊

2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)

自引率

0.00%

发文量