The travelling salesman problem and adiabatic quantum computation: an algorithm

DOI10.1007/S11128-019-2206-9zbMath1417.81093arXiv1801.07859OpenAlexW3100243545MaRDI QIDQ670009

Tien D. Kieu

Publication date: 15 March 2019

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.07859

zbMATH Keywords

quantum algorithmstravelling salesman problemadiabatic quantum computation

Mathematics Subject Classification ID

Point estimation (62F10) Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27) Quantum computation (81P68) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Coherent states (81R30) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

The travelling salesman problem and adiabatic quantum computation: an algorithm ⋮ A class of time-energy uncertainty relations for time-dependent Hamiltonians

Uses Software

• Concorde

Cites Work

• Performance of two different quantum annealing correction codes
• The travelling salesman problem and adiabatic quantum computation: an algorithm
• Maximum speedup in quantum search: \(O\)(1) running time
• Quantum Computation and Quantum Information
• QUANTUM PHASE TRANSITIONS AND ENTANGLEMENT IN J₁–J₂ MODEL
• Energy and efficiency of adiabatic quantum search algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The travelling salesman problem and adiabatic quantum computation: an algorithm