Private Classical Communication over Quantum Multiple-Access Channels
- URL: http://arxiv.org/abs/2201.11899v1
- Date: Fri, 28 Jan 2022 02:23:50 GMT
- Title: Private Classical Communication over Quantum Multiple-Access Channels
- Authors: Remi A. Chou
- Abstract summary: We study private classical communication over quantum multiple-access channels.
We decouple the reliability and privacy constraints, which are handled via source coding with quantum side information and universal hashing.
- Score: 5.203329540700176
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study private classical communication over quantum multiple-access
channels. For an arbitrary number of transmitters, we derive a regularized
expression of the capacity region. In the case of degradable channels, we
establish a single-letter expression for the best achievable sum-rate and prove
that this quantity also corresponds to the best achievable sum-rate for quantum
communication over degradable quantum multiple-access channels. In our
achievability result, we decouple the reliability and privacy constraints,
which are handled via source coding with quantum side information and universal
hashing, respectively. Hence, we also establish that the multi-user coding
problem under consideration can be handled solely via point-to-point coding
techniques. As a by-product of independent interest, we derive a distributed
leftover hash lemma against quantum side information that ensures privacy in
our achievability result.
Related papers
- Unextendible entanglement of quantum channels [4.079147243688764]
We study the ability of quantum channels to perform quantum communication tasks.
A quantum channel can distill a highly entangled state between two parties.
We generalize the formalism of $k$-extendibility to bipartite superchannels.
arXiv Detail & Related papers (2024-07-22T18:00:17Z) - Experimental Quantum Byzantine Agreement on a Three-User Quantum Network with Integrated Photonics [13.10577231578478]
Building quantum communication networks in a scalable and cost-effective way is essential for their widespread adoption.
Here, we establish a polarization entanglement-based fully connected network, which features an ultrabright integrated Bragg reflection waveguide quantum source.
We provide the first experimental implementation of source-independent quantum digital signatures using imperfect keys circumventing the necessity for private amplification.
arXiv Detail & Related papers (2024-03-18T03:29:18Z) - Guarantees on the structure of experimental quantum networks [109.08741987555818]
Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing.
As these networks grow in size, certification tools will be required to answer questions regarding their properties.
We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
arXiv Detail & Related papers (2024-03-04T19:00:00Z) - Harnessing Coding Theory for Reliable Network Quantum Communication [7.469588051458094]
We review repeater-based quantum networks, emphasizing the roles of coding theory and fault-tolerant quantum operations.
We highlight that fault-tolerant implementation of the Bell measurement enables reliable quantum communication without requiring a universal set of quantum gates.
arXiv Detail & Related papers (2024-02-29T17:32:08Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Exact solution for the quantum and private capacities of bosonic
dephasing channels [10.787390511207686]
We provide the first exact calculation of the quantum, private, two-way assisted quantum, and secret-key capacities of bosonic dephasing channels.
arXiv Detail & Related papers (2022-05-11T19:12:12Z) - Commitment capacity of classical-quantum channels [70.51146080031752]
We define various notions of commitment capacity for classical-quantum channels.
We prove matching upper and lower bound on it in terms of the conditional entropy.
arXiv Detail & Related papers (2022-01-17T10:41:50Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Explicit construction of optimal witnesses for input-output correlations
attainable by quantum channels [3.441021278275805]
We consider the problem of characterizing the set of classical noisy channels that can be obtained from a quantum channel.
We consider various classes of linear witnesses and compute their optimum values in closed form for several classes of quantum channels.
The witnesses that we consider here are formulated as communication games, in which Alice's aim is to exploit a single use of a given quantum channel to help Bob guess some information she has received from an external referee.
arXiv Detail & Related papers (2020-09-02T07:34:23Z) - Permutation Enhances Classical Communication Assisted by Entangled
States [67.12391801199688]
We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication.
As examples, we derive analytically the classical capacity of various quantum channels of interests.
arXiv Detail & Related papers (2020-01-07T01:49:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.