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:2303.07907 · Physical Review Applied

Weak entanglement improves quantum communication using only product measurements

Amélie Piveteau, Alastair A. Abbott, Sadiq Muhammad, Mohamed Bourennane, Armin Tavakoli

Published Mar 25, 2024• 4 citations
arXivHTMLPDF

Abstract

We show that weakly entangled states can improve communication over a qubit channel using only separate, interference-free, measurements of individual photons. We introduce a communication task corresponding to the cryptographic primitive known as secret sharing and show that all steerable two-qubit isotropic states provide a quantum advantage in the success rate using only product measurements. Furthermore, we show that such measurements can even reveal communication advantages from noisy partially entangled states that admit no quantum steering. We then go further and consider a stochastic variant of secret sharing based on more-sophisticated, yet standard, partial Bell-state analyzers, and show that this reveals advantages also for a range of unsteerable isotropic states. By preparing polarization qubits in unsteerable states, we experimentally demonstrate increased success rates of both secret-sharing tasks beyond the best entanglement-unassisted qubit protocol. Our results reveal the capability of simple and scalable measurements in entanglement-assisted quantum communication to overcome large amounts of noise. Published by the American Physical Society 2024

DOI
10.1103/physrevapplied.21.034053

Related papers

Entanglement assisted quantum communication protocols

Amélie Piveteau

Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.

•Jan 1, 2026•0 citations

Scalable Entanglement Certification via Quantum Communication

Pharnam Bakhshinezhad, Mohammad Mehboudi, Carles Roch i Carceller +1 more

Harnessing the advantages of shared entanglement for sending quantum messages often requires the implementation of complex two-particle entangled measurements. We investigate entanglement advantages in protocols that use only the simplest two-particle measurements, namely, product measurements. For experiments in which only the dimension of the message is known, we show that robust entanglement advantages are possible but that they are fundamentally limited by Einstein-Podolsky-Rosen steering. Subsequently, we propose a natural extension of the standard scenario for these experiments and show that it circumvents this limitation. This leads us to prove entanglement advantages from every entangled two-qubit Werner state, evidence its generalization to high-dimensional systems, and establish a connection to quantum teleportation. Our results reveal the power of product measurements for generating quantum correlations in entanglement-assisted communication and they pave the way for practical semi-device-independent entanglement certification well beyond the constraints of Einstein-Podolsky-Rosen steering. Published by the American Physical Society 2024

arXiv:2401.00796•PRX Quantum•Apr 23, 2024•16 citations

Entanglement-assisted quantum communication with simple measurements

Amélie Piveteau, Jef Pauwels, Emil Håkansson +3 more

Dense coding is the seminal example of how entanglement can boost qubit communication, from sending one bit to sending two bits. This is made possible by projecting separate particles onto a maximally entangled basis. We investigate more general communication tasks, in both theory and experiment, and show that simpler measurements enable strong and sometimes even optimal entanglement-assisted qubit communication protocols. Using only partial Bell state analysers for two qubits, we demonstrate quantum correlations that cannot be simulated with two bits of classical communication. Then, we show that there exists an established and operationally meaningful task for which product measurements are sufficient for the strongest possible quantum predictions based on a maximally entangled two-qubit state. Our results reveal that there are scenarios in which the power of entanglement in enhancing quantum communication can be harvested in simple and scalable optical experiments.

arXiv:2205.09602•Nature Communications•Dec 22, 2022•56 citations

Adaptive Advantage in Entanglement-Assisted Communications

Jef Pauwels, Stefano Pironio, Emmanuel Zambrini Cruzeiro +1 more

Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer. Entanglement-assisted classical communication protocols usually consist of two successive rounds: first, a Bell test round, in which the parties measure their local shares of the entangled state, and then a communication round, where they exchange classical messages. Here, we go beyond this standard approach and investigate adaptive uses of entanglement: we allow the receiver to wait for the arrival of the sender's message before measuring their share of the entangled state. We first show that such adaptive protocols improve the success probability in random access codes. Second, we show that once adaptive measurements are used, an entanglement-assisted bit becomes a strictly stronger resource than a qubit in prepare-and-measure scenarios. We briefly discuss the extension of these ideas to scenarios involving quantum communication and we identify resource inequalities.

arXiv:2203.05372•Physical Review Letters•Sep 14, 2022•21 citations

Entanglement-secured single-qubit quantum secret sharing

Peter Scherpelz, R. Resch, D. Berryrieser +1 more

In single-qubit quantum secret sharing, a secret is shared between $N$ parties via manipulation and measurement of one qubit at a time. Each qubit is sent to all $N$ parties in sequence; the secret is encoded in the first participant's preparation of the qubit state and the subsequent participants' choices of state rotation or measurement basis. We present a protocol for single-qubit quantum secret sharing using polarization entanglement of photon pairs produced in type-I spontaneous parametric downconversion. We investigate the protocol's security against eavesdropping attack under common experimental conditions: a lossy channel for photon transmission, and imperfect preparation of the initial qubit state. A protocol which exploits entanglement between photons, rather than simply polarization correlation, is more robustly secure. We implement the entanglement-based secret-sharing protocol with 87$%$ secret-sharing fidelity, limited by the purity of the entangled state produced by our present apparatus. We demonstrate a photon-number splitting eavesdropping attack, which achieves no success against the entanglement-based protocol while showing the predicted rate of success against a correlation-based protocol.

arXiv:1109.2103•Physical Review A•Sep 2, 2011•9 citations

Entanglement enhances security in quantum communication

Rafał Demkowicz-Dobrzański, Aditi Sen, Ujjwal Sen +1 more

