dorsal/arxiv
View SchemaClassical programmability is enough for quantum circuits universality in approximate sense
| Authors | Alexander Yu. Vlasov |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0103119 |
| URL | https://arxiv.org/abs/quant-ph/0103119 |
Abstract
It was shown by M.A. Nielsen and I.L. Chuang 1997, that it is impossible to build strictly universal programmable quantum gate array, that could perform any unitary operation precisely and it was suggested to use probabilistic gate arrays instead. In present work is shown, that if to use more physical and weak condition of universality (suggested already in earliest work by D.Deutsch 1985) and to talk about simulation with arbitrary, but finite precision, then it is possible to build universal programmable gate array. But now the same no-go theorem by Nielsen and Chuang will have new interesting consequence --- controlling programs for the gate arrays can be considered as pure classical. More detailed design of such deterministic quantum gate arrays universal ``in approximate sense'' is considered in the paper.
{
"annotation_id": "32390735-a77f-411f-a1d1-b13562185ae5",
"date_created": "2026-03-02T18:01:42.140000Z",
"date_modified": "2026-03-02T18:01:42.140000Z",
"file_hash": "be7507eab7f28e9c131d94798ff729e9acadd58e30d340091dc849b238ecc842",
"private": false,
"record": {
"abstract": "It was shown by M.A. Nielsen and I.L. Chuang 1997, that it is impossible to\nbuild strictly universal programmable quantum gate array, that could perform\nany unitary operation precisely and it was suggested to use probabilistic gate\narrays instead. In present work is shown, that if to use more physical and weak\ncondition of universality (suggested already in earliest work by D.Deutsch\n1985) and to talk about simulation with arbitrary, but finite precision, then\nit is possible to build universal programmable gate array. But now the same\nno-go theorem by Nielsen and Chuang will have new interesting consequence ---\ncontrolling programs for the gate arrays can be considered as pure classical.\nMore detailed design of such deterministic quantum gate arrays universal ``in\napproximate sense\u0027\u0027 is considered in the paper.",
"arxiv_id": "quant-ph/0103119",
"authors": [
"Alexander Yu. Vlasov"
],
"categories": [
"quant-ph"
],
"title": "Classical programmability is enough for quantum circuits universality in approximate sense",
"url": "https://arxiv.org/abs/quant-ph/0103119"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "48be9e9f-d278-4bb0-adf9-d490c20b6da7",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}