Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.12753

Sequential vs parallel Strategies for Sharing Quantum Advantage in Communication Tasks

Satyaki Manna, Arindam Mitra, Sumit Mukherjee

Published Nov 9, 2026• 0 citations
arXivHTMLPDF

Abstract

Information can be extracted from a quantum system in a sustainable manner, allowing the system to be reused for further information extraction through subsequent interactions. We investigate the possibility of consensus between two experimentally feasible methods, namely, parallel and sequential sharing, that enable multiple observers to extract information encoded in a quantum system. We show that any statistics generated by a parallel sharing strategy can be reproduced by a sequential strategy when only two observers are involved. However, when more than two observers participate in sharing quantum correlations, certain statistics achievable through parallel strategies cannot be reproduced by sequential strategies. Moreover, we demonstrate that sharing quantum advantage through a parallel strategy is impossible for a class of communication tasks involving two decoding measurements, thereby establishing an arbitrarily large gap between the sustainability of quantum advantage under sequential and parallel strategies. This naturally raises the question of whether this impossibility extends to communication tasks involving more than two decoding measurements. We show that, while parallel sharing of quantum advantage is impossible in a 3-bit random access code (RAC), it becomes possible in a 3-bit parity-oblivious RAC, where at most two observers can simultaneously obtain a quantum advantage by performing measurements on two imperfect clones of the initially prepared quantum system. Our findings have potential applications in the development of quantum communication networks and distributed quantum information processing.

DOI
10.48550/arxiv.2611.12753

Related papers

Ability of unbounded pairs of observers to achieve quantum advantage in random access codes with a single pair of qubits

Debarshi Das, Arkaprabha Ghosal, Ananda G. Maity +2 more

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{\rightarrow}1$ and $3\ensuremath{\rightarrow}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.

arXiv:2101.01227•Physical Review A•Dec 29, 2021•15 citations

Robust certification of unsharp instruments through sequential quantum advantages in a prepare-measure communication game

Abhyoudai S. Shaleena, Sumit Mukherjee, A. K. Pan

Communication games are one of the widely used tools that are designed to demonstrate quantum supremacy over classical resources in which two or more parties collaborate to perform an information processing task to achieve the highest success probability of winning the game. We propose a specific two-party communication game in the prepare-measure scenario that relies on an encoding-decoding task of specific information. We first demonstrate that quantum theory outperforms the classical preparation noncontextual theory and the optimal quantum success probability of such a communication game enables the semi-device-independent certification of qubit states and measurements. Further, we consider the sequential sharing of quantum preparation contextuality and show that, at most, two sequential observers can share the quantum advantage. The suboptimal quantum advantages for two sequential observers form an optimal pair which certifies a unique value of the unsharpness parameter of the first observer. Since the practical implementation inevitably introduces noise, we devised a scheme to demonstrate the robust certification of the states and unsharp measurement instruments of both the sequential observers.

arXiv:2212.14207•Physical Review A•Jan 6, 2023•15 citations

Proof-of-principle demonstration of sequential 3 → 1 quantum random access code via cascaded measurements

Wei Fang, Jian Li, Min Wei +2 more

Quantum random access code (QRAC) serves the communication task to encode a long message into a quantum system and allow the receiver to decode the initial information with a higher success probability than classical random access code (RAC). Here, we present an experimental demonstration of sequential 3 → 1 QRAC in the prepare-transform-measure scenario with one sender and three independent receivers. The experimental results show that, in the 3 → 1 QRAC scenario, three receivers can independently decode the initial information with an average success probability higher than the classical RAC.

Optics Express•Feb 18, 2022•2 citations

Measurement incompatibility and quantum advantage in communication

Debashis Saha, Debarshi Das, Arun Kumar Das +2 more

