dorsal/arxiv
View SchemaAn Optimization for Qubiter
| Authors | Robert R. Tucci |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9809055 |
| URL | https://arxiv.org/abs/quant-ph/9809055 |
Abstract
In a previous paper, we described a computer program called Qubiter which can decompose an arbitrary unitary matrix into elementary operations of the type used in quantum computation. In this paper, we describe a method of reducing the number of elementary operations in such decompositions.
{
"annotation_id": "d665f702-0eab-4c67-9b79-d916fa9929a4",
"date_created": "2026-03-02T18:02:45.134000Z",
"date_modified": "2026-03-02T18:02:45.134000Z",
"file_hash": "6dcbefd880dd9c4f0f1e7ff2d25b912affb0837a9be7a9c4863a99a22602a7be",
"private": false,
"record": {
"abstract": "In a previous paper, we described a computer program called Qubiter which can\ndecompose an arbitrary unitary matrix into elementary operations of the type\nused in quantum computation. In this paper, we describe a method of reducing\nthe number of elementary operations in such decompositions.",
"arxiv_id": "quant-ph/9809055",
"authors": [
"Robert R. Tucci"
],
"categories": [
"quant-ph"
],
"title": "An Optimization for Qubiter",
"url": "https://arxiv.org/abs/quant-ph/9809055"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "45c2f3cf-fbb2-4483-b7d7-fa95da5744d7",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}