This paper demonstrates the applicability of the Quantum Walk-based Optimisation Algorithm(QWOA) to the Capacitated Vehicle Routing Problem (CVRP). Efficient algorithms are developedfor the indexing and unindexing of the solution space and for implementing the required alternatingphase-walk unitaries, which are the core components of QWOA. Results of numerical simulationdemonstrate that the QWOA is capable of producing convergence to near-optimal solutions for arandomly generated 8 location CVRP. Preparation of the amplified quantum state in this exampleproblem is demonstrated to produce high-quality solutions, which are more optimal than expectedfrom classical random sampling of equivalent computational effort.
Quantum walk-based optimisation for capacitated vehicle routing with homogeneous and heterogeneous fleets
Pawsey Supercomputing Research Centre（Pawsey超级计算研究中心）；Centre for Quantum Information, Simulation and Algorithms, The University of Western Australia（西澳大利亚大学量子信息、模拟与算法中心）；PrioriAnalytica
Improving success probability in the LHZ parity embedding by computing with quantum walks
Institute for Theoretical Physics, University of Innsbruck（因斯布鲁克大学理论物理研究所）；School of Computing, Newcastle University（纽卡斯尔大学计算机学院）；Department of Physics, University of Strathclyde（斯特拉斯克莱德大学物理系）；Parity Quantum Computing GmbH（Parity量子计算有限公司）
Quantum Technology Lab, Dipartimento di Fisica Aldo Pontremoli , Università di Milano（米兰大学阿尔多·蓬特罗莫利物理系量子技术实验室）；Dipartimento di Scienze Fisiche, Informatiche e Matematiche, Università di Modena e Reggio Emilia（摩德纳和雷焦艾米利亚大学物理、信息和数学科学系）；Centro S3, CNR-Istituto di Nanoscienze（CNR纳米科学研究所S3中心）；INFN, Sezione di Milano（意大利国家核物理研究所米兰分部）
Isogeny Graphs in Superposition and Quantum Onion Routing
The Cyprus Institute（塞浦路斯研究所）；Northeastern University – London（伦敦东北大学）；Khoury College of Computer Sciences, Northeastern University（东北大学库里计算机学院）；Deutsches Elektronen-Synchrotron DESY（德国电子同步加速器中心）
