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

International Journal of Quantum Information

An achievable rate for private classical information over a quantum broadcast channel

Alireza Nadem Ghazvini, Seyed Vahab Al‐Din Makki, Shahpoor Alirezaee

Published Feb 1, 2015• 1 citation
Publisher

Abstract

The rate region for transmission of classical information over a quantum broadcast channel and an inner bound for the rate of transmission of private classical information over a single-user quantum channel have been achieved in the previous paper. In this work, we extended the proofs of them to obtain an achievable private classical capacity for a two receivers quantum broadcast channel.

DOI
10.1142/s0219749915500057

Related papers

One-shot capacity bounds on the simultaneous transmission of classical and quantum information

Salek, F, Anshu, A, Min-Hsiu Hsieh +2 more

© 1963-2012 IEEE. We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work, we investigate the one-shot capabilities of a quantum channel for simultaneously transmitting bits and qubits. This problem was studied in the asymptotic regime for a memoryless channel where a regularized characterization of the capacity region was reported. It is known that the transmission of private classical information is closely related to the problem of quantum information transmission. We resort to this idea and find achievable and converse bounds on the simultaneous transmission of the public and private classical information. Then shifting the classical private rate to the quantum information rate leads to a rate region for simultaneous transmission of classical and quantum information. In the case of asymptotic i.i.d. setting, our one-shot result is evaluated to the known results in the literature. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.

•Apr 1, 2020•12 citations

One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels

Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh +2 more

We aim to study the optimal rates of transmission of public and private classical information over a quantum channel in the most general channel model. To this end, we discuss a scenario in which a quantum channel is being used only once, i.e., one-shot regime is considered. A quantum channel can be used to send classical information (bits) either publicly or privately and for either case, one-shot bounds have been reported in the literature. This paper investigates the one-shot capacity capabilities of a quantum channel for simultaneous transmission of public and private information. We derive an achievable rate region in the form of a tradeoff between public and private rates. We also provide converse bounds assessing the tightness of our achievable rates. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•13 citations

One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information

Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh +2 more

We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work, we investigate the one-shot capabilities of a quantum channel for simultaneously transmitting bits and qubits. This problem was studied in the asymptotic regime for a memoryless channel where a regularized characterization of the capacity region was reported. It is known that the transmission of private classical information is closely related to the problem of quantum information transmission. We resort to this idea and find achievable and converse bounds on the simultaneous transmission of the public and private classical information. Then shifting the classical private rate to the quantum information rate leads to a rate region for simultaneous transmission of classical and quantum information. In the case of asymptotic i.i.d. setting, our one-shot result is evaluated to the known results in the literature. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.

arXiv:1809.07104•IEEE Transactions on Information Theory•Oct 7, 2019•12 citations

An Achievable Rate Region for 3-User Classical-Quantum Broadcast Channels

Arun Padakandla

We consider the scenario of communicating on a 3-user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a new coding scheme based partitioned coset codes - an ensemble of codes possessing algebraic properties. Analyzing its information-theoretic performance, we characterize a new inner bound. We identify examples for which the derived inner bound is strictly larger than that achievable using IID random codes.

IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•4 citations

An improved rate region for the classical-quantum broadcast channel

Christoph Hirche, Ciara Morgan

We present a new achievable rate region for the two-user binary-input classical-quantum broadcast channel. The result is a generalization of the classical Marton-Gelfand-Pinsker region and is provably larger than the best previously known rate region for classical-quantum broadcast channels. The proof of achievability is based on the recently introduced polar coding scheme and its generalization to quantum network information theory.

arXiv:1501.07417•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•13 citations

An Achievable Rate Region for $3-$User Classical-Quantum Broadcast Channels

Gouiaa, Fatma, Padakandla, Arun

