The travelling salesman problem and adiabatic quantum computation: an algorithm
暂无分享,去创建一个
[1] A. Messiah. Quantum Mechanics , 1961 .
[2] T. Kieu. Quantum Adiabatic Computation and the Travelling Salesman Problem , 2006, quant-ph/0601151.
[3] N. Cerf,et al. Quantum search by local adiabatic evolution , 2001, quant-ph/0107015.
[4] Zhaohui Wei,et al. Quantum search algorithm by adiabatic evolution under a priori probability , 2004 .
[5] Tien D. Kieu,et al. A class of time-energy uncertainty relations for time-dependent Hamiltonians , 2017, Proceedings of the Royal Society A.
[6] Hans R. Moser,et al. The quantum mechanical solution of the traveling salesman problem , 2003 .
[7] R. Eryigit,et al. Local adiabatic quantum search with different paths , 2003, quant-ph/0309201.
[8] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study , 2007 .
[9] Daniel A. Lidar,et al. Adiabatic quantum computation , 2016, 1611.04471.
[10] Ashley Montanaro,et al. Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs , 2016, ArXiv.
[11] Younghun Kwon,et al. Generalized quantum search Hamiltonian , 2002 .
[12] Saket Saurabh,et al. Faster Parameterized Algorithms Using Linear Programming , 2012, ACM Trans. Algorithms.
[13] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .
[14] E. Farhi,et al. Quantum Adiabatic Evolution Algorithms with Different Paths , 2002, quant-ph/0208135.
[15] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[16] Debabrata Goswami,et al. Towards Efficiently Solving Quantum Traveling Salesman Problem , 2004 .
[17] Younghun Kwon,et al. Speedup in Quantum Adiabatic Evolution Algorithm , 2003 .
[18] Randy Kobes,et al. Energy and efficiency of adiabatic quantum search algorithms , 2003 .
[19] Matthias Troyer,et al. Designing Adiabatic Quantum Optimization: A Case Study for the Traveling Salesman Problem , 2017, 1702.06248.
[20] Tien D. Kieu. A factorisation algorithm in Adiabatic Quantum Computation , 2019, Journal of Physics Communications.
[21] M. Batouche,et al. A new quantum-inspired genetic algorithm for solving the travelling salesman problem , 2004, 2004 IEEE International Conference on Industrial Technology, 2004. IEEE ICIT '04..
[22] E. Tosatti,et al. Quantum annealing of the traveling-salesman problem. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[23] Younghun Kwon,et al. Maximum Speedup in Quantum Search: O(1) Running Time , 2002 .
[24] S. D. Pinski,et al. Adiabatic Quantum Computing , 2011, 1108.0560.