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:1312.4989 · Physical Review Letters

Maximal Privacy without Coherence

Debbie Leung, Ke Li, Graeme Smith, John A. Smolin

Published Jul 16, 2014• 19 citations
arXivHTMLPDF

Abstract

Privacy is a fundamental feature of quantum mechanics. A coherently transmitted quantum state is inherently private. Remarkably, coherent quantum communication is not a prerequisite for privacy: there are quantum channels that are too noisy to transmit any quantum information reliably that can nevertheless send private classical information. Here, we ask how much private classical information a channel can transmit if it has little quantum capacity. We present a class of channels N(d) with input dimension d(2), quantum capacity Q(N(d)) ≤ 1, and private capacity P(N(d)) = log d. These channels asymptotically saturate an interesting inequality P(N) ≤ (1/2)[log d(A) + Q(N)] for any channel N with input dimension d(A) and capture the essence of privacy stripped of the confounding influence of coherence.

DOI
10.1103/physrevlett.113.030502

Related papers

Can Nonprivate Channels Transmit Quantum Information?

Graeme Smith, John A. Smolin

We study the power of quantum channels with little or no capacity for private communication. Because privacy is a necessary condition for quantum communication, one might expect that such channels would be of little use for transmitting quantum states. Nevertheless, we find strong evidence that there are pairs of such channels that, when used together, can transmit far more quantum information than the sum of their individual private capacities. Because quantum transmissions are necessarily private, this would imply a large violation of additivity for the private capacity. Specifically, we present channels which display either (1) a large joint quantum capacity but very small individual private capacities or (2) a severe violation of additivity for the Holevo information.

arXiv:0810.0276•Physical Review Letters•Jan 5, 2009•22 citations

Optimizing the fundamental limits for quantum and private communication

Xin Wang

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information coherently. In this paper, we derive single-letter upper bounds on the quantum and private capacities of quantum channels. The quantum capacity of a quantum channel is always no larger than the quantum capacity of its extended channels since the extensions of the channel can be considered as assistance from the environment. By optimizing the parametrized extended channels with specific structures such as the flag structure, we obtain new upper bounds on the quantum capacity of the original quantum channel. Furthermore, we extend our approach to estimating the fundamental limits of private communication and one-way entanglement distillation. As notable applications, we establish improved upper bounds to the quantum and private capacities for fundamental quantum channels of great interest in quantum information, some of which are also the sources of noise in superconducting quantum computing. In particular, our upper bounds on the quantum capacities of the depolarizing channel and the generalized amplitude damping channel are strictly better than previously best-known bounds.

•Dec 2, 2019•6 citations

Private communication via zero-private-capacity quantum channels

Chengkai Zhu, Xin Wang

Private communication over a noisy quantum channel requires reliable transmission to the receiver and secrecy from the environment. Whether two channels with zero private capacity can jointly enable private communication is a longstanding open problem in quantum information theory. Here we resolve this problem by exhibiting a four-level channel and a qubit erasure channel with half erasure probability, each with zero private capacity, whose joint use achieves more than 0.0001903 private bits per product use. The encoding gives the receiver a linear information gain with at most quadratic environmental leakage, enabling privacy through a fixed joint measurement and classical coding. This superactivation, impossible for independent classical memoryless wiretap channels, shows that a channel's private capacity alone does not determine its value for secure communication. The initial activation example was identified through interactions with large language models, and the result has been formalized in Lean 4.

quant-pharXiv:2609.10520•Sep 10, 2026•0 citations

The Private Classical Capacity and Quantum Capacity of a Quantum Channel

Igor Devetak

A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward public classical communication. Motivated by the work of Schumacher and Westmoreland on quantum privacy and quantum coherence, parallels between private classical information and quantum information are exploited to obtain an expression for the capacity of a quantum channel for generating pure bipartite entanglement. The latter implies a new proof of the quantum channel coding theorem and a simple proof of the converse. The coherent information plays a role in all of the above mentioned capacities

arXiv:quant-ph/0304127•IEEE Transactions on Information Theory•Jan 1, 2005•817 citations

Pursuing the Fundamental Limits for Quantum Communication

Xin Wang

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information coherently. In this paper, we derive single-letter upper bounds on the quantum and private capacities of quantum channels. The quantum capacity of a quantum channel is always no larger than the quantum capacity of its extended channels, since the extensions of the channel can be considered as assistance from the environment. By optimizing the parametrized extended channels with specific structures such as the flag structure, we obtain new upper bounds on the quantum capacity of the original quantum channel. Furthermore, we extend our approach to estimating the fundamental limits of private communication and one-way entanglement distillation. As notable applications, we establish improved upper bounds to the quantum and private capacities for fundamental quantum channels of interest in quantum information, some of which are also the sources of noise in superconducting quantum computing. In particular, our upper bounds on the quantum capacities of the depolarizing channel and the generalized amplitude damping channel are strictly better than previously best-known bounds for certain regimes.

arXiv:1912.00931•IEEE Transactions on Information Theory•Mar 24, 2021•22 citations

Extensive Nonadditivity of Privacy

Graeme Smith, John A. Smolin

