dorsal/arxiv
View SchemaA 2 rebit gate universal for quantum computing
| Authors | Terry Rudolph, Lov Grover |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0210187 |
| URL | https://arxiv.org/abs/quant-ph/0210187 |
Abstract
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact 2-rebit) gate which is universal for quantum computing, although it cannot be used to perform arbitrary unitary transformations.
{
"annotation_id": "79faae59-6d3c-4bb4-9ebb-6b1044a51dac",
"date_created": "2026-03-02T18:01:55.393000Z",
"date_modified": "2026-03-02T18:01:55.393000Z",
"file_hash": "d95849cd722a0cce4bb6f10f8c29800002addde6d71bb2071e0125384dce52d9",
"private": false,
"record": {
"abstract": "We show, within the circuit model, how any quantum computation can be\nefficiently performed using states with only real amplitudes (a result known\nwithin the Quantum Turing Machine model). This allows us to identify a 2-qubit\n(in fact 2-rebit) gate which is universal for quantum computing, although it\ncannot be used to perform arbitrary unitary transformations.",
"arxiv_id": "quant-ph/0210187",
"authors": [
"Terry Rudolph",
"Lov Grover"
],
"categories": [
"quant-ph"
],
"title": "A 2 rebit gate universal for quantum computing",
"url": "https://arxiv.org/abs/quant-ph/0210187"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "9f886604-ef29-4c5a-93b4-4312bc1a4be9",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}