{
  "annotation_id": "8194d133-1689-4a4c-97fb-075f9711a9be",
  "date_created": "2026-03-02T18:01:42.573000Z",
  "date_modified": "2026-03-02T18:01:42.573000Z",
  "file_hash": "935821bb7ce9eecb4717f560ca84918f25fedd805a9ac74379705780a7342dc6",
  "private": false,
  "record": {
    "abstract": "Preparation of a quantum register is an important step in quantum computation\nand quantum information processing. It is straightforward to build a simple\nquantum state such as $|i_1 i_2 ... i_n\\ket$ with $i_j$ being either 0 or 1,\nbut is a non-trivial task to construct an {\\it arbitrary} superposed quantum\nstate. In this Paper, we present a scheme that can most generally initialize a\nquantum register with an arbitrary superposition of basis states.\nImplementation of this scheme requires $O(Nn^2)$ standard 1- and 2-bit gate\noperations, {\\it without introducing additional quantum bits}. Application of\nthe scheme in some special cases is discussed.",
    "arxiv_id": "quant-ph/0104030",
    "authors": [
      "Gui-Lu Long",
      "Yang Sun"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.64.014303",
    "journal_ref": "Phys. Rev. A64 (2001) 014303",
    "title": "Efficient Scheme for Initializing a Quantum Register with an Arbitrary   Superposed State",
    "url": "https://arxiv.org/abs/quant-ph/0104030"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "238d0591-1aec-4ef8-abd6-7c6e672333ef",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}