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:2610.05669

Universal Improvement of Channel Fidelity via Entanglement Assistance

Xinan Chen, Eric Chitambar

quant-phSubmitted Oct 5, 2026• Announced Oct 6, 2026• 0 citations
arXivHTMLPDF

Abstract

Communication using quantum channels generally requires encoding and decoding on many identical uses of a quantum channel. In practical settings, decoherence may severely limit our ability to do so, potentially rendering each channel use nonidentical. Given $n$ nonidentical channels, we present an entanglement-assisted encoding and decoding strategy that yields a channel with higher worst-case fidelity than all of the $n$ given channels. The strategy is universal, in the sense that the improvement holds regardless of what channels are given, as long as they satisfy mild assumptions on their initial entanglement fidelities. Our protocol is optimal when the given channels are depolarizing channels, and is essentially the unique one that is universal. This idea can also be extended to classical channels, where shared randomness between the sender and the receiver allows universal enhancement of the probability of correct transmission. We then consider general quantum resource theories, providing a necessary condition and a sufficient condition for the possibility of such universal improvement of quantum resources.

AI Summary

The paper asks whether a fixed protocol can combine unknown, nonidentical quantum channels into one whose worst-case fidelity exceeds that of every input channel, without additional communication. It considers probabilistic encoding and decoding with preshared entanglement, assuming independent channel uses represented by a tensor product. For $n\geq2$ channels of dimension $d$, with entanglement fidelities $f_i\in(1/d^2,1)$, the protocol produces a heralded output channel with worst-case fidelity $F_{\mathrm{out}}=\prod_i f_i/P$, where $P=\prod_i f_i+(d^2-1)^{1-n}\prod_i(1-f_i)$ is its input-state-independent success probability. This exceeds every $f_i$, hence every input’s worst-case fidelity. The construction first twirls each channel to a depolarizing channel, then combines teleportation, superdense coding of the teleportation outcome, and error detection accepting only matching decoded outcomes. Two qubit channels with $f_1=0.9$ and $f_2=0.8$ yield fidelity approximately $0.991$ with probability $0.727$. Projective-robustness bounds establish optimal output fidelity for depolarizing inputs even under no-signaling assistance; success-probability optimality and uniqueness up to twirling and rescaling are established for two inputs. A shared-randomness classical analogue replaces $d^2$ by $d$. General resource-theoretic results give sufficient and near-necessary conditions involving free twirling, multiplicativity of projective robustness, and standard versus generalized robustness. The guarantees concern conditional fidelity, not deterministic transmission or communication rate, and consume preshared entanglement. General resource-theory applicability requires checking the stated structural conditions; physical entanglement-assisted implementability is explicitly constructed for communication.

No sign of AI-generated text

Error found: The introduction's strict-improvement domain includes perfect channels and does not explicitly require at least two channels, although strict improvement is impossible in either boundary case. The stated large-d corrections have the wrong exponent: the displayed protocol formulas give Θ(d^{−2(n−1)}) for fixed nontrivial input fidelities, rather than O(d^{−2n}). The generic-resource sufficient theorem allows mixed targets, but its overlap calculation assumes a pure target, and permitted mixed-target examples invalidate its resource-non-generating conclusion. The generic-resource strict-improvement theorem fails to exclude inputs already equal to a pure target, for which its promised improvement would exceed overlap 1.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
comments welcome

Related papers

Nonoptimality of unitary encoding with quantum channels assisted by entanglement

Michael R. Beran, Scott M. Cohen

One of the primary goals of information theory is to provide limits on the amount of information one can send through communication channels, and to understand encoding methods that achieve such limits. The discovery of dense coding showed that quantum channels can transmit twice as much classical information than is possible with a classical channel. This optimal rate requires using quantum systems maximally entangled between sender and receiver, and then the sender can encode her messages using unitary operations. The use of nonmaximally entangled systems has been intensively studied in recent years, and it has appeared as though unitary encoding might well be optimal in all cases. Indeed, this optimality of unitary operations has been found to hold under far more general conditions. Nonetheless, we here present numerical evidence supported by analytical arguments that there exist circumstances where more classical information can be encoded using nonunitary, rather than unitary, operations.

arXiv:0807.4552•Physical Review A•Dec 23, 2008•10 citations

