Work

Quantum Algorithm for Eulerian Graph Problem

Year: 2012

Type: article

Abstract: A quantum algorithm for the Eulerian graph problem and its example are reported. When nodes are connected by edges, a route that traverses each edge just for once is obtained. When it is assumed that a computational complexity of a classical computation is Z, a computational complexity of the quantum algorithm by using quantum phase inversion gates and quantum inversion about mean gates is about Z 1/2 . 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: W2256296067

FWCI:

Cites:

Cited by:

Related to: 10