Measurement incompatibility stipulates the existence of quantum measurements that cannot be carried out simultaneously on single systems. We show that the set of input-output probabilities obtained from $d$-dimensional classical systems assisted with shared randomness is the same as the set obtained from $d$-dimensional quantum strategies restricted to compatible measurements with shared randomness in any communication scenario. Thus, measurement incompatibility is necessary for quantum advantage in communication, and any quantum advantage (with or without shared randomness) in communication acts as a witness to the incompatibility of the measurements at the receiver's end in a semi-device-independent way. We introduce a class of communication tasks---a general version of random access codes---to witness incompatibility of an arbitrary number of quantum measurements with arbitrary outcomes acting on $d$-dimensional systems and provide generic upper bounds on the success metric of these tasks for compatible measurements. We identify all sets of three incompatible rank-one projective qubit measurements that random access codes can witness. Finally, we present the generic relationship between different sets of probability distributions---classical, quantum with or without shared randomness, and quantum restricted to compatible measurements with or without shared randomness---produced in communication scenarios.

arXiv:2209.14582•Physical Review A•Jun 12, 2023•24 citations

Unbounded Communication Power of a Qubit

Souradeep Sasmal, Som Kanjilal, Debarshi Das

Quantum mechanics enables information-processing advantages even at the level of a single qubit. A paradigmatic example is the 2$\to$1 random access code (RAC), where a qubit outperforms a classical bit in retrieving encoded information. In the standard form, however, this quantum advantage is restricted to a single receiver, since decoding measurements inevitably destroy the encoded information. Contrary to this, we address how long the information encoded in a single qubit remains accessible even after multiple decoding, each with a quantum advantage. Introducing preparation distinguishability as an operational resource associated with the sender, we show that its interplay with measurement incompatibility on the receiver's side can mitigate measurement-induced disturbance, thereby enabling an arbitrarily long sequence of receivers to each retain a quantum advantage. Our results show that, even under repeated measurements, the information encoded in a qubit need not be entirely exhausted, revealing a stronger communication feature than previously recognised.

quant-pharXiv:2605.16093•May 18, 2026•4 citations

Sufficient conditions for quantum advantage in random access code protocols with two-qubit states

Som Kanjilal, Chellasamy Jebarathinam, Tomasz Paterek +1 more

A random access code (RAC) is an important communication protocol to obtain information about a randomly specified substring of an $n$-bit string, while only having limited information about the $n$-bit string. Quantum RACs usually utilize either communication of quantum bits or a shared-in-advance quantum state used in conjunction with classical communication. Here we consider the latter version of the quantum protocols under the constraint of single-bit communication and with a shared arbitrary state of two qubits. Taking the worst-case success probability as the figure of merit, we demonstrate that any state with an invertible correlation matrix can be used to outperform the best classical RAC for $n=3$. We derive an additional condition sufficient to beat the best classical performance in the case of $n=2$. In particular, separable states turn out to be a useful resource behind the quantum advantage for $n=2,3$. For $n\ensuremath{\ge}4$, RACs assisted with a single copy of a quantum state do not outperform the classical RACs.

