dorsal/arxiv
View SchemaPower of Anisotropic Exchange Interactions: Universality and Efficient Codes for Quantum Computing
| Authors | L. -A. Wu, D. A. Lidar |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0103039 |
| URL | https://arxiv.org/abs/quant-ph/0103039 |
| DOI | 10.1103/PhysRevA.65.042318 |
| Journal | Phys. Rev. A 65, 042318 (2002) |
Abstract
We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum computer proposals, e.g., quantum dots and donor atom spins with anisotropic exchange coupling, quantum Hall systems, and electrons floating on helium.We show how to make the corresponding Hamiltonians universal by encoding one qubit into two physical qubits, and by controlling nearest neighbor interactions.
{
"annotation_id": "2928aabf-bd86-462b-a776-005e936800df",
"date_created": "2026-03-02T18:01:42.698000Z",
"date_modified": "2026-03-02T18:01:42.698000Z",
"file_hash": "889d4ba261297f92eaf66b282955b7722b13ff33b18c6a40797f8e5f6fa56bf0",
"private": false,
"record": {
"abstract": "We study the quantum computational power of a generic class of anisotropic\nsolid state Hamiltonians. A universal set of encoded logic operations are found\nwhich do away with difficult-to-implement single-qubit gates in a number of\nquantum computer proposals, e.g., quantum dots and donor atom spins with\nanisotropic exchange coupling, quantum Hall systems, and electrons floating on\nhelium.We show how to make the corresponding Hamiltonians universal by encoding\none qubit into two physical qubits, and by controlling nearest neighbor\ninteractions.",
"arxiv_id": "quant-ph/0103039",
"authors": [
"L. -A. Wu",
"D. A. Lidar"
],
"categories": [
"quant-ph",
"cond-mat",
"math-ph",
"math.MP",
"physics.chem-ph"
],
"doi": "10.1103/PhysRevA.65.042318",
"journal_ref": "Phys. Rev. A 65, 042318 (2002)",
"title": "Power of Anisotropic Exchange Interactions: Universality and Efficient Codes for Quantum Computing",
"url": "https://arxiv.org/abs/quant-ph/0103039"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "ecb45ad2-8139-4990-934f-6e32181d264d",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}