Work

Quantum Complexity Bounds for Independent Set Problems

Year: 2005

Type: preprint

Abstract: We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these algorithms for some graph problems. Our results improve the best classical complexity bounds for the corresponding problems.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.quant-ph/0510084

Author: Doern, Sebastian

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2951674151

Cites: 28

Cited by:

Related to: 10