Quantum Entanglement-Based Adaptive Information Coding and Decoding

Jincheng Zhang

This paper presents a novel approach to quantum information coding and decoding leveraging the unique properties of quantum entanglement. The core idea is to develop a self-adaptive system capable of dynamically adjusting encoding and decoding parameters based on the observed noise levels and channel losses within the quantum channel. This adaptive strategy aims to significantly improve the efficiency and reliability of quantum information transmission. The proposed framework utilizes a quantum decoherence model to accurately represent channel losses and employs an optimization algorithm rooted in quantum control theory to optimize the generation and measurement strategies of entangled states in real-time. The algorithm's objective is to minimize information loss. The key innovation lies in the system's ability to respond in real-time to fluctuating channel conditions, moving beyond the limitations of static encoding/decoding schemes commonly employed in existing quantum communication protocols. Mathematical models and formulations are presented to illustrate the design and optimization process, focusing on key performance metrics such as channel capacity and fidelity. The system's potential impact on future quantum communication networks is discussed.

•Sep 3, 2026•0 citations

On communication over an entanglement-assisted quantum channel

A. Nayak, Julia Salzman

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols: the two parties may be given some number of quantum bits jointly prepared in a fixed superposition, prior to communicating with each other. The quantum channel is then said to be "entanglement-assisted." Shared randomness does not help in the transmission of information from one party to another. Moreover, it does not significantly reduce the classical complexity of computing functions vis-a-vis private-coin protocols. On the other hand, prior entanglement leads to startling phenomena such as "quantum teleportation" and "superdense coding." The problem of characterising the power of prior entanglement has baffled many researchers, especially in the setting of bounded-error protocols. It is open whether it leads to more than a factor of two savings (using superdense coding) or more than an additive O(log) savings (when used to create shared randomness). Few lower bounds are known for communication problems in this setting, and are all derived using sophisticated information theoretic techniques. In this paper, we focus on the most basic problem in the setting of communication over an entanglement-assisted quantum channel, that of communicating classical bits from one party to another. We derive optimal bounds on the number of quantum bits required for this task, for any given probability of error.

IEEE Conference on Computational Complexity (CCC)•Jun 25, 2003•10 citations

On communication over an entanglement-assisted quantum channel

Ashwin Nayak, Julia Salzman

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as "quantum teleportation" and "superdense coding."The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.

ACM Symposium on Theory of Computing (STOC)•Jan 1, 2002•28 citations

On communication over an entanglement-assisted quantum channel

Ashwin Nayak, Julia Salzman

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as ``quantum teleportation'' and ``superdense coding.'' The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.

arXiv:quant-ph/0206122•Jun 19, 2002•4 citations

On communication over an entanglement-assisted quantum channel. (arXiv:quant-ph/0206122v1 CROSS LISTED)

Ashwin Nayak, Julia Salzman

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as ``quantum teleportation'' and ``superdense coding.'' The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.

