{
  "annotation_id": "2e680edc-f925-4d2e-b316-16675cdbed9b",
  "date_created": "2026-03-02T18:02:19.686000Z",
  "date_modified": "2026-03-02T18:02:19.686000Z",
  "file_hash": "a6e450971690f09f4bbea90fd220a0dc9947e38e7d0c5b734ddc66abe19ba402",
  "private": false,
  "record": {
    "abstract": "We examine the problem of simulating lattice gauge theories on a universal\nquantum computer. The basic strategy of our approach is to transcribe lattice\ngauge theories in the Hamiltonian formulation into a Hamiltonian involving only\nPauli spin operators such that the simulation can be performed on a quantum\ncomputer using only one and two qubit manipulations. We examine three models,\nthe U(1), SU(2), and SU(3) lattice gauge theories which are transcribed into a\nspin Hamiltonian up to a cutoff in the Hilbert space of the gauge fields on the\nlattice. The number of qubits required for storing a particular state is found\nto have a linear dependence with the total number of lattice sites. The number\nof qubit operations required for performing the time evolution corresponding to\nthe Hamiltonian is found to be between a linear to quadratic function of the\nnumber of lattice sites, depending on the arrangement of qubits in the quantum\ncomputer. We remark that our results may also be easily generalized to higher\nSU(N) gauge theories.",
    "arxiv_id": "quant-ph/0510027",
    "authors": [
      "Tim Byrnes",
      "Yoshihisa Yamamoto"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.73.022328",
    "journal_ref": "Phys.Rev. A73 (2006) 022328",
    "title": "Simulating lattice gauge theories on a quantum computer",
    "url": "https://arxiv.org/abs/quant-ph/0510027"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4aea9fbd-292f-4902-8e76-9eaf6ac97ce6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}