Quantum and Classical Memory for Storage and Retrieval of Quantum Measurements
Abstract
We study the persistent quantum and classical memory required for exact heralded storage and retrieval of quantum measurements. Given only black-box access to the measurement channel, we construct an exact compression of the port-based program into an outcome-type record and a quantum register, with total dimension polynomial in the query count. For every universal retrieval processor we prove the bounds Q+C≥log2 n and 2Q+C≥log2((n−1)d2+1) on the numbers Q of qubits and C of bits of the program, for n-outcome POVMs on ℂd with d≥2. For n≥2, no finite classical memory removes the need for quantum memory: any such processor requires a quantum program of dimension at least d, at that dimension its classical alphabet must have at least n symbols, and both minima are attained by a single-query protocol with success 1/d2. Combining direct-program compression with a converse from approximate measurement programming gives logarithmic total-memory scaling in 1/(1−p) as the uniform success probability p approaches one, at fixed d,n≥2. At fixed input dimension and target success below one, the optimal total-memory scaling is logarithmic in n. We also construct self-contained programs under branch-decomposition access and compare the quantum and classical costs of all constructions, including where the outcome-type record is kept: for POVMs with n nonzero rank-one effects the direct program admits a purely quantum allocation whose register is never larger than that of the minimal-Naimark unitary program and which succeeds more often whenever n>d.
Related
- Multicopy quantum state teleportation with application to storage and retrieval of quantum programs
- Probabilistic Storage and Retrieval of Quantum Superchannels for "Retrospective" Intervention
- Effects of Quantum Noise and Source Blurring on Dark-Field Signal Retrieval in X-ray Speckle-Based Imaging
- Multicopy teleportation and quantum program retrieval on superconducting quantum hardware
- Optimal compression with quantum retrieval
BibTeX
@misc{turobos2026quantum,
title = {{Quantum and Classical Memory for Storage and Retrieval of Quantum Measurements}},
author = {Filip Turoboś and Ludmiła Marcinkowska and Zbigniew Puchała},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.36972},
eprint = {2610.36972},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.36972},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Quantum and Classical Memory for Storage and Retrieval of Quantum Measurements
AU - Filip Turoboś
AU - Ludmiła Marcinkowska
AU - Zbigniew Puchała
PY - 2026
DA - 2026/10/27
PB - arXiv
DO - 10.48550/arxiv.2610.36972
UR - https://arxiv.org/abs/2610.36972
AB - We study the persistent quantum and classical memory required for exact heralded storage and retrieval of quantum measurements. Given only black-box access to the measurement channel, we construct an exact compression of the port-based program into an outcome-type record and a quantum register, with total dimension polynomial in the query count. For every universal retrieval processor we prove the bounds Q+C≥log_2 n and 2Q+C≥log_2((n−1)d^2+1) on the numbers Q of qubits and C of bits of the program, for n-outcome POVMs on ℂ^d with d≥2. For n≥2, no finite classical memory removes the need for quantum memory: any such processor requires a quantum program of dimension at least d, at that dimension its classical alphabet must have at least n symbols, and both minima are attained by a single-query protocol with success 1/d^2. Combining direct-program compression with a converse from approximate measurement programming gives logarithmic total-memory scaling in 1/(1−p) as the uniform success probability p approaches one, at fixed d,n≥2. At fixed input dimension and target success below one, the optimal total-memory scaling is logarithmic in n. We also construct self-contained programs under branch-decomposition access and compare the quantum and classical costs of all constructions, including where the outcome-type record is kept: for POVMs with n nonzero rank-one effects the direct program admits a purely quantum allocation whose register is never larger than that of the minimal-Naimark unitary program and which succeeds more often whenever n>d.
ER -