{
  "annotation_id": "fcce5971-58d8-4966-b0fa-8eb5f5cac781",
  "date_created": "2026-03-02T18:01:41.725000Z",
  "date_modified": "2026-03-02T18:01:41.725000Z",
  "file_hash": "d5b30d9aee16978043bd7a1837759de734028a8236fbd9ca4c24da4663c32e82",
  "private": false,
  "record": {
    "abstract": "We describe a new and consistent perturbation theory for solid-state quantum\ncomputation with many qubits. The errors in the implementation of simple\nquantum logic operations caused by non-resonant transitions are estimated. We\nverify our perturbation approach using exact numerical solution for relatively\nsmall (L=10) number of qubits. A preferred range of parameters is found in\nwhich the errors in processing quantum information are small. Our results are\nneeded for experimental testing of scalable solid-state quantum computers.",
    "arxiv_id": "quant-ph/0104025",
    "authors": [
      "G. P. Berman",
      "G. D. Doolen",
      "D. I. Kamenev",
      "V. I. Tsifrinovich"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.65.012321",
    "title": "Perturbation Theory for Quantum Computation with Large Number of Qubits",
    "url": "https://arxiv.org/abs/quant-ph/0104025"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b11587da-503a-4e15-af67-4b2338ec91e8",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}