Skip to content
aiqbench takeQuantum Comms

aiqbench analysis

This paper addresses the transition from NISQ-era constraints to early fault-tolerant quantum computing by establishing a secure one-time memory protocol within the Classically Accessible Random-Oracle Model. By restricting adversaries to classical oracle queries, the authors demonstrate that efficient simulation-secure functionality remains viable even as logical quantum circuits deepen, offering a robust cryptographic primitive for future quantum networks.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Beyond NISQ Assumptions: One-time Memory in the Classically Accessible Random-Oracle Model

arXiv2 min read

arXiv:2609.32603v1 Announce Type: new Abstract: Quantum information enables many cryptographic primitives that are impossible in the classical world. A line of works has developed cryptographic protocol under the assumption that quantum adversaries are restricted to noisy intermediate-scale quantum (NISQ) computing power, enabling strong one-time functionalities. But the advent of early fault-tolerant quantum computers eras will allow deeper logical quantum circuits, calling into questions the applicability of these NISQ-based assumptions. In this work, we adapt the classically accessible random oracle model (CAROM) as in [BDF+11] and [AK22], in which adversaries are only allowed to classically query the random oracle. The restriction is well motivated for NISQ quantum adversaries and may remain plausible in the presence of early fault-tolerant quantum computers. Then, we show that an efficient simulation-secure one-time memory (OTM) is possible under CAROM. Our protocol uses only BB84 states and has quadratic communication: for a $\lambda$-bit message and integer-valued parameters $n=n(\lambda)$ and $\ell=\ell(\lambda)$, the construction uses $n\ell$ qubits and $(n+2)\lambda$ classical bits, and for any quantum adversary with at most $2^{\ell/2-1}-1$ classical queries to the random oracle, its simulation advantage is at most $(n+3)\left(\frac{3}{4}\right)^n.$ Hence exponentially small simulation advantage in $n$.

Abstract:Quantum information enables many cryptographic primitives that are impossible in the classical world. A line of works has developed cryptographic protocol under the assumption that quantum adversaries are restricted to noisy intermediate-scale quantum (NISQ) computing power, enabling strong one-time functionalities. But the advent of early fault-tolerant quantum computers eras will allow deeper logical quantum circuits, calling into questions the applicability of these NISQ-based assumptions. In this work, we adapt the classically accessible random oracle model (CAROM) as in [BDF+11] and [AK22], in which adversaries are only allowed to classically query the random oracle. The restriction is well motivated for NISQ quantum adversaries and may remain plausible in the presence of early fault-tolerant quantum computers. Then, we show that an efficient simulation-secure one-time memory (OTM) is possible under CAROM. Our protocol uses only BB84 states and has quadratic communication: for a $\lambda$-bit message and integer-valued parameters $n=n(\lambda)$ and $\ell=\ell(\lambda)$, the construction uses $n\ell$ qubits and $(n+2)\lambda$ classical bits, and for any quantum adversary with at most $2^{\ell/2-1}-1$ classical queries to the random oracle, its simulation advantage is at most $(n+3)\left(\frac{3}{4}\right)^n.$ Hence exponentially small simulation advantage in $n$.

Quantum Physics (quant-ph); Cryptography and Security (cs.CR)

arXiv:2609.32603 [quant-ph]

(or arXiv:2609.32603v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.32603 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 284 words

Related coverage