2021/01/31 by Debarshi Das, Arkaprabha Ghosal, Ananda G. Maity +2
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Combinatorics #Computer network #Computer science #Discrete mathematics #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Qubit #Random access #Separable space #State (computer science) #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physreva.104.l060602
published as Phys. Rev. A 104, L060602 (2021) · Close to published version
arxiv created 2021/12/29 · openalex publication_date 2021/12/29 · arxiv updated 2021/12/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Complications in preparing and preserving quantum correlations stimulate recycling of a single quantum resource in information processing and communication tasks multiple times. Here, we consider a scenario involving multiple independent pairs of observers acting with unbiased inputs on a single pair of spatially separated qubits sequentially. In this scenario, we address whether more than one pair of observers can demonstrate quantum advantage in some specific 2\ensuremath→1 and 3\ensuremath→1 random access codes. Interestingly, we not only address these in the affirmative but also illustrate that unbounded pairs can exhibit quantum advantage. Furthermore, these results remain valid even when all observers perform suitable projective measurements and an appropriate separable state is initially shared.