Query-Limited RAM Programs and their Applications
Query-limited RAM programs extend quantum one-time programs to stateful, policy-bounded computation.
The paper introduces query-limited RAM programs, a stateful generalization of quantum one-time programs that allows policy-bounded sequences of evaluations while preventing forking or rollback. Applications include quantum tokens for Turing machines sized by code length, transferable k-time programs, and low-communication SaaS delegation. The construction uses one-shot programs combining one-shot signatures with the single-effective-query paradigm, and the authors prove these imply query-limited programs. They also show one-time signing programs imply one-time general computation.
- QLPs bound sequences of stateful RAM evaluations
- Designed to block forking and rollback of state
- One-shot programs generically imply query-limited programs
- Enables code-length quantum tokens and k-time programs
From the original article
1 min read at arxiv.orgQuantum 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.
By Jiahui Liu · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.