Quantum information theory establishes the ultimate limits on communication and cryptography in terms of channel capacities for various types of information. The private capacity is particularly important because it quantifies achievable rates of quantum key distribution. We study the power of quantum channels with limited private capacity, focusing on channels that dephase in random bases. These display extensive nonadditivity of private capacity: a channel with 2logd input qubits that has a private capacity less than 2, but when used together with a second channel with zero private capacity, the joint capacity jumps to (1/2)logd. In contrast to earlier work which found nonadditivity vanishing as a fraction of input size or conditional on unproven mathematical assumptions, this provides a natural setting manifesting nonadditivity of privacy of the strongest possible sort.

arXiv:0904.4050•Physical Review Letters•Sep 18, 2009•57 citations
Privacy is a fundamental feature of quantum mechanics. A coherently transmitted quantum state is inherently private. Remarkably, coherent quantum communication is not a prerequisite for privacy: there are quantum channels that are too noisy to transmit any quantum information reliably that can nevertheless send private classical information. Here, we ask how much private classical information a channel can transmit if it has little quantum capacity. We present a class of channels N(d) with input dimension d(2), quantum capacity Q(N(d)) ≤ 1, and private capacity P(N(d)) = log d. These channels asymptotically saturate an interesting inequality P(N) ≤ (1/2)[log d(A) + Q(N)] for any channel N with input dimension d(A) and capture the essence of privacy stripped of the confounding influence of coherence.
We study the power of quantum channels with little or no capacity for private communication. Because privacy is a necessary condition for quantum communication, one might expect that such channels would be of little use for transmitting quantum states. Nevertheless, we find strong evidence that there are pairs of such channels that, when used together, can transmit far more quantum information than the sum of their individual private capacities. Because quantum transmissions are necessarily private, this would imply a large violation of additivity for the private capacity. Specifically, we present channels which display either (1) a large joint quantum capacity but very small individual private capacities or (2) a severe violation of additivity for the Holevo information.
The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information coherently. In this paper, we derive single-letter upper bounds on the quantum and private capacities of quantum channels. The quantum capacity of a quantum channel is always no larger than the quantum capacity of its extended channels since the extensions of the channel can be considered as assistance from the environment. By optimizing the parametrized extended channels with specific structures such as the flag structure, we obtain new upper bounds on the quantum capacity of the original quantum channel. Furthermore, we extend our approach to estimating the fundamental limits of private communication and one-way entanglement distillation. As notable applications, we establish improved upper bounds to the quantum and private capacities for fundamental quantum channels of great interest in quantum information, some of which are also the sources of noise in superconducting quantum computing. In particular, our upper bounds on the quantum capacities of the depolarizing channel and the generalized amplitude damping channel are strictly better than previously best-known bounds.
Private communication over a noisy quantum channel requires reliable transmission to the receiver and secrecy from the environment. Whether two channels with zero private capacity can jointly enable private communication is a longstanding open problem in quantum information theory. Here we resolve this problem by exhibiting a four-level channel and a qubit erasure channel with half erasure probability, each with zero private capacity, whose joint use achieves more than 0.0001903 private bits per product use. The encoding gives the receiver a linear information gain with at most quadratic environmental leakage, enabling privacy through a fixed joint measurement and classical coding. This superactivation, impossible for independent classical memoryless wiretap channels, shows that a channel's private capacity alone does not determine its value for secure communication. The initial activation example was identified through interactions with large language models, and the result has been formalized in Lean 4.
A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward public classical communication. Motivated by the work of Schumacher and Westmoreland on quantum privacy and quantum coherence, parallels between private classical information and quantum information are exploited to obtain an expression for the capacity of a quantum channel for generating pure bipartite entanglement. The latter implies a new proof of the quantum channel coding theorem and a simple proof of the converse. The coherent information plays a role in all of the above mentioned capacities
The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information coherently. In this paper, we derive single-letter upper bounds on the quantum and private capacities of quantum channels. The quantum capacity of a quantum channel is always no larger than the quantum capacity of its extended channels, since the extensions of the channel can be considered as assistance from the environment. By optimizing the parametrized extended channels with specific structures such as the flag structure, we obtain new upper bounds on the quantum capacity of the original quantum channel. Furthermore, we extend our approach to estimating the fundamental limits of private communication and one-way entanglement distillation. As notable applications, we establish improved upper bounds to the quantum and private capacities for fundamental quantum channels of interest in quantum information, some of which are also the sources of noise in superconducting quantum computing. In particular, our upper bounds on the quantum capacities of the depolarizing channel and the generalized amplitude damping channel are strictly better than previously best-known bounds for certain regimes.
Quantum information theory establishes the ultimate limits on communication and cryptography in terms of channel capacities for various types of information. The private capacity is particularly important because it quantifies achievable rates of quantum key distribution. We study the power of quantum channels with limited private capacity, focusing on channels that dephase in random bases. These display extensive nonadditivity of private capacity: a channel with 2logd input qubits that has a private capacity less than 2, but when used together with a second channel with zero private capacity, the joint capacity jumps to (1/2)logd. In contrast to earlier work which found nonadditivity vanishing as a fraction of input size or conditional on unproven mathematical assumptions, this provides a natural setting manifesting nonadditivity of privacy of the strongest possible sort.