dorsal/arxiv
View SchemaALEPH-QP: Universal hybrid quantum processors
| Authors | Alexander Yu. Vlasov |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0205074 |
| URL | https://arxiv.org/abs/quant-ph/0205074 |
| Journal | Particles and Nuclei Letters, No. 1[116], p 60 (2003) |
Abstract
A quantum processor (the programmable gate array) is a quantum network with a fixed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond to "loaded" programs without any changing or "tuning" of network itself. Due to such property and undesirability of entanglement between program and data registers, universality of quantum processors is subject of rather strong restrictions. By different authors was developed universal "stochastic" quantum gate arrays. It was proved also, that "deterministic" quantum processors with finite-dimensional space of states may be universal only in approximate sense. In present paper is shown, that using hybrid system with continuous and discrete quantum variables, it is possible to suggest a design of strictly universal quantum processors. It is shown also that "deterministic" limit of specific programmable "stochastic" U(1) gates (probability of success becomes unit for infinite program register), discussed by other authors, may be essentially same kind of hybrid quantum systems used here.
{
"annotation_id": "8f7ee569-14ca-41b3-8ca3-eef89d831dca",
"date_created": "2026-03-02T18:01:52.612000Z",
"date_modified": "2026-03-02T18:01:52.612000Z",
"file_hash": "72b8d63edef70e9ae7ce841258ad30440153f0e5e29202f97043b2db42163b9f",
"private": false,
"record": {
"abstract": "A quantum processor (the programmable gate array) is a quantum network with a\nfixed structure. A space of states is represented as tensor product of data and\nprogram registers. Different unitary operations with the data register\ncorrespond to \"loaded\" programs without any changing or \"tuning\" of network\nitself. Due to such property and undesirability of entanglement between program\nand data registers, universality of quantum processors is subject of rather\nstrong restrictions. By different authors was developed universal \"stochastic\"\nquantum gate arrays. It was proved also, that \"deterministic\" quantum\nprocessors with finite-dimensional space of states may be universal only in\napproximate sense. In present paper is shown, that using hybrid system with\ncontinuous and discrete quantum variables, it is possible to suggest a design\nof strictly universal quantum processors. It is shown also that \"deterministic\"\nlimit of specific programmable \"stochastic\" U(1) gates (probability of success\nbecomes unit for infinite program register), discussed by other authors, may be\nessentially same kind of hybrid quantum systems used here.",
"arxiv_id": "quant-ph/0205074",
"authors": [
"Alexander Yu. Vlasov"
],
"categories": [
"quant-ph"
],
"journal_ref": "Particles and Nuclei Letters, No. 1[116], p 60 (2003)",
"title": "ALEPH-QP: Universal hybrid quantum processors",
"url": "https://arxiv.org/abs/quant-ph/0205074"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "24047037-a4c2-45ac-ae2f-1e777896ef6b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}