dorsal/arxiv
View SchemaUniversality in Quantum Computation
| Authors | D. Deutsch, A. Barenco, A. Ekert |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9505018 |
| URL | https://arxiv.org/abs/quant-ph/9505018 |
| DOI | 10.1098/rspa.1995.0065 |
Abstract
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.
{
"annotation_id": "59b2ef67-4faf-4e4b-b4a2-ec0b98bbf2a9",
"date_created": "2026-03-02T18:02:37.886000Z",
"date_modified": "2026-03-02T18:02:37.886000Z",
"file_hash": "c17c633164b726a23bb92c0442ba11baa4c003f1883ed4603eef888b0398f8ad",
"private": false,
"record": {
"abstract": "We show that in quantum computation almost every gate that operates on two or\nmore bits is a universal gate. We discuss various physical considerations\nbearing on the proper definition of universality for computational components\nsuch as logic gates.",
"arxiv_id": "quant-ph/9505018",
"authors": [
"D. Deutsch",
"A. Barenco",
"A. Ekert"
],
"categories": [
"quant-ph"
],
"doi": "10.1098/rspa.1995.0065",
"title": "Universality in Quantum Computation",
"url": "https://arxiv.org/abs/quant-ph/9505018"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "0f4cc8db-83ee-455e-8ae0-67c958faae06",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}