Secret sharing is a protocol in which a ``boss'' wants to send a classical message secretly to two ``subordinates,'' such that none of the subordinates is able to know the message alone, while they can find it if they cooperate. Quantum mechanics is known to allow for such a possibility. We analyze tolerable quantum bit error rates in such secret sharing protocols in the physically relevant case when the eavesdropping is local with respect to the two channels of information transfer from the boss to the two subordinates. We find that using entangled encoding states is advantageous to legitimate users of the protocol. We therefore find that entanglement is useful for secure quantum communication. We also find that bound entangled states with positive partial transpose are not useful as a local eavesdropping resource. Moreover, we provide a criterion for security in secret sharing---a parallel of the Csisz\'ar-K\"orner criterion in single-receiver classical cryptography.

arXiv:0802.1811•Physical Review A•Jul 13, 2009•32 citations
We show that weakly entangled states can improve communication over a qubit channel using only separate, interference-free, measurements of individual photons. We introduce a communication task corresponding to the cryptographic primitive known as secret sharing and show that all steerable two-qubit isotropic states provide a quantum advantage in the success rate using only product measurements. Furthermore, we show that such measurements can even reveal communication advantages from noisy partially entangled states that admit no quantum steering. We then go further and consider a stochastic variant of secret sharing based on more-sophisticated, yet standard, partial Bell-state analyzers, and show that this reveals advantages also for a range of unsteerable isotropic states. By preparing polarization qubits in unsteerable states, we experimentally demonstrate increased success rates of both secret-sharing tasks beyond the best entanglement-unassisted qubit protocol. Our results reveal the capability of simple and scalable measurements in entanglement-assisted quantum communication to overcome large amounts of noise. Published by the American Physical Society 2024
Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.
Harnessing the advantages of shared entanglement for sending quantum messages often requires the implementation of complex two-particle entangled measurements. We investigate entanglement advantages in protocols that use only the simplest two-particle measurements, namely, product measurements. For experiments in which only the dimension of the message is known, we show that robust entanglement advantages are possible but that they are fundamentally limited by Einstein-Podolsky-Rosen steering. Subsequently, we propose a natural extension of the standard scenario for these experiments and show that it circumvents this limitation. This leads us to prove entanglement advantages from every entangled two-qubit Werner state, evidence its generalization to high-dimensional systems, and establish a connection to quantum teleportation. Our results reveal the power of product measurements for generating quantum correlations in entanglement-assisted communication and they pave the way for practical semi-device-independent entanglement certification well beyond the constraints of Einstein-Podolsky-Rosen steering. Published by the American Physical Society 2024
Dense coding is the seminal example of how entanglement can boost qubit communication, from sending one bit to sending two bits. This is made possible by projecting separate particles onto a maximally entangled basis. We investigate more general communication tasks, in both theory and experiment, and show that simpler measurements enable strong and sometimes even optimal entanglement-assisted qubit communication protocols. Using only partial Bell state analysers for two qubits, we demonstrate quantum correlations that cannot be simulated with two bits of classical communication. Then, we show that there exists an established and operationally meaningful task for which product measurements are sufficient for the strongest possible quantum predictions based on a maximally entangled two-qubit state. Our results reveal that there are scenarios in which the power of entanglement in enhancing quantum communication can be harvested in simple and scalable optical experiments.
Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer. Entanglement-assisted classical communication protocols usually consist of two successive rounds: first, a Bell test round, in which the parties measure their local shares of the entangled state, and then a communication round, where they exchange classical messages. Here, we go beyond this standard approach and investigate adaptive uses of entanglement: we allow the receiver to wait for the arrival of the sender's message before measuring their share of the entangled state. We first show that such adaptive protocols improve the success probability in random access codes. Second, we show that once adaptive measurements are used, an entanglement-assisted bit becomes a strictly stronger resource than a qubit in prepare-and-measure scenarios. We briefly discuss the extension of these ideas to scenarios involving quantum communication and we identify resource inequalities.
In single-qubit quantum secret sharing, a secret is shared between NNN parties via manipulation and measurement of one qubit at a time. Each qubit is sent to all NNN parties in sequence; the secret is encoded in the first participant's preparation of the qubit state and the subsequent participants' choices of state rotation or measurement basis. We present a protocol for single-qubit quantum secret sharing using polarization entanglement of photon pairs produced in type-I spontaneous parametric downconversion. We investigate the protocol's security against eavesdropping attack under common experimental conditions: a lossy channel for photon transmission, and imperfect preparation of the initial qubit state. A protocol which exploits entanglement between photons, rather than simply polarization correlation, is more robustly secure. We implement the entanglement-based secret-sharing protocol with 87% secret-sharing fidelity, limited by the purity of the entangled state produced by our present apparatus. We demonstrate a photon-number splitting eavesdropping attack, which achieves no success against the entanglement-based protocol while showing the predicted rate of success against a correlation-based protocol.
Secret sharing is a protocol in which a ``boss'' wants to send a classical message secretly to two ``subordinates,'' such that none of the subordinates is able to know the message alone, while they can find it if they cooperate. Quantum mechanics is known to allow for such a possibility. We analyze tolerable quantum bit error rates in such secret sharing protocols in the physically relevant case when the eavesdropping is local with respect to the two channels of information transfer from the boss to the two subordinates. We find that using entangled encoding states is advantageous to legitimate users of the protocol. We therefore find that entanglement is useful for secure quantum communication. We also find that bound entangled states with positive partial transpose are not useful as a local eavesdropping resource. Moreover, we provide a criterion for security in secret sharing---a parallel of the Csisz\'ar-K\"orner criterion in single-receiver classical cryptography.