The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
Open accessThe DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both the classical and quantum capacities of the channel. Although our formula involves regularization, i.e. taking a limit over many copies of the channel, it reduces to a single-letter expression in the case of generalized dephasing channels. Analogous formulas are conjectured for the simultaneous public-private capacity of a quantum channel and for the simultaneously 1-way distillable common randomness and entanglement of a bipartite quantum state.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Broadcast channels with confidential messages
Csiszar, I., & Korner, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055892 · Cited by 3,332 · cited 1×
“The corresponding theorem for classical “wire-tap”channels was proven in [6].”
BackgroundThe capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
Sending classical information via noisy quantum channels
Schumacher, B., & Westmoreland, M. D. (1997) · Physical Review A · doi:10.1103/physreva.56.131 · Cited by 1,087 · cited 4×
“The classical capacity theorem was independently proved by Holevo[15] and Schumacher-Westmoreland [21].”
BackgroundMethodInfluentialPositive functions on 𝐶*-algebras
Stinespring, W. F. (1955) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1955-0069403-4 · Cited by 1,086
An operational approach to quantum probability
Davies, E. B., & Lewis, J. T. (1970) · Communications in Mathematical Physics · doi:10.1007/bf01647093 · Cited by 888 · cited 1×
“• A decoding quantum instrument [7] D = (Dm)m∈[μ], i.”
Distillation of secret key and entanglement from quantum states
Devetak, I., & Winter, A. (2005) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2004.1372 · Cited by 877
Self-citationThe Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823 · cited 8×
“To prove the converse we need the following simple lemma [ 8 ].”
BackgroundMethodInfluentialSelf-citation
Research works printed but not linked: 4
- Devetak, I., Winter, A.: Distilling common randomness from bipartite pure states. http://arxiv.org/abs/quant-ph/0304196, 2003. · arXiv
- Holevo, A. S.: Bounds for the quantity of information transmitted by a quantum channel. Probl. Inf. Transm. 9, 177?183 (1973)
- Shor, P. W.: The quantum channel capacity and coherent information . Lecture notes, MSRI Workshop on Quantum Computation, 2002. Available at http://www.msri.org/publications/ln/msri/2002/quantumcrypto/shor/1/, 2002
- Stinespring, W.F.: Proc. Amer. Math. Soc. 6, 211 (1955)
Cited by
Items 301–400 of 439
The Pitfalls of Deciding Whether a Quantum Channel is (Conjugate) Degradable and How to Avoid Them
Brádler, K. (2015) · Open Systems & Information Dynamics · doi:10.1142/s1230161215500262 · Cited by 5
“To name a few, the example is a trivial noiseless channel, the effect of decoherence for a two-level quantum system modeled as a dephasing channel [2, 4], the qubit amplitude damping channel describing the information propagation in a spin network [5], optimal universal cloning machines [6, 7], attenuation and amplifi…”
BackgroundOptimal Trading of Classical Communication, Quantum Communication, and Entanglement
Hsieh, M.-H., & Wilde, M. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10698-9_9 · Cited by 2
“The classically-enhanced father protocol generalizes the father protocol [6], classically-enhanced quantum communication [13], entanglement-assisted classical communication [14], classical communication [15,16], and quantum communication [17,18,19].”
Background“Pretty strong” converse for the private capacity of degraded quantum wiretap channels
Winter, A. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541821 · Cited by 6
“DISCUSSION We showed that the min-entropic machinery employed in the analysis of degradable quantum channels [4], [7], [19], can be used equally, if not more easily, to obtain a pretty strong converse for degraded quantum wiretap channels of the cqq kind; the reason for focusing on this class of channels lies in the a…”
MethodCoherent information of a quantum channel or its complement is generically positive
Singh, S., & Datta, N. (2022) · Quantum · doi:10.22331/q-2022-08-11-775 · Cited by 6
“Q(1)(Φ⊗n) = nQ((1))(Φ)) and hence equal to the quantum capacity (Q(Φ) = Q((1))(Φ)) is that of degradable channels [31].”
BackgroundThe output entropy of quantum channels and operationsPreprint
Широков, М. Е. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1002.0230 · Cited by 7
An Uncertainty Principle For Completely Positive MapsPreprint
Levick, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.06352 · Cited by 4
“(14) Our notion of complementarity is the one used in [12], deriving ultimately from [8].”
BackgroundEntanglement-Assisted Capacity of Quantum Channels with Side InformationPreprint
Pereg, U. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.09992 · Cited by 9
“l. A multi-letter formula for the quantum capacity is given in [2,45,55,17], in terms of the coherent information. A computable formula is obtained in the special case where the channel is degradable [18]. Boche, Cai, and Notzel [¨ 7] addressed the classical-quantum channel with CSI at the encoder, extending the Gel’f…”
BackgroundRandomized Partial Decoupling Unifies One-Shot Quantum Channel CapacitiesPreprint
Wakakuwa, E., & Nakata, Y. (2020) · arXiv (Cornell University) · Cited by 5
Information capacity analysis of fully correlated multilevel amplitude damping channels
Sk, R., & Panigrahi, P. K. (2024) · Physical Review A · doi:10.1103/physreva.109.032425 · Cited by 4
“(15) Let us now revisit the property of degradable and antidegradable channels [46].”
BackgroundCodes for entanglement-assisted classical communication
Prasad, T., & Grassl, M. (2025) · npj Quantum Information · doi:10.1038/s41534-024-00954-2 · Cited by 6
Additivity of Quantum Capacities in Simple Non-Degradable Quantum Channels
Smith, G., & Wu, P. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195623 · Cited by 3
“Currently, the only two known large classes of zero-capacity channels are the anti-degradable channels [12] and the PPT (entanglement-binding) channels [21], [22], [32].”
Об экстремальных бозонных линейных каналах
Холево, & Holevo (2013) · Теоретическая и математическая физика · doi:10.4213/tmf8389 · Cited by 3
Irreducibly SU(2)-covariant quantum channels of low rank
Chang, E., Kim, J., Kwak, H., Lee, H. H., & Youn, S.-G. (2022) · Reviews in Mathematical Physics · doi:10.1142/s0129055x22500210 · Cited by 5
“Indeed, we have ([Sho02]) C(Φ) = χ(Φ) if Φ is entanglement-breaking (shortly, EBT) and ([DS05]) Q(Φ) = Q((1))(Φ) if Φ is degradable.”
Five Starter Pieces: Quantum Information Science via Semidefinite Programs
Siddhu, V., & TAYUR, S. R. (2022) · doi:10.1287/educ.2022.0243 · Cited by 20
Martínez, J. E., iOlius, A. D., & Crespo, P. M. (2023) · Physical Review A · doi:10.1103/physreva.108.032602 · Cited by 7
Khaksar, Z. S., & Bahrampour, A. (2023) · Journal of Laser Applications · doi:10.2351/7.0001068 · Cited by 3
One-Shot Randomized and Nonrandomized Partial Decoupling
Wakakuwa, E., & Nakata, Y. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849631 · Cited by 2
Nonbinary Error-Detecting Hybrid Codes
Nemec, A., & Klappenecker, A. (2020) · American Journal of Science & Engineering · doi:10.15864/ajse.1201 · Cited by 3
Bounding quantum capacities via partial orders and complementarity
Hirche, C., & Leditzky, F. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834698 · Cited by 3
Computational distinguishability of degradable and antidegradable channels
Rosgen, B. (2010) · Quantum Information and Computation · doi:10.26421/qic10.9-10-2 · Cited by 2
“These channels were introduced by Shor and Devetak [ 5 ] to study the capacity of a channel for transmitting quantum information.”
BackgroundInfluentialA resource-based view of quantum information
Bennett, C. H. (2004) · doi:10.5555/2011593.2011598 · Cited by 3
QUANTUM CAPACITY REGION OF SIMULTANEOUS AMPLITUDE AND PHASE DAMPED QUBIT CHANNEL
Jiang, L.-Z., & Chen, X. (2012) · International Journal of Quantum Information · doi:10.1142/s0219749912500104 · Cited by 3
Strelchuk, S. (2013) · Physical Review A · doi:10.1103/physreva.88.032311 · Cited by 3
“The notion of degradable channel, first introduced by [17] was only considered in the context of memoryless channels.”
BackgroundConditions for degradability of tripartite quantum states
Fung, C. F., Li, C.-K., Sze, N.-S., & Chau, H. F. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/11/115306 · Cited by 5
“Degradability has been studied in the context of quantum channels [28, 29].”
BackgroundOn decomposable correlation matrices
Lovitz, B. (2019) · Linear and Multilinear Algebra · doi:10.1080/03081087.2019.1661347 · Cited by 3
Relating Compatibility and Divisibility of Quantum Channels
Duarte, C., Catani, L., & Drumond, R. C. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05165-z · Cited by 6
“[47], the authors have shown that channels having simultaneously diagonalizable Kraus maps are degradable.”
Background5-qubit quantum error correction in a charge qubit quantum computerPreprint
Touchette, D., Ali, H., & Hilke, M. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.3242 · Cited by 5
“We will see that these types of noise are closely related to wellstudied channels: generalized dephasing channels [12, 15] and amplitude damping channels [11, 13] A.”
BackgroundMethodInformation propagation and entanglement generation between two Unruh-DeWitt detectors
Cliche, M. (2010) · UWSpace (University of Waterloo) · Cited by 3
A Characterization of Antidegradable Qubit ChannelsPreprint
Paddock, C., & Chen, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.03399 · Cited by 3
“Degradable channels were introduced as a class of channels which have additive coherent information [7], a feature which allows for the quantum channel capacity to be explicitly calculated.”
BackgroundInfluentialAllowing leakage can increase quantum transmissionPreprint
Siddhu, V. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.15116 · Cited by 11
“Under special circumstances when B is degradable and thus its complement C anti-degradable [16], i.e., D ◦ B = C for some quantum channel D , one can show that Q ( C ) = P ( C ) = 0 [45].”
A Mathematical Framework for Causally Structured Dilations and its Relation to Quantum Self-TestingPreprint
Houghton-Larsen, N. G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.02302 · Cited by 15
Certifying nonlocal properties of noisy quantum operations
Rico, A., Morán, M. B., Shahbeigi, F., & Życzkowski, K. (2025) · Quantum · doi:10.22331/q-2025-07-22-1807 · Cited by 4
“In particular, quantum systems are affected by dephasing noise [23, 24], which acts on a quantum state by damping the off-diagonal terms in the density matrix while leaving intact the diagonal terms in a fixed basis [25–27].”
BackgroundAdaptive channel reshaping for improved entanglement distillation
Abdelhadi, D., Jochym-O’Connor, T., Siddhu, V., & Smolin, J. (2025) · Physical Review Research · doi:10.1103/8kdf-37gp · Cited by 6
Superadditivity of quantum capacity in simple channels
Wu, Z., Zhao, Q., & Ma, Z. (2025) · Physical Review A · doi:10.1103/14j4-6tfc · Cited by 3
Quantum Autoencoders for Learning Quantum Channel Codes
Rathi, L., DiAdamo, S., & Shabani, A. (2024) · International Conference on Communication Systems & Networks (COMSNETS) · doi:10.1109/comsnets59351.2024.10427450 · Cited by 6
“In quantum communication, channels that are “degradable” have a single-letter quantum capacity formula [22], making them easier to analyze.”
BackgroundLow-ground/High-ground capacity regions analysis for bosonic Gaussian channels
Kianvash, F., Fanizza, M., & Giovannetti, V. (2024) · International Journal of Quantum Information · doi:10.1142/s0219749924400057 · Cited by 2
Capacities of a two-parameter family of noisy Werner–Holevo channels
Roofeh, S., & Karimipour, V. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04840-4 · Cited by 3
“…arises from the superadditivity of the coherence information, expressed by the inequality For some quantum channels which are degradable, the additivity property is restored Q ((cid:4)) = Q ( 1 ) ((cid:4)) [40], and the calculation of the quantum capacity becomes a convex optimization problem.”
Stimulated emission of radiation and the black hole information problem
Adami, C. (2024) · Annals of Physics · doi:10.1016/j.aop.2024.169739 · Cited by 5
A Quantum Color Image Watermarking Protocol Based on Least Significant Bit
Wei, Z., Han, M., Yin, H., & Hu, G. (2024) · International Conference on Computer Vision, Image and Deep Learning (CVIDL) · doi:10.1109/cvidl62147.2024.10603657 · Cited by 2
“Quantum watermarking [1] , as a component of quantum information hiding [2] , uses images as carriers of watermarking information, embedded in images to achieve secure [3] and reliable transmission [4] .”
BackgroundQuantum data compression under localized features
Han, Q., Gou, L., Wang, S., & Zhang, R. (2024) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ad8514 · Cited by 2
Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding
Salek, F., Hayden, P. M., & Hayashi, M. (2025) · Annales Henri Poincaré · doi:10.1007/s00023-025-01597-5 · Cited by 12
Reverse-Type Data Processing Inequality
Belzig, P., Gao, L., Smith, G., & Wu, P. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195448 · Cited by 2
Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems
He, K., Saunderson, J., & Fawzi, H. (2025) · Mathematical Programming Computation · doi:10.1007/s12532-025-00296-w · Cited by 17
“However, if the channel N is degradable, then the channel capacity is given by [56] max where W ∈ C n e n f × n o is the isometry matrix associated with Ξ such that Ξ( X ) = tr n e ,n f 2 ( WXW † ).”
Optimization and synchronization of programmable quantum and communication channels
Dasari, V. R., & Im, M. S. (2018) · SPIE Quantum Information Science, Sensing, and Computation · doi:10.1117/12.2304372 · Cited by 3
Оценка выходной энтропии тензорного произведения двух квантовых каналов
Амосов, Г. Г., & Amosov, G. G. (2015) · Теоретическая и математическая физика · doi:10.4213/tmf8776 · Cited by 2
Degradable states and one-way entanglement distillation
Leditzky, F., Datta, N., & Smith, G. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006791 · Cited by 2
“In analogy to degradable quantum channels [7], we call a bipartite state ρAB with purification |φ〉ABE and ‘complementary’ state ρAE = TrB φABE degradable, if there is a quantum operation D : B → E such that”
BackgroundEncoding classical information in gauge subsystems of quantum codes
Nemec, A., & Klappenecker, A. (2022) · International Journal of Quantum Information · doi:10.1142/s0219749921500416 · Cited by 8
“We can also choose our gauge operators in such a way so that they form four anticommuting pairs G Zi , G Note that if we pick a gauge and look at the subspace stabilized by the abelian group S , , it is the same as the original 9-qubit Shor code (up to a permutation of the qubits).”
BackgroundMethodInfluentialFilippov, S. N. (2022) · Physical Review A · doi:10.1103/physreva.105.062606 · Cited by 3
“Then the coherent information is subadditive [9] in the sense that”
BackgroundOptimal one-shot entanglement sharing
Siddhu, V., & Smolin, J. A. (2023) · Physical Review A · doi:10.1103/physreva.108.032617 · Cited by 2
“The quantum channelN is called degradable andN c anti-degradable if there exists a quantum channel D such that D ◦ N = N c [11].”
BackgroundEntanglement Sharing Across a Damping-Dephasing Channel
Siddhu, V., Abdelhadi, D., Jochym-O’Connor, T., & Smolin, J. A. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619242 · Cited by 8
Matter-wave soliton buffer realized by a tailored one-dimensional lattice
Fan, Z., Mai, J., Chen, Z., Xie, M., & Luo, Z. (2018) · Modern Physics Letters B · doi:10.1142/s0217984918500707 · Cited by 2
Perturbative approach to the coherent information of an additive Gaussian quantum channel
Chen, X. (2009) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/42/7/075502 · Cited by 3
The Classically-Enhanced Father ProtocolPreprint
Hsieh, M.-H., & Wilde, M. M. (2008) · arXiv (Cornell University) · Cited by 2
Quantum Computation and Communication in Bosonic SystemsPreprint
Noh, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.09445 · Cited by 8
Noise is resource-contextual in quantum communication
Nema, A., Maity, A. G., Strelchuk, S., & Elkouss, D. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033089 · Cited by 1
“Moreover, the quantum (and private) capacity is given by the coherent information (by [27, Theorem 2], also [17]).”
BackgroundSimultaneous information and energy transmission through quantum channels
Das, B. K., Varshney, L. R., & Madhok, V. (2025) · Physical Review A · doi:10.1103/physreva.111.012609 · Cited by 1
“In other The private capacity of a quantum channel is the maximum rate at which classical information can be sent reliably and privately ; operational definitions and coding theorems are given in prior work [15, 27, 34].”
Yang, F., Wang, X., & Chen, T. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.064308 · Cited by 1
Steganographic entanglement sharing
Avritzer, B., & Brun, T. A. (2025) · Physical Review A · doi:10.1103/kxpv-46v3 · Cited by 1
“To formalize this argument, we can examine the notion of degradable and anti-degradable channels [17, 18].”
State-adaptive quantum error correction and fault-tolerant quantum computing
Wang, D. (2026) · Physical Review A · doi:10.1103/3z8s-jh28 · Cited by 4
“Both the quantum capacity Q and the private capacity P show superaddi-tivity [9, 18], and degradable channels can be defined to enforce subadditivity [52].”
Reverse-Type Data Processing Inequality
Belzig, P., Gao, L., Smith, G., & Wu, P. (2025) · Communications in Mathematical Physics · doi:10.1007/s00220-025-05474-4 · Cited by 7
“Degradable channels were introduced in [25] as the first class of channels whose quantum capacity does not require regularization, making them computable via optimization.”
Seguel, S., & Soto, I. (2025) · South American Colloquium on Visible Light Communications (SACVLC) · doi:10.1109/sacvlc67412.2025.11262030 · Cited by 1
“The quantum communications literature has extensively explored quantum error-correcting codes [4], [5], quantum convolutional codes [6], and channel capacities [7]–[10].”
Bipartite quantum states admitting a causal explanation
Song, M.-J., & Parzygnat, A. J. (2025) · AVS Quantum Science · doi:10.1116/5.0303300 · Cited by 17
“[68, 69] and Section 5.2 of Ref.”
InfluentialApproximate Quantum Error Correction with 1D Log-Depth Circuits
Liu, G., Du, Z., Liu, Z.-W., & Ma, X. (2026) · PRX Quantum · doi:10.1103/7rzk-2jyh · Cited by 11
Channel Nonlocality under Decoherence
Rico, A., Morán, M. B., Shahbeigi, F., & Życzkowski, K. (2026) · Physical Review Letters · doi:10.1103/6k34-zxg6 · Cited by 2
A NEW APPROACH TO CHARACTERIZE QUBIT CHANNELS
Caruso, F., & Giovannetti, V. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003864 · Cited by 1
Convexity of reverse coherent information capacity and its application
Wang, M., & Pan, W. (2011) · Physics Letters A · doi:10.1016/j.physleta.2011.06.028 · Cited by 1
Mahdian, M., & Mehrabpour, H. (2014) · International Journal of Theoretical Physics · doi:10.1007/s10773-014-2075-z · Cited by 2
Towards a strong converse for the quantum capacity (of degradable channels)
Morgan, C., & Winter, A. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620210 · Cited by 1
Effect of Decoherence Induced by a Spin Environment on Quantum Channel Capacity
Ma, X.-S., Cheng, M.-T., Zhao, G.-X., & Wang, A. M. (2012) · Communications in Theoretical Physics · doi:10.1088/0253-6102/57/3/27 · Cited by 1
Analysis of Quantum Communication Protocols
Hayashi, M. (2016) · Graduate texts in physics · doi:10.1007/978-3-662-49725-8_9 · Cited by 1
Improving classical capacity of qubit dynamical maps through stationary state manipulation
Siudzińska, K. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/acd1c7 · Cited by 1
When quantum memory is useful for dense coding
Takagi, R., & Hayashi, M. (2024) · Letters in Mathematical Physics · doi:10.1007/s11005-024-01831-x · Cited by 2
“This fact can be extended to the dephased state [49] as follows.”
Degradable strong entanglement breaking maps
Devendra, R., Sapra, G., & Sumesh, K. (2024) · Linear Algebra and its Applications · doi:10.1016/j.laa.2024.09.006 · Cited by 1
Additivity of Quantum Capacities in Simple Non-Degradable Quantum Channels
Smith, G., & Wu, P. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3583936 · Cited by 11
“Currently, the only two known large classes of zero-capacity channels are the anti-degradable channels [18] and the PPT (entanglement-binding) channels [31], [32], [47].”
HAMILTONIAN MODELS FOR QUANTUM MEMORY CHANNELS
D’Arrigo, A., Benenti, G., & Falci, G. (2011) · International Journal of Quantum Information · doi:10.1142/s0219749911007903 · Cited by 1
Capacity of a continuously distributed quantum network
Zhou, X., Yu, X., & Zhang, Z. (2018) · Physical Review A · doi:10.1103/physreva.98.012316 · Cited by 1
Pereg, U., Deppe, C., & Boche, H. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw46852.2021.9457622 · Cited by 14
“Although calculation of such a formula is intractable in general, it provides a computable lower bound, and there are special cases where the capacity can be computed exactly [44].”
BackgroundMethodThe platypus of the quantum channel zoo
Leditzky, F., Leung, D., Siddhu, V., Smith, G., & Smolin, J. A. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834678 · Cited by 1
Capacity Estimates for TRO ChannelsPreprint
Gao, L., Junge, M., & LaRacuente, N. D. (2016) · arXiv (Cornell University) · Cited by 1
Degenerate Codes and Capacities of Quantum Channels
Jackson, T. (2017) · The Atrium (University of Guelph) · Cited by 4
Performance Analysis of Quantum ChannelsPreprint
Sun, F. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.04706 · Cited by 1
“It is interesting to consider trade-off capacities [34] [8] and the impact of multiplexing of classical and quantum information [24].”
BackgroundGlisic, S., & Lorenzo, B. (2022) · Wiley eBooks · doi:10.1002/9781119790327.ch14 · Cited by 1
Transmitting Quantum Information Reliably across Various Quantum Channels
Ouyang, Y. (2013) · UWSpace (University of Waterloo) · Cited by 1
Puchała, Z., Korzekwa, K., Salazar, R., Horodecki, P., & Życzkowski, K. (2021) · Physical Review A · doi:10.1103/physreva.104.052611 · Cited by 19
“[9].”
Classical state masking over a quantum channel
Pereg, U., Deppe, C., & Boche, H. (2022) · Physical Review A · doi:10.1103/physreva.105.022442 · Cited by 12
“Although calculation of a regularized formula is intractable in general, it provides a computable lower bound, and there are special cases where the capacity can be computed exactly [76].”
BackgroundEngineering Classical Capacity of Generalized Pauli Channels with Admissible Memory Kernels
Siudzińska, K., Das, A., & Bera, A. (2021) · Entropy · doi:10.3390/e23111382 · Cited by 7
“If quantum information is transferred through a noisy channel, then one considers the quantum capacity, whose lower and upper estimations were found by Lloyd [12], Shor [13], and Devetak [14].”
InfluentialOhya, M., & Volovich, I. V. (2011) · Theoretical and mathematical physics · doi:10.1007/978-94-007-0171-7_9
Brádler, K. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.3942
“m channels provide a convenient way of describing open quantum systems. They are at the forefront of interest in quantum information theory [2]. A subset of quantum channels called degradablechannels [3, 4] was shown to be especially important both from the physical and mathematical viewpoint. To get an intuitive idea…”
BackgroundInfluentialSimulating BB84 Protocol in Dephasing Qubit Channel
Chen, X. (2010) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-11731-2_29
THE QUANTUM CAPACITY BOUNDS OF A LOSSY GAUSSIAN QUANTUM CHANNEL
Chen, X., & Jiang, L.-Z. (2011) · International Journal of Quantum Information · doi:10.1142/s0219749911007824
Notes on multiplicativity of maximal output purity for completely positive qubit maps
Audenaert, K. M. R. (2008) · Journal of Physics Conference Series · doi:10.1088/1742-6596/104/1/012001
Atmospheric Attenuation on a Satellite Quantum System at 0.8 μm
Yan, Y., Pei, C., & Hu, H. (2008) · Journal of Infrared Millimeter and Terahertz Waves · doi:10.1007/s10762-008-9447-5
“Hence, there is also some effort in developing free space communication systems, not only for classical data transmission but for quantum cryptography as well [1–5].”
BackgroundKraus representation for maps and master equation in spin star model with layered environmentPreprint
Mahdian, M., & Mehrabpour, H. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.5918
Devetak, I., Harrow, A. W., & Winter, A. (2008)
Self-citationA Family of Degenerate Codes for Depolarizing Channels
Chen, X., Zhao, J.-J., Wang, T., & Shou, C.-J. (2015) · Communications in Theoretical Physics · doi:10.1088/0253-6102/63/2/08
Parameter Regime Giving Zero Quantum Coherent Information of A Non-Pauli Quantum Channel
Liu, T. (2015) · The Atrium (University of Guelph)
Operator algebra approach to quantum capacities
Gao, L., Junge, M., & LaRacuente, N. D. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541588
“Devetak and Shor proved in [8] that the quantum capacity is automatically regularized the for degradable channels, for which the receiver can fully retrieve the information lost to the environment.”
BackgroundImplementing quantum gates and channels using linear optics
Bonsma-Fisher, K. (2012) · UWSpace (University of Waterloo) · Cited by 1
On environment-assisted capacities of a quantum channel
Karumanchi, S., & Mancini, S. (2015)
Interferometric Activation of Quantum Dephasing Channels
Xu, J., Yung, M., Xu, X.-Y., Tang, J., Li, C., & Guo, G. (2016) · Conference on Lasers and Electro-Optics · doi:10.1364/cleo_at.2016.jtu5a.8
“More generally, quantum capacity is defined through the average coherent information transmitted through multiple uses [3–5]; but for dephasing channels [6], both definitions are equivalent.”
Background
Metadata
- Authors
- Devetak, I., & Shor, P. W.
- Affiliations
- IBM Research - Thomas J. Watson Research Center (US)
- Massachusetts Institute of Technology (US)
- Venue
- Communications in Mathematical Physics
- Published
- 2005-03-22
- Volume
- 256
- Issue
- 2
- Pages
- 287-303
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2594901681
- Cited by
- 445
- References
- 26
- Citations by year
- 2026: 12 · 2025: 25 · 2024: 22 · 2023: 19 · 2022: 26 · 2021: 39 · 2020: 33 · 2019: 16 · 2018: 29 · 2017: 18 · 2016: 21 · 2015: 15 · 2014: 23 · 2013: 22 · 2012: 22
- FWCI
- 16.90
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Communications in Mathematical Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum channel capacity, regularization, dephasing channel, common randomness, entanglement distillation, quantum information
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.