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:2208.12016 · IEEE Transactions on Information Theory

Quantum Multiple-Access One-Time Pad

Eyuri Wakakuwa

Published Sep 29, 2023• 4 citations
arXivHTMLPDF

Abstract

We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. Here, a number of senders initially share a correlated quantum state with a receiver and an eavesdropper. Each sender performs a local operation to encode a classical message and sends their system to the receiver, who subsequently performs a measurement to decode the messages. The receiver will be able to decode the messages almost perfectly, while the eavesdropper must not be able to extract information about the messages even if they have access to the quantum systems transmitted. We consider a “conditional” scenario in which a portion of the receiver’s side information is also accessible to the eavesdropper. We investigate the maximum amount of classical information that can be encoded by each of the senders. We derive a single-letter characterization for the achievable rate region in an asymptotic limit of infinitely many copies and vanishingly small error.

DOI
10.1109/tit.2023.3320678

Related papers

One-shot inner bounds for quantum multiple-access one-time pad

CHENG Feiran, LIU Xiaoming, Zhengjun Xi

We consider the one-shot coding of multiple access channels one-time pad. Suppose that the senders and the receiver share an entangled state in the multi-party systems. Using the position-based coding, each sender encodes the classical messages on their systems, then they transmit their systems over the ideal quantum channels. The receiver applies a decoding operator to all the systems in order to figure out which message was transmitted with respect to the quantum joint typicality lemma. We provide the upper bound of the information leakage by the convex split lemma. Combining quantum max-information with quantum hypothesis testing mutual information, we give the inner bound of the achievable rate.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Feb 27, 2025•0 citations

Conditional Quantum One-Time Pad

Kunal Sharma, Eyuri Wakakuwa, Mark M. Wilde

Suppose that Alice and Bob are located in distant laboratories, which are connected by an ideal quantum channel. Suppose further that they share many copies of a quantum state ρ_{ABE}, such that Alice possesses the A systems and Bob the BE systems. In our model, there is an identifiable part of Bob's laboratory that is insecure: a third party named Eve has infiltrated Bob's laboratory and gained control of the E systems. Alice, knowing this, would like use their shared state and the ideal quantum channel to communicate a message in such a way that Bob, who has access to the whole of his laboratory (BE systems), can decode it, while Eve, who has access only to a sector of Bob's laboratory (E systems) and the ideal quantum channel connecting Alice to Bob, cannot learn anything about Alice's transmitted message. We call this task the conditional one-time pad, and in this Letter, we prove that the optimal rate of secret communication for this task is equal to the conditional quantum mutual information I(A;B|E) of their shared state. We thus give the conditional quantum mutual information an operational meaning that is different from those given in prior works, via state redistribution, conditional erasure, or state deconstruction. We also generalize the model and method in several ways, one of which is a secret-sharing task, i.e., the case in which Alice's message should be secure from someone possessing only the AB or AE systems, but should be decodable by someone possessing all systems A, B, and E.

arXiv:1703.02903•Physical Review Letters•Feb 7, 2020•25 citations

Capacity theorems for quantum multiple access channels

Jon Yard, I. Devetak, Patrick M. Hayden

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible for one sender to send classical information while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel for which each region has a single-letter description, concluding with a characterization of the rates at which each user can simultaneously send classical and quantum information

arXiv:cs/0508031•IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•17 citations

Simultaneous classical-quantum capacities of quantum multiple access channels

Jon Yard

The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized. Two main results are proved in detail. The first describes the region of rates at which one sender can send classical information while the other sends quantum information. The second describes those rates at which both senders can send quantum information. For each of these situations, an example of a channel is given for which the associated region admits a single-letter description. This is the author's Ph.D. dissertation, submitted to the Department of Electrical Engineering at Stanford University in March, 2005. It represents an expanded version of the paper quant-ph/0501045, containing a number of tutorial chapters which may be of independent interest for those learning about quantum Shannon theory.

arXiv:quant-ph/0506050•Jun 6, 2005•32 citations

Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions

Jon Yard, Patrick M. Hayden, Igor Devetak

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multiletter characterizations of two different two-dimensional capacity regions. The first region comprises the rates at which it is possible for one sender to send classical information, while the other sends quantum information. The second region consists of the rates at which each sender can send quantum information. For each region, we give an example of a channel for which the corresponding region has a single-letter description. One of our examples relies on a new result proved here, perhaps of independent interest, stating that the coherent information over any degradable channel is concave in the input density operator. We conclude with connections to other work and a discussion on generalizations where each user simultaneously sends classical and quantum information.

arXiv:quant-ph/0501045•IEEE Transactions on Information Theory•Jun 16, 2008•125 citations

Quantum Wiretap Channel Coding Assisted by Noisy Correlation

Minglai Cai, Andreas Winter

