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

Iranian Conference on Electrical Engineering

Entanglement-Assisted Classical-Quantum Multiple Access Wiretap Channel: One-shot Achievable Rate Region

Hadi Aghaee, Bahareh Akhbari

Published May 17, 2022• 2 citations
Publisher

Abstract

In this paper, the problem of secure communication over an entanglement-assisted classical-quantum multiple access channel is studied under one-shot setting. The main employed approach to this end, is combination of simultaneous decoding and position-based decoding techniques while a recently introduced approach is used to calculate leaked information.

DOI
10.1109/icee55646.2022.9827277

Related papers

Private Classical Information over a Quantum Multiple Access Channel: One-Shot Secrecy Rate Region

Hadi Aghaee, Bahareh Akhbari

In this paper, the problem of private communication of classical messages over a quantum multiple access channel under one-shot setting is studied. In this regard, we first introduce general quantum multiple access wiretap channel, and then we calculate an achievable secrecy rate region for the main channel. The encoding process follows the combination of the superposition and Wyner wiretap coding schemes, and the decoding technique is based on the simultaneous decoder and convex splitting. At last, we extend the results to the l-user case.

International Symposium on Telecommunications•Dec 15, 2020•5 citations

Classical-Quantum Multiple Access Channel with Secrecy Constraint: One-Shot Rate Region

Hadi Aghaee, Bahareh Akhbari

In this paper, we aim to study a -user quantum multiple access wiretap channel with an arbitrary number of wiretappers under one-shot setting. In this regard, we first introduce the general quantum multiple access wiretap channel and the simplified proposed channel. Then, we calculate an achievable secrecy rate region for the main channel with two users. The encoding process uses the superposition and wiretap coding techniques, and the decoding technique is based on the simultaneous decoder. Also, Convex splitting is used to satisfy security requirements. At last, we extend the results to the l-user case.

International Journal of Information & Communication Technology Research•Apr 1, 2020•2 citations

Quantum Multiple Access Wiretap Channel: On the One-Shot Achievable Secrecy Rate Regions

Hadi Aghaee, Bahareh Akhbari

In this paper, we want to investigate classical-quantum multiple access wiretap channels (CQ-MA-WTC) under one-shot setting. In this regard, we analyze the CQ-MA-WTC using simultaneous position-based decoder for reliable decoding and using a newly introduced technique in order to decode securely. Also, for the sake of comparison, we analyze the CQ-MA-WTC using Sen's one-shot joint typicality lemma for reliable decoding. The simultaneous position-based decoder tends to a multiple hypothesis testing problem. Also, using convex splitting to analyze the privacy criteria in a simultaneous scenario becomes problematic. To overcome both problems, we first introduce a new channel that can be considered as a dual to the CQ-MA-WTC. This channel is called a point-to-point quantum wiretap channel with multiple messages (PP-QWTC). In the following, as a strategy to solve the problem, we also investigate and analyze quantum broadcast channels (QBCs) under the one-shot setting.

arXiv:2301.02479•Jan 6, 2023•0 citations

One-Shot Achievable Secrecy Rate Regions for Quantum Interference Wiretap Channel

Hadi Aghaee, Bahareh Akhbari

In this paper, we want to derive achievable secrecy rate regions for quantum interference channel with classical inputs under one-shot setting. The main idea to this end is to use the combination of superposition and rate splitting for encoding scheme and constructing a decoding scheme based on simultaneous decoding.

arXiv:2301.03375•Jan 9, 2023•0 citations

Applications of position-based coding to classical communication over quantum channels

Haoyu Qi, Qingle Wang, Mark M. Wilde

Abstract Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in the entanglement-assisted setting in order to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds. We also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine achievable rate regions for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.

arXiv:1704.01361•Journal of Physics A Mathematical and Theoretical•Sep 19, 2018•54 citations

Applications of position-based coding to classical communication over quantum channels

Haoyu Qi, Qingle Wang, Mark M. Wilde

We exploit a coding technique called position-based coding in the entanglement-assisted setting to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds, and we also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine an achievable rate region for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.

IEEE Information Theory Workshop (ITW)•Nov 1, 2017•10 citations
In this paper, the problem of secure communication over an entanglement-assisted classical-quantum multiple access channel is studied under one-shot setting. The main employed approach to this end, is combination of simultaneous decoding and position-based decoding techniques while a recently introduced approach is used to calculate leaked information.
In this paper, the problem of private communication of classical messages over a quantum multiple access channel under one-shot setting is studied. In this regard, we first introduce general quantum multiple access wiretap channel, and then we calculate an achievable secrecy rate region for the main channel. The encoding process follows the combination of the superposition and Wyner wiretap coding schemes, and the decoding technique is based on the simultaneous decoder and convex splitting. At last, we extend the results to the l-user case.
In this paper, we aim to study a -user quantum multiple access wiretap channel with an arbitrary number of wiretappers under one-shot setting. In this regard, we first introduce the general quantum multiple access wiretap channel and the simplified proposed channel. Then, we calculate an achievable secrecy rate region for the main channel with two users. The encoding process uses the superposition and wiretap coding techniques, and the decoding technique is based on the simultaneous decoder. Also, Convex splitting is used to satisfy security requirements. At last, we extend the results to the l-user case.
In this paper, we want to investigate classical-quantum multiple access wiretap channels (CQ-MA-WTC) under one-shot setting. In this regard, we analyze the CQ-MA-WTC using simultaneous position-based decoder for reliable decoding and using a newly introduced technique in order to decode securely. Also, for the sake of comparison, we analyze the CQ-MA-WTC using Sen's one-shot joint typicality lemma for reliable decoding. The simultaneous position-based decoder tends to a multiple hypothesis testing problem. Also, using convex splitting to analyze the privacy criteria in a simultaneous scenario becomes problematic. To overcome both problems, we first introduce a new channel that can be considered as a dual to the CQ-MA-WTC. This channel is called a point-to-point quantum wiretap channel with multiple messages (PP-QWTC). In the following, as a strategy to solve the problem, we also investigate and analyze quantum broadcast channels (QBCs) under the one-shot setting.
Abstract Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in the entanglement-assisted setting in order to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds. We also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine achievable rate regions for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.
We exploit a coding technique called position-based coding in the entanglement-assisted setting to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds, and we also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine an achievable rate region for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Rényi-two entropies and conditional quantum entropies.