{"title":"量子优化的一个基准:旅行推销员","authors":"R. H. Warren","doi":"10.26421/QIC21.7-8-2","DOIUrl":null,"url":null,"abstract":"We present compelling reasons for symmetric traveling salesman problems (TSPs) to be the benchmark for quantum computing of combinatorial optimization problems for all types of quantum hardware. There are seven reasons for endorsing these TSPs to be the benchmark and no shortcomings.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"17 1","pages":"557-562"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A benchmark for quantum optimization: the traveling salesman\",\"authors\":\"R. H. Warren\",\"doi\":\"10.26421/QIC21.7-8-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present compelling reasons for symmetric traveling salesman problems (TSPs) to be the benchmark for quantum computing of combinatorial optimization problems for all types of quantum hardware. There are seven reasons for endorsing these TSPs to be the benchmark and no shortcomings.\",\"PeriodicalId\":20904,\"journal\":{\"name\":\"Quantum Inf. Comput.\",\"volume\":\"17 1\",\"pages\":\"557-562\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Inf. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26421/QIC21.7-8-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 Inf. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26421/QIC21.7-8-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A benchmark for quantum optimization: the traveling salesman
We present compelling reasons for symmetric traveling salesman problems (TSPs) to be the benchmark for quantum computing of combinatorial optimization problems for all types of quantum hardware. There are seven reasons for endorsing these TSPs to be the benchmark and no shortcomings.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
