Year: 2025
Type: preprint
Abstract: A quantum random access code (QRAC) is a map $x\mapstoρ_x$ that encodes $n$-bit strings $x$ into $m$-qubit quantum states $ρ_x$, in a way that allows us to recover any one bit of $x$ with success probability $\geq p$. The measurement on $ρ_x$ that is used to recover, say, $x_1$ may destroy all the information about the other bits; this is in fact what happens in the well-known QRAC that encodes $n=2$ bits into $m=1$ qubits. Does this generalize to large $n$, i.e., could there exist QRACs that are so "obfuscated" that one cannot get much more than one bit out of them? Here we show that this is not the case: for every QRAC there exists a measurement that (with high probability) recovers the full $n$-bit string $x$ up to small Hamming distance, even for the worst-case $x$.
Source: arXiv (Cornell University)
Authors: Lin, Han-Hsuan, de Wolf, Ronald
Institutions: National Tsing Hua University, QuSoft, University of Amsterdam
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4414898880
Cites:
Cited by:
Related to: