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

Quantum Information Processing

Limitation on the capacity of arbitrary bipartite pure entangled states for the unambiguous transmission of classical information

Lvjun Li

Published Dec 27, 2024• 0 citations
Publisher

Abstract

The capacity of quantum states to send information is a fundamental and intriguing issue in quantum communication theory. This study explores a scenario where Alice intends to transmit n bits of classical information to Bob by sending m qudits, using an arbitrary bipartite pure entangled state with E qudits as the shared resource. We employ the unambiguous discrimination strategy in decoding and establish an upper bound on the success probability, which extends the findings of a previous study (Li in Phys Rev A 85:052304, 2012).

DOI
10.1007/s11128-024-04626-0

Related papers

Qudits offer no advantages over dits for sending random messages

Ronit Shah

We consider the following simple scenario: Alice has one of many possible messages, drawn from a known distribution, and wants to maximize the probability that Bob guesses her message correctly. We prove that if Alice can send only a qudit to Bob, without preshared entanglement, there is never any advantage over sending him a classical dit. This result was previously known only for a uniform distribution. We also prove a mixed-state generalization of this result in the form of an upper bound on the success probability of discriminating between mixed quantum states with a single measurement. This bound is based solely on the dimension, probability distribution, and eigenvalues of the states and is sharp among such bounds.

quant-pharXiv:2512.02477•Dec 3, 2025•0 citations

Limits on the ability of Einstein-Podolsky-Rosen pairs to unambiguously convey classical messages

Lvjun Li

In this paper, we consider two related problems, unambiguous discrimination of quantum mixed states and unambiguously conveying classical messages using Einstein-Podolsky-Rosen (EPR) pairs. The main technical contributions are as follows. First, we present a general upper bound on the success probability for unambiguous discrimination among arbitrary $N$ mixed quantum states with given a priori probability, which can be directly used to the unambiguous communication setting. Second, we propose a sufficient condition to show that a new upper bound can be achievable, and construct examples to clarify the relationship between the upper bound we derive and the existing upper bounds presented by other authors. Third, in the issue of conveying classical messages using EPR pairs, we also derive an upper bound on the success probability for unambiguously decoding, where Alice wants to convey $n$ bit classical information to Bob by sending $m$ quantum bits.

Physical Review A•May 7, 2012•3 citations

Bounds on unambiguous discrimination between quantum states

Lvjun Li

In this paper, we present a general upper bound on the success probability for unambiguous discrimination among arbitrary $m$ mixed quantum states with given a priori probability. We further analyze how this upper bound can be achievable by presenting a sufficient condition related to it, and we compare this upper bound with three other upper bounds. Moreover, for the issue of the unambiguous identification of $m$ unknown multicopy qudit pure states, we also get a bound.

Physical Review A•Sep 17, 2012•6 citations

Quantum communication with entanglement

Vlatko Vedral

Abstract This chapter discusses some of the ways in which quantum entanglement can be used for quantum communication. Suppose Alice and Bob share an entangled state: they can use it for dense coding, in which Alice sends Bob just one qubit of an entangled pair, which delivers two bits of classical information. Alice and Bob can also use an entangled state for teleportation, in which a qubit in a unknown quantum state is teleported from Alice to Bob when Alice sends Bob two classical bits. Entanglement swapping is an example of a tripartite communication protocol. If Alice and Bob share entanglement, and Bob and Charlie share entanglement, entanglement swapping can be used to entangle Alice and Charlie. Even if Alice and Bob are entangled, Alice cannot communicate with Bob without sending him classical bits or qubits, which prevents Alice and Bob from breaking the laws of relativity. This chapter also discusses Pauli matrices and the extension of Hilbert spaces.

•Sep 28, 2006•0 citations

Correlation-assisted quantum communication

Mário Ziman, Vladimír Bužek

Quantum dense coding is considered to be one of the most remarkable demonstrations of the existence of quantum entanglement. In this paper, we analyze the role of correlations (both classical and quantum) in quantum communication protocols. We study how the capacity of a single-qubit quantum channel depends on correlations between Alice and Bob. In particular, we consider a scenario when Alice and Bob share a pair of qubits in a state such that Alice's qubit is in the state described by the density operator $\ensuremath{\varrho}=\frac{1}{2}1+\stackrel{\ensuremath{\rightarrow}}{n}\ensuremath{\cdot}\stackrel{\ensuremath{\rightarrow}}{\ensuremath{\sigma}}.$ We evaluate a capacity of the noiseless channel for two cases: (1) when Bob performs measurement just on the particle received from Alice, and (2) in the case when he utilizes correlations that have been established prior to the communication. We present a simple classical scenario which might serve as a prototype of quantum dense coding. We generalize our results also for qudits. In addition, we address some aspects of the issue of security in correlation-assisted communication protocols.

Physical Review A•Apr 25, 2003•38 citations

Distinguishing two-qubit states using local measurements and restricted classical communication

Mark S. Hillery, Jihane Mimih

