dorsal/arxiv
View SchemaEfficient algorithm for multi-qudit twirling for ensemble quantum computation
| Authors | Geza Toth, Juan Jose Garcia-Ripoll |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0609052 |
| URL | https://arxiv.org/abs/quant-ph/0609052 |
| DOI | 10.1103/PhysRevA.75.042311 |
| Journal | Phys. Rev. A 75, 042311 (2007) |
Abstract
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can also be used for computing the twirled density matrix on a classical computer. The method is based on a simple non-unitary operation involving a random unitary. When applying this basic building block iteratively, the mean squared error of the approximation decays exponentially. In contrast, when averaging over random unitary matrices the error decreases only algebraically. We present evidence that the unitaries in our algorithm can come from a very imperfect random source or can even be chosen deterministically from a set of cyclically alternating matrices. Based on these ideas we present a quantum circuit realizing twirling efficiently.
{
"annotation_id": "22fb52ce-5f08-4ffc-9760-918f18fec08b",
"date_created": "2026-03-02T18:02:30.795000Z",
"date_modified": "2026-03-02T18:02:30.795000Z",
"file_hash": "9cde3385dd06fef119ce0e61e2751f1bec7632db41de0dd5078480887746553f",
"private": false,
"record": {
"abstract": "We present an efficient algorithm for twirling a multi-qudit quantum state.\nThe algorithm can be used for approximating the twirling operation in an\nensemble of physical systems in which the systems cannot be individually\naccessed. It can also be used for computing the twirled density matrix on a\nclassical computer. The method is based on a simple non-unitary operation\ninvolving a random unitary. When applying this basic building block\niteratively, the mean squared error of the approximation decays exponentially.\nIn contrast, when averaging over random unitary matrices the error decreases\nonly algebraically. We present evidence that the unitaries in our algorithm can\ncome from a very imperfect random source or can even be chosen\ndeterministically from a set of cyclically alternating matrices. Based on these\nideas we present a quantum circuit realizing twirling efficiently.",
"arxiv_id": "quant-ph/0609052",
"authors": [
"Geza Toth",
"Juan Jose Garcia-Ripoll"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.75.042311",
"journal_ref": "Phys. Rev. A 75, 042311 (2007)",
"title": "Efficient algorithm for multi-qudit twirling for ensemble quantum computation",
"url": "https://arxiv.org/abs/quant-ph/0609052"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "bc768408-a861-4861-844b-18167e23c0e0",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}