{
  "annotation_id": "f521b02a-a247-4869-a268-a16e06478441",
  "date_created": "2026-03-02T18:02:34.362000Z",
  "date_modified": "2026-03-02T18:02:34.362000Z",
  "file_hash": "d0d502d759b24362e68977afc5db49b5bf184c8af4a2a95a3975d8bf16731a9d",
  "private": false,
  "record": {
    "abstract": "Vector is the general format of input data of most algorithms. Designing\nunitary operation to load all information of vector into quantum registers of\nquantum CPU from classical memory is called quantum loading scheme (QLS). QLS\nassembles classical memory and quantum CPU as a whole computer, which will be\nimportant for further quantum computation. We present a QLS based on path\ninterference with time complexity O(logN), while classical loading scheme has\ntime complexity O(N), that is the efficiency bottleneck of classical computer.",
    "arxiv_id": "quant-ph/0612061",
    "authors": [
      "Chao-Yang Pang"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Loading N-Dimensional Vector into Quantum Registers from Classical   Memory with O(logN) Steps",
    "url": "https://arxiv.org/abs/quant-ph/0612061"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "67a081a6-9a5a-4381-898e-8e7b7369fdb5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}