{
  "annotation_id": "3d3175b1-7d12-4822-bbf9-4585ab2b2924",
  "date_created": "2026-03-02T18:02:09.611000Z",
  "date_modified": "2026-03-02T18:02:09.611000Z",
  "file_hash": "d785bfa7505d315e73ec573a51ddef27b66c9dc54973ba17d253bdb456194ea9",
  "private": false,
  "record": {
    "abstract": "We describe a quantum algorithm to prepare an arbitrary pure state of a\nregister of a quantum computer with fidelity arbitrarily close to 1. Our\nalgorithm is based on Grover\u0027s quantum search algorithm. For sequences of\nstates with suitably bounded amplitudes, the algorithm requires resources that\nare polynomial in the number of qubits. Such sequences of states occur\nnaturally in the problem of encoding a classical probability distribution in a\nquantum register.",
    "arxiv_id": "quant-ph/0408045",
    "authors": [
      "Andrei N. Soklakov",
      "Ruediger Schack"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Efficient state preparation for a register of quantum bits",
    "url": "https://arxiv.org/abs/quant-ph/0408045"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ea9b3463-3065-4dd1-bd76-5108726373c2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}