•Mar 21, 2018•0 citations
Communication using quantum channels generally requires encoding and decoding on many identical uses of a quantum channel. In practical settings, decoherence may severely limit our ability to do so, potentially rendering each channel use nonidentical. Given nnn nonidentical channels, we present an entanglement-assisted encoding and decoding strategy that yields a channel with higher worst-case fidelity than all of the nnn given channels. The strategy is universal, in the sense that the improvement holds regardless of what channels are given, as long as they satisfy mild assumptions on their initial entanglement fidelities. Our protocol is optimal when the given channels are depolarizing channels, and is essentially the unique one that is universal. This idea can also be extended to classical channels, where shared randomness between the sender and the receiver allows universal enhancement of the probability of correct transmission. We then consider general quantum resource theories, providing a necessary condition and a sufficient condition for the possibility of such universal improvement of quantum resources.
The paper asks whether a fixed protocol can combine unknown, nonidentical quantum channels into one whose worst-case fidelity exceeds that of every input channel, without additional communication. It considers probabilistic encoding and decoding with preshared entanglement, assuming independent channel uses represented by a tensor product.
For n≥2n\geq2n≥2 channels of dimension ddd, with entanglement fidelities fi∈(1/d2,1)f_i\in(1/d^2,1)fi​∈(1/d2,1), the protocol produces a heralded output channel with worst-case fidelity Fout=∏ifi/PF_{\mathrm{out}}=\prod_i f_i/PFout​=∏i​fi​/P, where P=∏ifi+(d2−1)1−n∏i(1−fi)P=\prod_i f_i+(d^2-1)^{1-n}\prod_i(1-f_i)P=∏i​fi​+(d2−1)1−n∏i​(1−fi​) is its input-state-independent success probability. This exceeds every fif_ifi​, hence every input’s worst-case fidelity. The construction first twirls each channel to a depolarizing channel, then combines teleportation, superdense coding of the teleportation outcome, and error detection accepting only matching decoded outcomes. Two qubit channels with f1=0.9f_1=0.9f1​=0.9 and f2=0.8f_2=0.8f2​=0.8 yield fidelity approximately 0.9910.9910.991 with probability 0.7270.7270.727.
Projective-robustness bounds establish optimal output fidelity for depolarizing inputs even under no-signaling assistance; success-probability optimality and uniqueness up to twirling and rescaling are established for two inputs. A shared-randomness classical analogue replaces d2d^2d2 by ddd. General resource-theoretic results give sufficient and near-necessary conditions involving free twirling, multiplicativity of projective robustness, and standard versus generalized robustness.
The guarantees concern conditional fidelity, not deterministic transmission or communication rate, and consume preshared entanglement. General resource-theory applicability requires checking the stated structural conditions; physical entanglement-assisted implementability is explicitly constructed for communication.
One of the primary goals of information theory is to provide limits on the amount of information one can send through communication channels, and to understand encoding methods that achieve such limits. The discovery of dense coding showed that quantum channels can transmit twice as much classical information than is possible with a classical channel. This optimal rate requires using quantum systems maximally entangled between sender and receiver, and then the sender can encode her messages using unitary operations. The use of nonmaximally entangled systems has been intensively studied in recent years, and it has appeared as though unitary encoding might well be optimal in all cases. Indeed, this optimality of unitary operations has been found to hold under far more general conditions. Nonetheless, we here present numerical evidence supported by analytical arguments that there exist circumstances where more classical information can be encoded using nonunitary, rather than unitary, operations.
This paper presents a novel approach to quantum information coding and decoding leveraging the unique properties of quantum entanglement. The core idea is to develop a self-adaptive system capable of dynamically adjusting encoding and decoding parameters based on the observed noise levels and channel losses within the quantum channel. This adaptive strategy aims to significantly improve the efficiency and reliability of quantum information transmission. The proposed framework utilizes a quantum decoherence model to accurately represent channel losses and employs an optimization algorithm rooted in quantum control theory to optimize the generation and measurement strategies of entangled states in real-time. The algorithm's objective is to minimize information loss. The key innovation lies in the system's ability to respond in real-time to fluctuating channel conditions, moving beyond the limitations of static encoding/decoding schemes commonly employed in existing quantum communication protocols. Mathematical models and formulations are presented to illustrate the design and optimization process, focusing on key performance metrics such as channel capacity and fidelity. The system's potential impact on future quantum communication networks is discussed.
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols: the two parties may be given some number of quantum bits jointly prepared in a fixed superposition, prior to communicating with each other. The quantum channel is then said to be "entanglement-assisted." Shared randomness does not help in the transmission of information from one party to another. Moreover, it does not significantly reduce the classical complexity of computing functions vis-a-vis private-coin protocols. On the other hand, prior entanglement leads to startling phenomena such as "quantum teleportation" and "superdense coding." The problem of characterising the power of prior entanglement has baffled many researchers, especially in the setting of bounded-error protocols. It is open whether it leads to more than a factor of two savings (using superdense coding) or more than an additive O(log) savings (when used to create shared randomness). Few lower bounds are known for communication problems in this setting, and are all derived using sophisticated information theoretic techniques. In this paper, we focus on the most basic problem in the setting of communication over an entanglement-assisted quantum channel, that of communicating classical bits from one party to another. We derive optimal bounds on the number of quantum bits required for this task, for any given probability of error.
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as "quantum teleportation" and "superdense coding."The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as ``quantum teleportation'' and ``superdense coding.'' The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as ``quantum teleportation'' and ``superdense coding.'' The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.