Papers
Topics
Authors
Recent
Search
2000 character limit reached

Random Access Code protocols: Quantum advantage related to intraparticle entanglement-based contextuality

Published 13 May 2026 in quant-ph and math-ph | (2605.13350v1)

Abstract: The quantum enhancement of success probability in the Random Access Code (RAC) protocols remains unexplored from two important perspectives. First, the use of entanglement between two co-measurable degrees of freedom of a single particle (intraparticle entanglement) in achieving such quantum enhancement has not been investigated. Second, no explicit quantitative correspondence has been established between the predicted/observed quantum advantage and the underlying quantum resource responsible for it. In this work, we address both these aspects simultaneously by harnessing a single-particle resource. For this purpose, the RAC protocol is formulated in terms of intraparticle entanglement between, for instance, spin/polarization and path degrees of freedom of a single particle. Within this framework, a relevant Bell-type inequality, derived from the assumption of noncontextuality for single particle path-spin measurements, is used. Based on these ingredients, the formulated analysis reveals that the magnitude of quantum-mechanical violation of such Bell-type inequality, signifying a form of quantum contextuality, is quantitatively commensurate with the quantum enhancement of success probability in any intraparticle entanglement-assisted $n$-bit RAC protocol. In particular, the maximal success probability of a quantum $n \mapsto 1$ RAC protocol corresponds to the maximal quantum violation of the relevant Bell-type inequality. This correspondence is empirically testable using a readily implementable single-particle interferometric setup requiring coherence preservation only for a single particle.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.