Quantum One-Time Memories from Stateless Hardware, Random Access Codes, and Simple Nonconvex Optimization
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929664975437824 |
|---|---|
| author | Stambler, Lev |
| author_facet | Stambler, Lev |
| contents | We present a construction of one-time memories (OTMs) using classical-accessible stateless hardware, building upon the work of Broadbent et al. and Behera et al.. Unlike the aforementioned work, our approach leverages quantum random access codes (QRACs) to encode two classical bits, $b_0$ and $b_1$, into a single qubit state $\mathcal{E}(b_0 b_1)$ where the receiver can retrieve one of the bits with a certain probability of error. To prove soundness, we define a nonconvex optimization problem over POVMs on $\mathbb{C}^2$. This optimization gives an upper bound on the probability of distinguishing bit $b_{1-α}$ given that the probability that the receiver recovers bit $b_α$ is high. Assuming the optimization is sufficiently accurate, we then prove soundness against a polynomial number of classical queries to the hardware. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_04168 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum One-Time Memories from Stateless Hardware, Random Access Codes, and Simple Nonconvex Optimization Stambler, Lev Quantum Physics Cryptography and Security We present a construction of one-time memories (OTMs) using classical-accessible stateless hardware, building upon the work of Broadbent et al. and Behera et al.. Unlike the aforementioned work, our approach leverages quantum random access codes (QRACs) to encode two classical bits, $b_0$ and $b_1$, into a single qubit state $\mathcal{E}(b_0 b_1)$ where the receiver can retrieve one of the bits with a certain probability of error. To prove soundness, we define a nonconvex optimization problem over POVMs on $\mathbb{C}^2$. This optimization gives an upper bound on the probability of distinguishing bit $b_{1-α}$ given that the probability that the receiver recovers bit $b_α$ is high. Assuming the optimization is sufficiently accurate, we then prove soundness against a polynomial number of classical queries to the hardware. |
| title | Quantum One-Time Memories from Stateless Hardware, Random Access Codes, and Simple Nonconvex Optimization |
| topic | Quantum Physics Cryptography and Security |
| url | https://arxiv.org/abs/2501.04168 |