{
  "abstract": "We consider the following data compression problem. Given a string $x \\in \\{0,1\\}^m$ of Hamming weight at most $n$, compress it into a shorter string $y \\in \\{0,1\\}^s$ so that any bit $x_i$ of $x$ can be retrieved without any error using at most $t$ quantum queries to the standard oracle encoding of $y$. If queries are allowed to be adaptive we show how optimal compression up to a logarithmic factor can be achieved. If the queries are required to be made non-adaptively, we show schemes whose space is optimal in its dependence on $m$ except for a logarithmic factor, and is at most quadratically worse when compared to the optimum in its dependence on $n$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.06702",
  "author_total": 4,
  "authors": [
    {
      "name": "Shyam Dhamapurkar"
    },
    {
      "name": "Mohit Garg"
    },
    {
      "name": "Manaswi Paraashar"
    },
    {
      "name": "Jaikumar Radhakrishnan"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/9xz3jmxc9vkqk.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.06702",
  "fulltext_url": null,
  "id": "9xz3jmxc9vkqk",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.06702",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.DS"
    ],
    [
      "arxiv",
      "cs.IR"
    ],
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7220706226",
  "pdf_url": "https://arxiv.org/pdf/2610.06702",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-05",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/9xz3jmxc9vkqk.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:01Z",
      "native_id": "2610.06702",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.06702"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    },
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Optimal compression with quantum retrieval",
  "title_text": "Optimal compression with quantum retrieval",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:10Z",
  "url": "https://research.draconitic.com/paper/9xz3jmxc9vkqk",
  "venue": "arXiv",
  "versions": []
}