We consider the scenario of communicating on a $3\mhyphen$user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a new coding scheme based \textit{partitioned coset codes} - an ensemble of codes possessing algebraic properties. Analyzing its information-theoretic performance, we characterize a new inner bound. We identify examples for which the derived inner bound is strictly larger than that achievable using IID random codes. Proceeding further, we incorporate Sen's technique of tilting smoothing and augmentation to perform simultaneous decoding via a simultaneous decoding POVM and thereby characterize a further enlarged achievable rate region for communicating classical bits over the $3-$user classical-quantum broadcast channel. Finally, in our last step, we characterize a new inner bound to the classical-quantum capacity region of the $3-$user classical-quantum broadcast channel that subsumes all previous known inner bounds by combining the conventional unstructured IID codes with structured coset code strategies.

arXiv:2203.00110•Feb 28, 2022•0 citations
The rate region for transmission of classical information over a quantum broadcast channel and an inner bound for the rate of transmission of private classical information over a single-user quantum channel have been achieved in the previous paper. In this work, we extended the proofs of them to obtain an achievable private classical capacity for a two receivers quantum broadcast channel.
© 1963-2012 IEEE. We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work, we investigate the one-shot capabilities of a quantum channel for simultaneously transmitting bits and qubits. This problem was studied in the asymptotic regime for a memoryless channel where a regularized characterization of the capacity region was reported. It is known that the transmission of private classical information is closely related to the problem of quantum information transmission. We resort to this idea and find achievable and converse bounds on the simultaneous transmission of the public and private classical information. Then shifting the classical private rate to the quantum information rate leads to a rate region for simultaneous transmission of classical and quantum information. In the case of asymptotic i.i.d. setting, our one-shot result is evaluated to the known results in the literature. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.
We aim to study the optimal rates of transmission of public and private classical information over a quantum channel in the most general channel model. To this end, we discuss a scenario in which a quantum channel is being used only once, i.e., one-shot regime is considered. A quantum channel can be used to send classical information (bits) either publicly or privately and for either case, one-shot bounds have been reported in the literature. This paper investigates the one-shot capacity capabilities of a quantum channel for simultaneous transmission of public and private information. We derive an achievable rate region in the form of a tradeoff between public and private rates. We also provide converse bounds assessing the tightness of our achievable rates. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.
We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work, we investigate the one-shot capabilities of a quantum channel for simultaneously transmitting bits and qubits. This problem was studied in the asymptotic regime for a memoryless channel where a regularized characterization of the capacity region was reported. It is known that the transmission of private classical information is closely related to the problem of quantum information transmission. We resort to this idea and find achievable and converse bounds on the simultaneous transmission of the public and private classical information. Then shifting the classical private rate to the quantum information rate leads to a rate region for simultaneous transmission of classical and quantum information. In the case of asymptotic i.i.d. setting, our one-shot result is evaluated to the known results in the literature. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.
We consider the scenario of communicating on a 3-user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a new coding scheme based partitioned coset codes - an ensemble of codes possessing algebraic properties. Analyzing its information-theoretic performance, we characterize a new inner bound. We identify examples for which the derived inner bound is strictly larger than that achievable using IID random codes.
An Achievable Rate Region for 3−3-3−User Classical-Quantum Broadcast Channels
We consider the scenario of communicating on a $3\mhyphen$user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a new coding scheme based \textit{partitioned coset codes} - an ensemble of codes possessing algebraic properties. Analyzing its information-theoretic performance, we characterize a new inner bound. We identify examples for which the derived inner bound is strictly larger than that achievable using IID random codes. Proceeding further, we incorporate Sen's technique of tilting smoothing and augmentation to perform simultaneous decoding via a simultaneous decoding POVM and thereby characterize a further enlarged achievable rate region for communicating classical bits over the 3−3-3−user classical-quantum broadcast channel. Finally, in our last step, we characterize a new inner bound to the classical-quantum capacity region of the 3−3-3−user classical-quantum broadcast channel that subsumes all previous known inner bounds by combining the conventional unstructured IID codes with structured coset code strategies.