{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T03:18:13Z","timestamp":1774581493127,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T00:00:00Z","timestamp":1549756800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s11128-019-2206-9","type":"journal-article","created":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T22:02:20Z","timestamp":1549749740000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["The travelling salesman problem and adiabatic quantum computation: an algorithm"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1551-6128","authenticated-orcid":false,"given":"Tien D.","family":"Kieu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,10]]},"reference":[{"key":"2206_CR1","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E Lawler","year":"1985","unstructured":"Lawler, E., Lenstra, J., RinooyKan, A., Shmoys, D.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, vol. 3. Wiley, New York (1985)"},{"key":"2206_CR2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D Applegate","year":"2011","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2011)"},{"key":"2206_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"M Nielsen","year":"2010","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information, 2nd edn. Cambridge University Press, Cambridge (2010)","edition":"2"},{"key":"2206_CR4","unstructured":"Albash, T., Lidar, D.: Adiabatic quantum computing. \n                    arXiv:1611.04471\n                    \n                   [quant-ph] (2016)"},{"key":"2206_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/S1386-9477(02)00928-1","volume":"16","author":"R Moser","year":"2003","unstructured":"Moser, R.: The quantum mechanical solution of the traveling salesman problem. Physica E 16, 280\u2013285 (2003)","journal-title":"Physica E"},{"key":"2206_CR6","unstructured":"Talbi, H., Draa, A., Batouche, M.: A new quantum-inspired genetic algorithm for solving the travelling salesman problem. In: 2004 IEEE International Conference on Industrial Technology. IEEE ICIT\u201904 (2004)"},{"key":"2206_CR7","doi-asserted-by":"crossref","unstructured":"Martonak, R., Santoro, G.E., Tosatti, E.: Quantum annealing of the traveling salesman problem. \n                    arXiv:cond-mat\/0402330\n                    \n                   [cond-mat.dis-nn] (2004)","DOI":"10.1103\/PhysRevE.70.057701"},{"key":"2206_CR8","doi-asserted-by":"crossref","unstructured":"Moylett, D.J., Linden, N., Montanaro, A.: Quantum speedup of the travelling salesman problem for bounded-degree graphs. \n                    arXiv:1612.06203\n                    \n                   [quant-ph] (2017)","DOI":"10.1103\/PhysRevA.95.032323"},{"key":"2206_CR9","unstructured":"Heim, B., Brown, E.W., Wecker, D., Troyer, M.: Designing adiabatic quantum optimization: a case study for the traveling salesman problem. \n                    arXiv:1702.06248\n                    \n                   [quant-ph] (2017)"},{"key":"2206_CR10","unstructured":"Goswami, D., Karnick, H., Jain, P., Maji, H.K.: Towards efficiently solving quantum traveling salesman problem. \n                    arXiv:quant-ph\/0411013\n                    \n                   (2004)"},{"key":"2206_CR11","unstructured":"Kieu, T.D.: Quantum adiabatic computation and the travelling salesman problem. \n                    arXiv:quant-ph\/0601151\n                    \n                   (2006)"},{"key":"2206_CR12","doi-asserted-by":"crossref","unstructured":"Kieu, T.D.: A factorisation algorithm in adiabatic quantum computation. \n                    arXiv:1808.02781\n                    \n                   [quant-ph] (2018)","DOI":"10.1088\/2399-6528\/ab060d"},{"key":"2206_CR13","unstructured":"Lokshtanov, D., Narayanaswamy, N., Raman, V., Ramnujan, M., Saurabh, S.: Faster parameterized algorithms using linear programming. \n                    arXiv:1203.0833\n                    \n                   [cs.DS] (2012)"},{"key":"2206_CR14","unstructured":"Kieu, T.D.: A new class of time-energy uncertainty relations for time-dependent Hamiltonians. \n                    arXiv:1702.00603\n                    \n                   [quant-ph] (2017)"},{"key":"2206_CR15","volume-title":"Quantum Mechanics","author":"A Messiah","year":"1966","unstructured":"Messiah, A.: Quantum Mechanics. Wiley, New York (1966)"},{"key":"2206_CR16","unstructured":"Das, S., Kobes, R., Kunstatter, G., Zaraket, H.: Energy and efficiency of adiabatic quantum search algorithms.\n                    arXiv:quant-ph\/0204044\n                    \n                   (2002)"},{"key":"2206_CR17","doi-asserted-by":"publisher","first-page":"042308","DOI":"10.1103\/PhysRevA.65.042308","volume":"65","author":"J Roland","year":"2002","unstructured":"Roland, J., Cerf, N.J.: Quantum search by local adiabatic evolution. Phys. Rev. A 65, 042308 (2002)","journal-title":"Phys. Rev. A"},{"key":"2206_CR18","unstructured":"Wei, Z., Ying, M.: Quantum search algorithm by adiabatic evolution under a priori probability. \n                    arXiv:quant-ph\/0412117\n                    \n                   (2004)"},{"key":"2206_CR19","unstructured":"Grover, L.: In: Proceedings, 28th Annual ACM Symposium on the Theory of Computing, p. 212. (May 1996)"},{"key":"2206_CR20","doi-asserted-by":"crossref","unstructured":"Bae, J., Kwon, Y.: Generalized quantum search hamiltonian. \n                    arXiv:quant-ph\/0110020\n                    \n                   (2002)","DOI":"10.1103\/PhysRevA.66.012314"},{"key":"2206_CR21","unstructured":"Bae, J., Kwon, Y.: Maximum speedup in quantum search: \n                    \n                      \n                    \n                    $${\\cal{O}}(1)$$\n                    \n                      \n                        \n                          O\n                          (\n                          1\n                          )\n                        \n                      \n                    \n                   running time. \n                    arXiv:quant-ph\/0204087\n                    \n                   (2003)"},{"key":"2206_CR22","unstructured":"Bae, J., Kwon, Y.: Speedup in quantum adiabatic evolution algorithm. \n                    arXiv:quant-ph\/0205048\n                    \n                   (2002)"},{"key":"2206_CR23","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: Quantum adiabatic evolution algorithms with different paths. \n                    arXiv:quant-ph\/0208135\n                    \n                   (2002)"},{"key":"2206_CR24","unstructured":"Eryigit, R., Gunduc, Y., Eryigit, R.: Local adiabatic quantum search with different paths. \n                    arXiv:quant-ph\/0309201\n                    \n                   (2004)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-019-2206-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-019-2206-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-019-2206-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,9]],"date-time":"2020-02-09T19:06:23Z","timestamp":1581275183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-019-2206-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2206"],"URL":"https:\/\/doi.org\/10.1007\/s11128-019-2206-9","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,10]]},"assertion":[{"value":"14 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"90"}}