dorsal/arxiv
View SchemaCluster states, algorithms and graphs
| Authors | Dirk Schlingemann |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0305170 |
| URL | https://arxiv.org/abs/quant-ph/0305170 |
Abstract
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum algorithms, called graph algorithms, which correspond in the binary case to the Clifford group part of a network and which can efficiently be implemented on a one-way quantum computer. These algorithms can ``completely be solved" in the sense that the manipulation of quantum states in each step can be computed explicitly. Graph algorithms are precisely those which implement encoding schemes for graph codes. Starting from a given initial graph, which represents the underlying resource of multipartite entanglement, each step of the algorithm is related to a explicit transformation on the graph.
{
"annotation_id": "45f307a5-fc03-4900-a7c5-fabf91c8184d",
"date_created": "2026-03-02T18:01:58.992000Z",
"date_modified": "2026-03-02T18:01:58.992000Z",
"file_hash": "dd124b3a146240f1b60f42d9689a327a9ae93d3c0f66ec786aeab2702a52d4de",
"private": false,
"record": {
"abstract": "The present paper is concerned with the concept of the one-way quantum\ncomputer, beyond binary-systems, and its relation to the concept of stabilizer\nquantum codes. This relation is exploited to analyze a particular class of\nquantum algorithms, called graph algorithms, which correspond in the binary\ncase to the Clifford group part of a network and which can efficiently be\nimplemented on a one-way quantum computer. These algorithms can ``completely be\nsolved\" in the sense that the manipulation of quantum states in each step can\nbe computed explicitly. Graph algorithms are precisely those which implement\nencoding schemes for graph codes. Starting from a given initial graph, which\nrepresents the underlying resource of multipartite entanglement, each step of\nthe algorithm is related to a explicit transformation on the graph.",
"arxiv_id": "quant-ph/0305170",
"authors": [
"Dirk Schlingemann"
],
"categories": [
"quant-ph"
],
"title": "Cluster states, algorithms and graphs",
"url": "https://arxiv.org/abs/quant-ph/0305170"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7edb8a3f-edc5-4d70-b054-e5495eede52b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}