The problem of unambiguous state discrimination consists of determining in which of a set of known quantum states a particular system is. One is allowed to fail but not to make a mistake. The optimal procedure is the one with the lowest failure probability. This procedure has been extended to bipartite states where the two parties Alice and Bob are allowed to manipulate their particles locally and communicate classically in order to determine which of two possible two-particle states they have been given. The failure probability of this local procedure is the same as if the two particles were together in the same location. Here we examine the effect of restricting the classical communication between the parties, either allowing none or eliminating the possibility that one party's measurement depends on the result of the other party's. These issues are studied for two-qubit states, and optimal procedures are found. In some cases the restrictions cause increases in the failure probability, but in other cases they do not. Applications of this procedure, in particular to secret sharing, are discussed.

arXiv:quant-ph/0210179•Physical Review A•Apr 4, 2003•20 citations
The capacity of quantum states to send information is a fundamental and intriguing issue in quantum communication theory. This study explores a scenario where Alice intends to transmit n bits of classical information to Bob by sending m qudits, using an arbitrary bipartite pure entangled state with E qudits as the shared resource. We employ the unambiguous discrimination strategy in decoding and establish an upper bound on the success probability, which extends the findings of a previous study (Li in Phys Rev A 85:052304, 2012).
We consider the following simple scenario: Alice has one of many possible messages, drawn from a known distribution, and wants to maximize the probability that Bob guesses her message correctly. We prove that if Alice can send only a qudit to Bob, without preshared entanglement, there is never any advantage over sending him a classical dit. This result was previously known only for a uniform distribution. We also prove a mixed-state generalization of this result in the form of an upper bound on the success probability of discriminating between mixed quantum states with a single measurement. This bound is based solely on the dimension, probability distribution, and eigenvalues of the states and is sharp among such bounds.
In this paper, we consider two related problems, unambiguous discrimination of quantum mixed states and unambiguously conveying classical messages using Einstein-Podolsky-Rosen (EPR) pairs. The main technical contributions are as follows. First, we present a general upper bound on the success probability for unambiguous discrimination among arbitrary NNN mixed quantum states with given a priori probability, which can be directly used to the unambiguous communication setting. Second, we propose a sufficient condition to show that a new upper bound can be achievable, and construct examples to clarify the relationship between the upper bound we derive and the existing upper bounds presented by other authors. Third, in the issue of conveying classical messages using EPR pairs, we also derive an upper bound on the success probability for unambiguously decoding, where Alice wants to convey nnn bit classical information to Bob by sending mmm quantum bits.
In this paper, we present a general upper bound on the success probability for unambiguous discrimination among arbitrary mmm mixed quantum states with given a priori probability. We further analyze how this upper bound can be achievable by presenting a sufficient condition related to it, and we compare this upper bound with three other upper bounds. Moreover, for the issue of the unambiguous identification of mmm unknown multicopy qudit pure states, we also get a bound.
Abstract This chapter discusses some of the ways in which quantum entanglement can be used for quantum communication. Suppose Alice and Bob share an entangled state: they can use it for dense coding, in which Alice sends Bob just one qubit of an entangled pair, which delivers two bits of classical information. Alice and Bob can also use an entangled state for teleportation, in which a qubit in a unknown quantum state is teleported from Alice to Bob when Alice sends Bob two classical bits. Entanglement swapping is an example of a tripartite communication protocol. If Alice and Bob share entanglement, and Bob and Charlie share entanglement, entanglement swapping can be used to entangle Alice and Charlie. Even if Alice and Bob are entangled, Alice cannot communicate with Bob without sending him classical bits or qubits, which prevents Alice and Bob from breaking the laws of relativity. This chapter also discusses Pauli matrices and the extension of Hilbert spaces.
Quantum dense coding is considered to be one of the most remarkable demonstrations of the existence of quantum entanglement. In this paper, we analyze the role of correlations (both classical and quantum) in quantum communication protocols. We study how the capacity of a single-qubit quantum channel depends on correlations between Alice and Bob. In particular, we consider a scenario when Alice and Bob share a pair of qubits in a state such that Alice's qubit is in the state described by the density operator $\ensuremath{\varrho}=\frac{1}{2}1+\stackrel{\ensuremath{\rightarrow}}{n}\ensuremath{\cdot}\stackrel{\ensuremath{\rightarrow}}{\ensuremath{\sigma}}.$ We evaluate a capacity of the noiseless channel for two cases: (1) when Bob performs measurement just on the particle received from Alice, and (2) in the case when he utilizes correlations that have been established prior to the communication. We present a simple classical scenario which might serve as a prototype of quantum dense coding. We generalize our results also for qudits. In addition, we address some aspects of the issue of security in correlation-assisted communication protocols.
The problem of unambiguous state discrimination consists of determining in which of a set of known quantum states a particular system is. One is allowed to fail but not to make a mistake. The optimal procedure is the one with the lowest failure probability. This procedure has been extended to bipartite states where the two parties Alice and Bob are allowed to manipulate their particles locally and communicate classically in order to determine which of two possible two-particle states they have been given. The failure probability of this local procedure is the same as if the two particles were together in the same location. Here we examine the effect of restricting the classical communication between the parties, either allowing none or eliminating the possibility that one party's measurement depends on the result of the other party's. These issues are studied for two-qubit states, and optimal procedures are found. In some cases the restrictions cause increases in the failure probability, but in other cases they do not. Applications of this procedure, in particular to secret sharing, are discussed.