首页 | 官方网站   微博 | 高级检索  
     


Adapting the traveling salesman problem to an adiabatic quantum computer
Authors:Richard H. Warren
Affiliation:1. Lockheed Martin Corporation, 230 E. Mall Blvd., Bldg 100, King of Prussia, PA, 19406, USA
2. 403 Bluebird Crossing, Glen Mills, PA, 19342, USA
Abstract:We show how to guide a quantum computer to select an optimal tour for the traveling salesman. This is significant because it opens a rapid solution method for the wide range of applications of the traveling salesman problem, which include vehicle routing, job sequencing and data clustering.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号