Work

Quantum Algorithms for Some Well-Known NP Problems

Year: 2002
Type: article
Abstract: It is known that quantum computer is more powerful than classical computer. In this paper we present quantum algorithms for some famous NP problems in graph theory and combination theory, these quantum algorithms are at least quadratically faster than the classical ones.
Authors: Guo Hao, Long Gui-Lu, Li Feng
Language: English
Open Access status: bronze
OpenAlex ID: W2325381094
FWCI:
Cites: 5
Cited by: 13
Related to: 10