Work

Quantum Algorithm for Traveling Salesman Problem

Year: 2012

Type: article

Abstract: A quantum algorithm for the traveling salesman problem and its example are reported. A route of the shortest distance is decided on turning round n points with fixing a starting point. When the counter routes are excluded, a computational complexity of a classical computation is (n − 1)!/2[= N] times. In the quantum algorithm by using quantum phase inversion gates and quantum inversion about mean gates, its computational complexity is about N 1/2 log 2 N times. Therefore, a high-speed process becomes possible.

Source: Global Journal of Pure and Applied Sciences

Author: Toru Fujimura

Institution: Industrial Property Cooperation Center

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2596481097

FWCI:

Cites: 3

Cited by:

Related to: 10