{
  "annotation_id": "16c80b08-5887-49ce-a689-12ac5c880302",
  "date_created": "2026-03-02T18:01:38.008000Z",
  "date_modified": "2026-03-02T18:01:38.008000Z",
  "file_hash": "fd850cea13cff3528faa7f0c173f27005cf0e1e1a5c65eefa602216a43b1765e",
  "private": false,
  "record": {
    "abstract": "We define a model of quantum computation with local fermionic modes (LFMs) --\nsites which can be either empty or occupied by a fermion. With the standard\ncorrespondence between the Foch space of $m$ LFMs and the Hilbert space of $m$\nqubits, simulation of one fermionic gate takes $O(m)$ qubit gates and vice\nversa. We show that using different encodings, the simulation cost can be\nreduced to $O(\\log m)$ and a constant, respectively. Nearest-neighbors\nfermionic gates on a graph of bounded degree can be simulated at a constant\ncost. A universal set of fermionic gates is found. We also study computation\nwith Majorana fermions which are basically halves of LFMs. Some connection to\nqubit quantum codes is made.",
    "arxiv_id": "quant-ph/0003137",
    "authors": [
      "Sergey Bravyi",
      "Alexei Kitaev"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1006/aphy.2002.6254",
    "journal_ref": "Annals of Physics, Vol. 298, Iss. 1 (2002) pp.210-226",
    "title": "Fermionic quantum computation",
    "url": "https://arxiv.org/abs/quant-ph/0003137"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "37543d98-d0ae-4ff6-9062-53c332f979cf",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}