{
  "abstract": "Quantum one-time programs (Broadbent, Gutoski and Stebila, CRYPTO 2013) or OTPs for short, enable a functionality to be encoded into a quantum token that can be evaluated on a single chosen input and then becomes unusable. While powerful, this primitive is inherently stateless and tied to a setting in which a quantum token needs to be issued and distributed for every single evaluation of a circuit. This raises a natural question: can the one-time computation paradigm be extended to richer, stateful forms of controlled access, and would such an extension offer inherent advantages beyond standard OTPs? We introduce $\\textit{query-limited RAM programs}$ (QLPs), a RAM-generalization of QOTPs that supports structured, stateful computation under bounded or policy-driven access. QLPs allow controlled sequences of evaluations while preventing adversarial forking or rollback of computational state. This enables new applications beyond stateless one-time programs, including quantum tokens for Turing Machines whose size depends only on $\\textit{code length}$ (and not runtime), transferable $k$-time or budget-limited programs, and low-communication mechanisms for delegating computation in settings such as Software-as-a-Service. To construct QLPs, we introduce $\\textit{one-shot programs}$, unifying one-shot signatures (Amos, Georgiou, Kiayias and Zhandry, STOC 2020) with the single effective query paradigm (Gupte, Liu, Raizes, Roberts and Vaikuntanathan, STOC 2025). We prove that one-shot programs generically imply query-limited programs, demonstrating that the strengthened unclonability guarantees of one-shot signatures translate into enhanced functionality. Along the way, we clarify the relationship between signature-token primitives and quantum one-time programs via generic constructions, essentially showing that one-time signing programs imply one-time general computation.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.40194",
  "author_total": 4,
  "authors": [
    {
      "name": "Jiahui Liu"
    },
    {
      "name": "Justin Raizes"
    },
    {
      "name": "Bhaskar Roberts"
    },
    {
      "name": "Omri Shmueli"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/0sj00svjzhjr5.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.40194",
  "fulltext_url": null,
  "id": "0sj00svjzhjr5",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.40194",
  "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.CR"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Cryptography and Data Security"
    ]
  ],
  "openalex": "W7215107730",
  "pdf_url": "https://arxiv.org/pdf/2609.40194",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/0sj00svjzhjr5.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:49Z",
      "native_id": "2609.40194",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.40194"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Query-Limited RAM Programs and their Applications",
  "title_text": "Query-Limited RAM Programs and their Applications",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:49Z",
  "url": "https://research.draconitic.com/paper/0sj00svjzhjr5",
  "venue": "arXiv",
  "versions": []
}