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

• URL: http://arxiv.org/abs/2605.13350v2
• Date: Sat, 16 May 2026 09:35:44 GMT
• Title: Random Access Code protocols: Quantum advantage related to intraparticle entanglement-based contextuality
• Abstract summary: We investigate the use of entanglement between two co-measurable degrees of freedom of a single particle in achieving quantum enhancement.<n>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.
• Score: 0.8029049649310211
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• From top quarks to enhanced quantum key distribution: A Framework for Optimal Predictability of Quantum Observables [0.0]
  We introduce a comprehensive framework for quantifying the predictability of measurements on a bipartite quantum system.<n>We derive analytical expressions for the optimal measurement that minimizes the prediction error for any arbitrary observable and any two-qubit state.<n>We apply our framework in two scenarios: perfect Bell states affected by local amplitude-damping noises, and top-antitop quark pairs produced in high-energy colliders.
  arXiv  Detail & Related papers  (2025-05-30T12:03:59Z)
• Certifying bipartite pure quantum states efficiently using untrusted devices [4.2297975934654986]
  It has been known that all bipartite pure quantum states can be certified by quantum self-testing.<n>Here, we prove that when the underlying Hilbert space dimension is known beforehand, an arbitrary $dtimes d$ bipartite pure state can be certified completely.<n>Compared with quantum self-testing, our protocols do not hinge on quantum nonlocality and are much more efficient.
  arXiv  Detail & Related papers  (2023-06-13T13:12:07Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Randomness-free Test of Non-classicality: a Proof of Concept [0.0]
  Existing schemes to certify such non-classical resources in a device-independent manner require seed randomness. We propose and experimentally implement a semi-device independent certification technique for both quantum correlations and non-projective measurements without seed randomness.
  arXiv  Detail & Related papers  (2023-03-13T10:44:16Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Measure-resend semi-quantum private comparison without entanglement [0.0]
  Our protocol allows two classical users to compare the equality of their private secrets under the help of a quantum third party. The quantum TP is semi-honest in the sense that he is allowed to misbehave on his own but cannot conspire with either of users.
  arXiv  Detail & Related papers  (2022-05-13T00:43:05Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Entropy certification of a realistic QRNG based on single-particle entanglement [0.0]
  In single-particle entanglement (SPE) two degrees of freedom of a single particle are entangled. We show how it is possible to provide a semi-device independent certification of realistic quantum random number generators based on Bell inequality violation by SPE states of photons.
  arXiv  Detail & Related papers  (2021-04-13T10:53:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.