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:quant-ph/9805067

The broadcast quantum channel for classical information transmission

ARMEN E. ALLAHVERDYAN, David B. Saakian

Published May 22, 1998• 7 citations
arXivHTMLPDF

Abstract

It is well known that quantum theory forbids the exact copying of an unknown quantum state. Therefore in broadcasting of classical information by a quantum channel an additional contribution to the error in the decoding is expected. We consider the optimal copying transformation which is adapted to classical information transmission by two linearly independent quantum states, and show that there is no additional contribution to the error. Instead the clones are correlated, and this breaks their usefulness: The entanglement increases with non-orthogonality of the states. The capacity of the corresponding quantum channel is considered also.

DOI
10.48550/arxiv.quant-ph/9805067

Related papers

Broadcast of classical information through a quantum channel

ARMEN E. ALLAHVERDYAN, David B. Saakian

We consider transmission of classical information through a quantum channel from one sender to several receivers. In contrast to quantum information, classical information carried by two non-orthogonal states of a quantum system can be cloned exactly. This restricts a naive extrapolation of the standard no-cloning theorem. The optimal cloning induces entanglement between clones which increases with non-orthogonality of the states. The capacity of the corresponding quantum channel is considered. As a byproduct of our results, we obtain that for an entangled system with an unknown state there is no transformation which removes the entanglement totally without affecting the corresponding marginal density matrices.

Europhysics Letters (EPL)•Jun 15, 2000•1 citation

Quantum Broadcast Channels

Jon Yard, Patrick M. Hayden, Igor Devetak

We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a classical input to give a general achievable region. We also give outer bounds to the capacity regions for various special cases from the classical literature and prove that superposition coding is optimal for a class of channels. We then consider extensions of superposition coding for channels with a quantum input, where some of the messages transmitted are quantum instead of classical, in the sense that the parties establish bipartite or tripartite GHZ entanglement. We conclude by using state merging to give achievable rates for establishing bipartite entanglement between different pair of parties with the assistance of free classical communication.

arXiv:quant-ph/0603098•IEEE Transactions on Information Theory•Oct 1, 2011•116 citations

A stronger no-cloning theorem

Richard Jozsa

It is well known that (non-orthogonal) pure states cannot be cloned so one may ask: how much or what kind of additional (quantum) information is needed to supplement one copy of a quantum state in order to be able to produce two copies of that state by a physical operation? For classical information, no supplementary information is required. However for pure quantum (non-orthogonal) states, we show that the supplementary information must always be as large as it can possibly be i.e. the clone must be able to be generated from the additional information alone, independently of the first (given) copy.

arXiv:quant-ph/0204153•Apr 26, 2002•14 citations

Orthogonality broadcasting and quantum position verification

Ian George, Rene Allerstorfer, Philip Verduyn Lunel +1 more

Abstract The no-cloning theorem leads to information-theoretic security in various quantum cryptographic protocols. However, this security typically derives from a possibly weaker property that classical information encoded in certain quantum states cannot be broadcast. To formally capture this property, we introduce the study of ‘orthogonality broadcasting.’ When attempting to broadcast the orthogonality of two different qubit bases, we establish that the power of classical and quantum communication is equivalent. However, quantum communication is shown to be strictly more powerful for broadcasting orthogonality in higher dimensions. We then relate orthogonality broadcasting to quantum position verification and provide a new method for establishing error bounds in the no pre-shared entanglement model that can address protocols previous methods could not. Our key technical contribution is an uncertainty relation that uses the geometric relation of the states that undergo broadcasting rather than the non-commutative aspect of the final measurements.

arXiv:2311.00677•New Journal of Physics•May 1, 2025•1 citation

The Information-carrying capacity of certain quantum channels

Ciara Morgan

In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.

arXiv:1007.2723•Irish Mathematical Society Bulletin•Jan 1, 2010•1 citation

Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters

Uzi Pereg, Christian Deppe, Holger Boche

Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing. Another cooperation setting involves quantum conferencing, where Receiver 1 can teleport a quantum state to Receiver 2. The conferencing setting is intimately related to quantum repeaters, as the sender, Receiver 1, and Receiver 2 can be viewed as the transmitter, the repeater, and the destination receiver, respectively. We develop lower and upper bounds on the capacity region in each setting. At last, we show that as opposed to the MAC with entangled encoders, entanglement between decoders does not increase the classical communication rates for the broadcast dual.

IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•7 citations
It is well known that quantum theory forbids the exact copying of an unknown quantum state. Therefore in broadcasting of classical information by a quantum channel an additional contribution to the error in the decoding is expected. We consider the optimal copying transformation which is adapted to classical information transmission by two linearly independent quantum states, and show that there is no additional contribution to the error. Instead the clones are correlated, and this breaks their usefulness: The entanglement increases with non-orthogonality of the states. The capacity of the corresponding quantum channel is considered also.
We consider transmission of classical information through a quantum channel from one sender to several receivers. In contrast to quantum information, classical information carried by two non-orthogonal states of a quantum system can be cloned exactly. This restricts a naive extrapolation of the standard no-cloning theorem. The optimal cloning induces entanglement between clones which increases with non-orthogonality of the states. The capacity of the corresponding quantum channel is considered. As a byproduct of our results, we obtain that for an entangled system with an unknown state there is no transformation which removes the entanglement totally without affecting the corresponding marginal density matrices.
We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a classical input to give a general achievable region. We also give outer bounds to the capacity regions for various special cases from the classical literature and prove that superposition coding is optimal for a class of channels. We then consider extensions of superposition coding for channels with a quantum input, where some of the messages transmitted are quantum instead of classical, in the sense that the parties establish bipartite or tripartite GHZ entanglement. We conclude by using state merging to give achievable rates for establishing bipartite entanglement between different pair of parties with the assistance of free classical communication.
It is well known that (non-orthogonal) pure states cannot be cloned so one may ask: how much or what kind of additional (quantum) information is needed to supplement one copy of a quantum state in order to be able to produce two copies of that state by a physical operation? For classical information, no supplementary information is required. However for pure quantum (non-orthogonal) states, we show that the supplementary information must always be as large as it can possibly be i.e. the clone must be able to be generated from the additional information alone, independently of the first (given) copy.
Abstract The no-cloning theorem leads to information-theoretic security in various quantum cryptographic protocols. However, this security typically derives from a possibly weaker property that classical information encoded in certain quantum states cannot be broadcast. To formally capture this property, we introduce the study of ‘orthogonality broadcasting.’ When attempting to broadcast the orthogonality of two different qubit bases, we establish that the power of classical and quantum communication is equivalent. However, quantum communication is shown to be strictly more powerful for broadcasting orthogonality in higher dimensions. We then relate orthogonality broadcasting to quantum position verification and provide a new method for establishing error bounds in the no pre-shared entanglement model that can address protocols previous methods could not. Our key technical contribution is an uncertainty relation that uses the geometric relation of the states that undergo broadcasting rather than the non-commutative aspect of the final measurements.
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.
Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing. Another cooperation setting involves quantum conferencing, where Receiver 1 can teleport a quantum state to Receiver 2. The conferencing setting is intimately related to quantum repeaters, as the sender, Receiver 1, and Receiver 2 can be viewed as the transmitter, the repeater, and the destination receiver, respectively. We develop lower and upper bounds on the capacity region in each setting. At last, we show that as opposed to the MAC with entangled encoders, entanglement between decoders does not increase the classical communication rates for the broadcast dual.