arXiv:1912.09900•Physical Review A•Jul 19, 2023•8 citations
Information can be extracted from a quantum system in a sustainable manner, allowing the system to be reused for further information extraction through subsequent interactions. We investigate the possibility of consensus between two experimentally feasible methods, namely, parallel and sequential sharing, that enable multiple observers to extract information encoded in a quantum system. We show that any statistics generated by a parallel sharing strategy can be reproduced by a sequential strategy when only two observers are involved. However, when more than two observers participate in sharing quantum correlations, certain statistics achievable through parallel strategies cannot be reproduced by sequential strategies. Moreover, we demonstrate that sharing quantum advantage through a parallel strategy is impossible for a class of communication tasks involving two decoding measurements, thereby establishing an arbitrarily large gap between the sustainability of quantum advantage under sequential and parallel strategies. This naturally raises the question of whether this impossibility extends to communication tasks involving more than two decoding measurements. We show that, while parallel sharing of quantum advantage is impossible in a 3-bit random access code (RAC), it becomes possible in a 3-bit parity-oblivious RAC, where at most two observers can simultaneously obtain a quantum advantage by performing measurements on two imperfect clones of the initially prepared quantum system. Our findings have potential applications in the development of quantum communication networks and distributed quantum information processing.
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{\rightarrow}1$ and $3\ensuremath{\rightarrow}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.
Communication games are one of the widely used tools that are designed to demonstrate quantum supremacy over classical resources in which two or more parties collaborate to perform an information processing task to achieve the highest success probability of winning the game. We propose a specific two-party communication game in the prepare-measure scenario that relies on an encoding-decoding task of specific information. We first demonstrate that quantum theory outperforms the classical preparation noncontextual theory and the optimal quantum success probability of such a communication game enables the semi-device-independent certification of qubit states and measurements. Further, we consider the sequential sharing of quantum preparation contextuality and show that, at most, two sequential observers can share the quantum advantage. The suboptimal quantum advantages for two sequential observers form an optimal pair which certifies a unique value of the unsharpness parameter of the first observer. Since the practical implementation inevitably introduces noise, we devised a scheme to demonstrate the robust certification of the states and unsharp measurement instruments of both the sequential observers.
Quantum random access code (QRAC) serves the communication task to encode a long message into a quantum system and allow the receiver to decode the initial information with a higher success probability than classical random access code (RAC). Here, we present an experimental demonstration of sequential 3 → 1 QRAC in the prepare-transform-measure scenario with one sender and three independent receivers. The experimental results show that, in the 3 → 1 QRAC scenario, three receivers can independently decode the initial information with an average success probability higher than the classical RAC.
Measurement incompatibility stipulates the existence of quantum measurements that cannot be carried out simultaneously on single systems. We show that the set of input-output probabilities obtained from ddd-dimensional classical systems assisted with shared randomness is the same as the set obtained from ddd-dimensional quantum strategies restricted to compatible measurements with shared randomness in any communication scenario. Thus, measurement incompatibility is necessary for quantum advantage in communication, and any quantum advantage (with or without shared randomness) in communication acts as a witness to the incompatibility of the measurements at the receiver's end in a semi-device-independent way. We introduce a class of communication tasks---a general version of random access codes---to witness incompatibility of an arbitrary number of quantum measurements with arbitrary outcomes acting on ddd-dimensional systems and provide generic upper bounds on the success metric of these tasks for compatible measurements. We identify all sets of three incompatible rank-one projective qubit measurements that random access codes can witness. Finally, we present the generic relationship between different sets of probability distributions---classical, quantum with or without shared randomness, and quantum restricted to compatible measurements with or without shared randomness---produced in communication scenarios.
Quantum mechanics enables information-processing advantages even at the level of a single qubit. A paradigmatic example is the 2$\to$1 random access code (RAC), where a qubit outperforms a classical bit in retrieving encoded information. In the standard form, however, this quantum advantage is restricted to a single receiver, since decoding measurements inevitably destroy the encoded information. Contrary to this, we address how long the information encoded in a single qubit remains accessible even after multiple decoding, each with a quantum advantage. Introducing preparation distinguishability as an operational resource associated with the sender, we show that its interplay with measurement incompatibility on the receiver's side can mitigate measurement-induced disturbance, thereby enabling an arbitrarily long sequence of receivers to each retain a quantum advantage. Our results show that, even under repeated measurements, the information encoded in a qubit need not be entirely exhausted, revealing a stronger communication feature than previously recognised.
A random access code (RAC) is an important communication protocol to obtain information about a randomly specified substring of an nnn-bit string, while only having limited information about the nnn-bit string. Quantum RACs usually utilize either communication of quantum bits or a shared-in-advance quantum state used in conjunction with classical communication. Here we consider the latter version of the quantum protocols under the constraint of single-bit communication and with a shared arbitrary state of two qubits. Taking the worst-case success probability as the figure of merit, we demonstrate that any state with an invertible correlation matrix can be used to outperform the best classical RAC for n=3n=3n=3. We derive an additional condition sufficient to beat the best classical performance in the case of n=2n=2n=2. In particular, separable states turn out to be a useful resource behind the quantum advantage for n=2,3n=2,3n=2,3. For $n\ensuremath{\ge}4$, RACs assisted with a single copy of a quantum state do not outperform the classical RACs.