We consider the private classical capacity of a quantum wiretap channel, where the users (sender Alice, receiver Bob, and eavesdropper Eve) have access to the resource of a shared quantum state, additionally to their channel inputs and outputs. An extreme case is maximal entanglement or a secret key between Alice and Bob, both of which would allow for one-time padding the message. But here both the wiretap channel and the shared state are general. In the other extreme case that the state is trivial, we recover the wiretap channel and its private capacity [N. Cai, A. Winter and R. W. Yeung, Probl. Inform. Transm. 40(4):318-336, 2004]. We show how to use the given resource state to build a code for secret classical communication. Our main result is a lower bound on the assisted private capacity, which asymptotically meets the multi-letter converse and which encompasses all sorts of previous results as special cases.

arXiv:2402.13194•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•2 citations
We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. Here, a number of senders initially share a correlated quantum state with a receiver and an eavesdropper. Each sender performs a local operation to encode a classical message and sends their system to the receiver, who subsequently performs a measurement to decode the messages. The receiver will be able to decode the messages almost perfectly, while the eavesdropper must not be able to extract information about the messages even if they have access to the quantum systems transmitted. We consider a “conditional” scenario in which a portion of the receiver’s side information is also accessible to the eavesdropper. We investigate the maximum amount of classical information that can be encoded by each of the senders. We derive a single-letter characterization for the achievable rate region in an asymptotic limit of infinitely many copies and vanishingly small error.
We consider the one-shot coding of multiple access channels one-time pad. Suppose that the senders and the receiver share an entangled state in the multi-party systems. Using the position-based coding, each sender encodes the classical messages on their systems, then they transmit their systems over the ideal quantum channels. The receiver applies a decoding operator to all the systems in order to figure out which message was transmitted with respect to the quantum joint typicality lemma. We provide the upper bound of the information leakage by the convex split lemma. Combining quantum max-information with quantum hypothesis testing mutual information, we give the inner bound of the achievable rate.
Suppose that Alice and Bob are located in distant laboratories, which are connected by an ideal quantum channel. Suppose further that they share many copies of a quantum state ρ_{ABE}, such that Alice possesses the A systems and Bob the BE systems. In our model, there is an identifiable part of Bob's laboratory that is insecure: a third party named Eve has infiltrated Bob's laboratory and gained control of the E systems. Alice, knowing this, would like use their shared state and the ideal quantum channel to communicate a message in such a way that Bob, who has access to the whole of his laboratory (BE systems), can decode it, while Eve, who has access only to a sector of Bob's laboratory (E systems) and the ideal quantum channel connecting Alice to Bob, cannot learn anything about Alice's transmitted message. We call this task the conditional one-time pad, and in this Letter, we prove that the optimal rate of secret communication for this task is equal to the conditional quantum mutual information I(A;B|E) of their shared state. We thus give the conditional quantum mutual information an operational meaning that is different from those given in prior works, via state redistribution, conditional erasure, or state deconstruction. We also generalize the model and method in several ways, one of which is a secret-sharing task, i.e., the case in which Alice's message should be secure from someone possessing only the AB or AE systems, but should be decodable by someone possessing all systems A, B, and E.
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible for one sender to send classical information while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel for which each region has a single-letter description, concluding with a characterization of the rates at which each user can simultaneously send classical and quantum information
The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized. Two main results are proved in detail. The first describes the region of rates at which one sender can send classical information while the other sends quantum information. The second describes those rates at which both senders can send quantum information. For each of these situations, an example of a channel is given for which the associated region admits a single-letter description. This is the author's Ph.D. dissertation, submitted to the Department of Electrical Engineering at Stanford University in March, 2005. It represents an expanded version of the paper quant-ph/0501045, containing a number of tutorial chapters which may be of independent interest for those learning about quantum Shannon theory.
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multiletter characterizations of two different two-dimensional capacity regions. The first region comprises the rates at which it is possible for one sender to send classical information, while the other sends quantum information. The second region consists of the rates at which each sender can send quantum information. For each region, we give an example of a channel for which the corresponding region has a single-letter description. One of our examples relies on a new result proved here, perhaps of independent interest, stating that the coherent information over any degradable channel is concave in the input density operator. We conclude with connections to other work and a discussion on generalizations where each user simultaneously sends classical and quantum information.
We consider the private classical capacity of a quantum wiretap channel, where the users (sender Alice, receiver Bob, and eavesdropper Eve) have access to the resource of a shared quantum state, additionally to their channel inputs and outputs. An extreme case is maximal entanglement or a secret key between Alice and Bob, both of which would allow for one-time padding the message. But here both the wiretap channel and the shared state are general. In the other extreme case that the state is trivial, we recover the wiretap channel and its private capacity [N. Cai, A. Winter and R. W. Yeung, Probl. Inform. Transm. 40(4):318-336, 2004]. We show how to use the given resource state to build a code for secret classical communication. Our main result is a lower bound on the assisted private capacity, which asymptotically meets the multi-letter converse and which encompasses all sorts of previous results as special cases.