Yanzhu Chen, Linghua Zhu, Chenxu Liu, N. Mayhall, Edwin Barnes, S. Economou
{"title":"量子优化算法需要多少纠缠?","authors":"Yanzhu Chen, Linghua Zhu, Chenxu Liu, N. Mayhall, Edwin Barnes, S. Economou","doi":"10.1364/quantum.2022.qm4a.2","DOIUrl":null,"url":null,"abstract":"ADAPT-QAOA, a novel problem-tailored version of quantum approximate optimization algorithm, speeds up convergence using entangling operators while reducing the total number of CNOTs. We explore how much entanglement is required to speed up optimization algorithms.","PeriodicalId":369002,"journal":{"name":"Quantum 2.0 Conference and Exhibition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"How Much Entanglement Do Quantum Optimization Algorithms Require?\",\"authors\":\"Yanzhu Chen, Linghua Zhu, Chenxu Liu, N. Mayhall, Edwin Barnes, S. Economou\",\"doi\":\"10.1364/quantum.2022.qm4a.2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ADAPT-QAOA, a novel problem-tailored version of quantum approximate optimization algorithm, speeds up convergence using entangling operators while reducing the total number of CNOTs. We explore how much entanglement is required to speed up optimization algorithms.\",\"PeriodicalId\":369002,\"journal\":{\"name\":\"Quantum 2.0 Conference and Exhibition\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum 2.0 Conference and Exhibition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1364/quantum.2022.qm4a.2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum 2.0 Conference and Exhibition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/quantum.2022.qm4a.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
How Much Entanglement Do Quantum Optimization Algorithms Require?
ADAPT-QAOA, a novel problem-tailored version of quantum approximate optimization algorithm, speeds up convergence using entangling operators while reducing the total number of CNOTs. We explore how much entanglement is required to speed up optimization algorithms.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
