dorsal/arxiv
View SchemaA practical scheme for quantum computation with any two-qubit entangling gate
| Authors | Michael J. Bremner, Christopher M. Dawson, Jennifer L. Dodd, Alexei Gilchrist, Aram W. Harrow, Duncan Mortimer, Michael A. Nielsen, Tobias J. Osborne |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0207072 |
| URL | https://arxiv.org/abs/quant-ph/0207072 |
| DOI | 10.1103/PhysRevLett.89.247902 |
| Journal | Phys. Rev. Lett. 89, 247902 (2002) |
Abstract
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. Here we present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this important result for systems of arbitrary finite dimension has been provided by J. L. and R. Brylinski [arXiv:quant-ph/0108062, 2001]; however, their proof relies upon a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical [C. M. Dawson and A. Gilchrist, online implementation of the procedure described herein (2002), http://www.physics.uq.edu.au/gqc/].
{
"annotation_id": "09c8f747-6530-458f-881b-a9abaf14474d",
"date_created": "2026-03-02T18:01:52.032000Z",
"date_modified": "2026-03-02T18:01:52.032000Z",
"file_hash": "163f834fb376b5eca7b132519c7d79208cd277211af75c9aa97a86990671cfcc",
"private": false,
"record": {
"abstract": "Which gates are universal for quantum computation? Although it is well known\nthat certain gates on two-level quantum systems (qubits), such as the\ncontrolled-not (CNOT), are universal when assisted by arbitrary one-qubit\ngates, it has only recently become clear precisely what class of two-qubit\ngates is universal in this sense. Here we present an elementary proof that any\nentangling two-qubit gate is universal for quantum computation, when assisted\nby one-qubit gates. A proof of this important result for systems of arbitrary\nfinite dimension has been provided by J. L. and R. Brylinski\n[arXiv:quant-ph/0108062, 2001]; however, their proof relies upon a long\nargument using advanced mathematics. In contrast, our proof provides a simple\nconstructive procedure which is close to optimal and experimentally practical\n[C. M. Dawson and A. Gilchrist, online implementation of the procedure\ndescribed herein (2002), http://www.physics.uq.edu.au/gqc/].",
"arxiv_id": "quant-ph/0207072",
"authors": [
"Michael J. Bremner",
"Christopher M. Dawson",
"Jennifer L. Dodd",
"Alexei Gilchrist",
"Aram W. Harrow",
"Duncan Mortimer",
"Michael A. Nielsen",
"Tobias J. Osborne"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevLett.89.247902",
"journal_ref": "Phys. Rev. Lett. 89, 247902 (2002)",
"title": "A practical scheme for quantum computation with any two-qubit entangling gate",
"url": "https://arxiv.org/abs/quant-ph/0207072"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "9de27a0a-1941-4b34-bedf-17f86954cbdf",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}