Noise-resilient quantum random access codes

A ${n}^{d}\stackrel{p}{\ensuremath{\rightarrow}}1$ quantum random access code (QRAC) is a communication task where Alice encodes $n$ classical bits into quantum states of dimension $d$ and transmits them to Bob, who performs appropriate measurements to recover the required bit with probability $p$. In the presence of a noisy environment, the performance of a QRAC is degraded, losing the advantage over classical strategies. We propose a practical technique that enables noise tolerance in such scenarios, recovering the quantum advantage in retrieving the required bit. We perform a photonic implementation of a ${2}^{2}\stackrel{\text{p}}{\ensuremath{\rightarrow}}1$ QRAC using polarization-encoded qubits under an amplitude-damping channel, where simple operations allow for noise robustness showing the revival of the quantum advantage when the noisy channel degrades the performance of the QRAC. This revival can be observed by violating a suitable dimension witness, which is closely related to the average success probability of the QRAC. This technique can be extended to other applications in the so-called prepare-and-measure scenario, enhancing the semi-device-independent protocol implementations.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-03-18
DOI
https://doi.org/10.1103/physreva.111.032613
Citations
2
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Noise-resilient quantum random access codes

S. P. Walborn, Felipe Quinteros, Akshata Shenoy H., Marcin Pawłowski et al.
2 citations
Physical review. A/Physical review, A
Quantum Information and Cryptography
4.96
article

Noise-resilient quantum random access codes

S. P. Walborn, Felipe Quinteros, Akshata Shenoy H., Marcin Pawłowski, G. Lima, Esteban S. Gómez, Santiago Gómez, H. S. Karthik
article en
2 citations

Abstract

A ${n}^{d}\stackrel{p}{\ensuremath{\rightarrow}}1$ quantum random access code (QRAC) is a communication task where Alice encodes $n$ classical bits into quantum states of dimension $d$ and transmits them to Bob, who performs appropriate measurements to recover the required bit with probability $p$. In the presence of a noisy environment, the performance of a QRAC is degraded, losing the advantage over classical strategies. We propose a practical technique that enables noise tolerance in such scenarios, recovering the quantum advantage in retrieving the required bit. We perform a photonic implementation of a ${2}^{2}\stackrel{\text{p}}{\ensuremath{\rightarrow}}1$ QRAC using polarization-encoded qubits under an amplitude-damping channel, where simple operations allow for noise robustness showing the revival of the quantum advantage when the noisy channel degrades the performance of the QRAC. This revival can be observed by violating a suitable dimension witness, which is closely related to the average success probability of the QRAC. This technique can be extended to other applications in the so-called prepare-and-measure scenario, enhancing the semi-device-independent protocol implementations.

Physical review. A/Physical review, AVol. 111(3)
University of Concepción (CL), Millennium Institute (BR), University of Gdańsk (PL), Sapienza University of Rome (IT)
Agenția Națională pentru Cercetare și Dezvoltare, Fundacja na rzecz Nauki Polskiej, Narodowym Centrum Nauki, Agencia Nacional de Investigación y Desarrollo, Fondo Nacional de Desarrollo Científico y Tecnológico
Climate action
Openalex Percentile: Top 6%
Quantum Information and Cryptography
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.