{
  "annotation_id": "7919ce55-53c7-4e50-ad2d-740a2aff8955",
  "date_created": "2026-03-02T18:02:44.595000Z",
  "date_modified": "2026-03-02T18:02:44.595000Z",
  "file_hash": "37261c03d68d5c7d5e7b220542ae65a0a78d49f317ab6d4c98705764c694d0f7",
  "private": false,
  "record": {
    "abstract": "We describe a new polynomial time quantum algorithm that uses the quantum\nfast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian\noperator, and that can be applied in cases (commonly found in ab initio physics\nand chemistry problems) for which all known classical algorithms require\nexponential time. Applications of the algorithm to specific problems are\nconsidered, and we find that classically intractable and interesting problems\nfrom atomic physics may be solved with between 50 and 100 quantum bits.",
    "arxiv_id": "quant-ph/9807070",
    "authors": [
      "Daniel S. Abrams",
      "Seth Lloyd"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.83.5162",
    "journal_ref": "Phys.Rev.Lett.83:5162-5165,1999",
    "title": "A quantum algorithm providing exponential speed increase for finding   eigenvalues and eigenvectors",
    "url": "https://arxiv.org/abs/quant-ph/9807070"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "17ac7a6c-3589-4891-8296-1591ef7684c5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}