{
  "annotation_id": "8f311b5e-1c05-4508-9d07-886e9a2e0c8a",
  "date_created": "2026-03-02T18:01:59.125000Z",
  "date_modified": "2026-03-02T18:01:59.125000Z",
  "file_hash": "0cf1f9c7341082e9b3381ccb68b38a20834fb6b99b4252b09e66a51752c1f7d6",
  "private": false,
  "record": {
    "abstract": "This work is concerned with phrasing the concepts of fault-tolerant quantum\ncomputation within the framework of disordered systems, Bernoulli site\npercolation in particular. We show how the so-called \"threshold theorems\" on\nthe possibility of fault-tolerant quantum computation with constant error rate\ncan be cast as a renormalization (coarse-graining) of the site percolation\nprocess describing the occurrence of errors during computation. We also use\npercolation techniques to derive a trade-off between the complexity overhead of\nthe fault-tolerant circuit and the threshold error rate.",
    "arxiv_id": "quant-ph/0307166",
    "authors": [
      "Maxim Raginsky"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1023/B:QINP.0000004127.09741.9b",
    "journal_ref": "Quantum Inf. Processing 2, 249-258 (2003)",
    "title": "Scaling and renormalization in fault-tolerant quantum computers",
    "url": "https://arxiv.org/abs/quant-ph/0307166"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "25ccec27-ae79-47cd-87bf-370eea5a2ceb",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}