dorsal/arxiv
View SchemaQuantum Complexity Bounds for Independent Set Problems
| Authors | Sebastian Doern |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0510084 |
| URL | https://arxiv.org/abs/quant-ph/0510084 |
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.
{
"annotation_id": "78076271-2787-414c-ba08-ff8f78d9215f",
"date_created": "2026-03-02T18:02:20.737000Z",
"date_modified": "2026-03-02T18:02:20.737000Z",
"file_hash": "98fcb97bc20beca9fbedd44bdda1ae594eaf2dc15bf6cdac96eb725fcb26d496",
"private": false,
"record": {
"abstract": "We present quantum complexity lower and upper bounds for independent set\nproblems in graphs. In particular, we give quantum algorithms for computing a\nmaximal and a maximum independent set in a graph. We present applications of\nthese algorithms for some graph problems. Our results improve the best\nclassical complexity bounds for the corresponding problems.",
"arxiv_id": "quant-ph/0510084",
"authors": [
"Sebastian Doern"
],
"categories": [
"quant-ph"
],
"title": "Quantum Complexity Bounds for Independent Set Problems",
"url": "https://arxiv.org/abs/quant-ph/0510084"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "78be4cb1-5073-4a59-ae8d-90a3b17da48e",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}