{
  "annotation_id": "09d8ec2e-aa6e-4e86-a72f-78c88cffd799",
  "date_created": "2026-03-02T18:02:41.480000Z",
  "date_modified": "2026-03-02T18:02:41.480000Z",
  "file_hash": "3d2b0bd920c2867539fd3b3976fdb8c886ef685a239b086bfdc02d64b9abfd1f",
  "private": false,
  "record": {
    "abstract": "We consider the possibility of encoding m classical bits into much fewer n\nquantum bits so that an arbitrary bit from the original m bits can be recovered\nwith a good probability, and we show that non-trivial quantum encodings exist\nthat have no classical counterparts. On the other hand, we show that quantum\nencodings cannot be much more succint as compared to classical encodings, and\nwe provide a lower bound on such quantum encodings. Finally, using this lower\nbound, we prove an exponential lower bound on the size of 1-way quantum finite\nautomata for a family of languages accepted by linear sized deterministic\nfinite automata.",
    "arxiv_id": "quant-ph/9804043",
    "authors": [
      "Andris Ambainis",
      "Ashwin Nayak",
      "Amnon Ta-Shma",
      "Umesh Vazirani"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "title": "Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata",
    "url": "https://arxiv.org/abs/quant-ph/9804043"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "880415f6-98e5-4d3c-819c-02c3dce7d6e0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}