{
  "annotation_id": "1fc6adae-e0e4-43fe-b9ff-bf9bc6336639",
  "date_created": "2026-03-02T18:01:59.756000Z",
  "date_modified": "2026-03-02T18:01:59.756000Z",
  "file_hash": "c36eceea1d2d92446f3e3890df2e766b146a8809afdbea353c5d2b348497270f",
  "private": false,
  "record": {
    "abstract": "We present an efficient method for preparing the initial state required by\nthe eigenvalue approximation quantum algorithm of Abrams and Lloyd. Our method\ncan be applied when solving continuous Hermitian eigenproblems, e.g., the\nSchroedinger equation, on a discrete grid. We start with a classically obtained\neigenvector for a problem discretized on a coarse grid, and we efficiently\nconstruct, quantum mechanically, an approximation of the same eigenvector on a\nfine grid. We use this approximation as the initial state for the eigenvalue\nestimation algorithm, and show the relationship between its success probability\nand the size of the coarse grid.",
    "arxiv_id": "quant-ph/0308016",
    "authors": [
      "Peter Jaksch",
      "Anargyros Papageorgiou"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.91.257902",
    "title": "Eigenvector Approximation Leading to Exponential Speedup of Quantum   Eigenvalue Calculation",
    "url": "https://arxiv.org/abs/quant-ph/0308016"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e50e7a37-9c64-4f20-9983-fc4f11ffc34a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}