dorsal/arxiv
View SchemaImplementing the fanout gate by a Hamiltonian
| Authors | Stephen A. Fenner |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0309163 |
| URL | https://arxiv.org/abs/quant-ph/0309163 |
Abstract
We show that, for even n, evolving n qubits according to a simple Hamiltonian can be used to exactly implement an (n+1)-qubit parity gate, which is equivalent in constant depth to an (n+1)-qubit fanout gate. We also observe that evolving the Hamiltonian for three qubits results in an inversion-on-three-way-equality gate, which together with single-qubit operations is universal for quantum computation.
{
"annotation_id": "d06e6439-f365-4ca7-b1da-b9aed6370aa0",
"date_created": "2026-03-02T18:02:03.142000Z",
"date_modified": "2026-03-02T18:02:03.142000Z",
"file_hash": "afd0dfe2ba5f938b569df5d3f8e9e4f4d80be86b9e71d5ecd6aae69665df5be1",
"private": false,
"record": {
"abstract": "We show that, for even n, evolving n qubits according to a simple Hamiltonian\ncan be used to exactly implement an (n+1)-qubit parity gate, which is\nequivalent in constant depth to an (n+1)-qubit fanout gate. We also observe\nthat evolving the Hamiltonian for three qubits results in an\ninversion-on-three-way-equality gate, which together with single-qubit\noperations is universal for quantum computation.",
"arxiv_id": "quant-ph/0309163",
"authors": [
"Stephen A. Fenner"
],
"categories": [
"quant-ph"
],
"title": "Implementing the fanout gate by a Hamiltonian",
"url": "https://arxiv.org/abs/quant-ph/0309163"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "b34c5fda-21ae-47b4-97f9-68e7714072dd",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}