{"title":"Simon问题中绝热量子计算的量子并行处理研究","authors":"S. Nakayama, Gang Peng, I. Iimura","doi":"10.1109/PDCAT.2013.20","DOIUrl":null,"url":null,"abstract":"Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Simon problem more efficiently by a method with higher observation probability.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Study on Quantum Parallel Processing by Adiabatic Quantum Computation in Simon Problem\",\"authors\":\"S. Nakayama, Gang Peng, I. Iimura\",\"doi\":\"10.1109/PDCAT.2013.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Simon problem more efficiently by a method with higher observation probability.\",\"PeriodicalId\":187974,\"journal\":{\"name\":\"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2013.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2013.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Study on Quantum Parallel Processing by Adiabatic Quantum Computation in Simon Problem
Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Simon problem more efficiently by a method with higher observation probability.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
