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 101–200 of 439
Information Trade-Offs for Optical Quantum Communication
Wilde, M. M., Hayden, P. M., & Guha, S. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.140501 · Cited by 46
“1: A sketch of the trade-off coding protocol for communication of classical and quantum information without any entanglement assistance (this case is the Devetak-Shor protocol [6]).”
BackgroundInfluentialQuantum Rate-Distortion Coding With Auxiliary Resources
Wilde, M. M., Datta, N., Hsieh, M.-H., & Winter, A. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2271772 · Cited by 39
“Of course, in the above development, we analyzed the protocol by assuming that each block consists of exactly states, but one can analyze this more carefully (see [30], for example).”
Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit
Hayden, P., & Penington, G. (2020) · Communications in Mathematical Physics · doi:10.1007/s00220-020-03689-1 · Cited by 40
“el with 0= 1 . Since applying two erasure channels gives an erasure channel with = 1 2, we see that the qubit erasure channel with 0:5 can simulate its complementary channel; it is degradable [52]. The erasure channel is invariant under the unitary group and hence the mutual and coherent informations only depend on th…”
Das, S., Bäuml, S., & Wilde, M. M. (2020) · Physical Review A · doi:10.1103/physreva.101.012344 · Cited by 46
“For this, one could consider memory cells consisting of degradable channels [126, 127].”
Quantum Flags and New Bounds on the Quantum Capacity of the Depolarizing Channel
Fanizza, M., Kianvash, F., & Giovannetti, V. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.020503 · Cited by 45
Quantum codes from neural networks
Bausch, J., & Leditzky, F. (2019) · Apollo (University of Cambridge) · doi:10.17863/cam.48816 · Cited by 45
Decorrelating capabilities of operations with application to decoherence
Luo, S., Fu, S., & Li, N. (2010) · Physical Review A · doi:10.1103/physreva.82.052122 · Cited by 39
Potential Capacities of Quantum Channels
Winter, A., & Yang, D. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2519920 · Cited by 44
“…of M is W : RA The coherent information is thus, where we use the isometry V : | i B 1 7→ | i Y | i Z and the fact that S ( A B ) ≤ S ( A C ) if there is an operation = The above proposition 14 is a special case of a more general fact [32, Lemma 4], [33, Thm. 3 & Lemma 2]; cf. also [20, App.”
BackgroundMethodQuantum codes from neural networks
Bausch, J., & Leditzky, F. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab6cdd · Cited by 59
Classical Communication Over a Quantum Interference Channel
Fawzi, O., Hayden, P. M., Savov, I., Sen, P., & Wilde, M. M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2188620 · Cited by 67
“…of the above settings, depending on the form of the transmitted information [12], [28], [31], [32], [39], [55], whether assisting resources are available [4], [15], [33], [56] or whether the sender and receiver would like to tradeoff different resources against each other [13], [14], [34].”
BackgroundMethodBrady, A. J., Eickbusch, A., Singh, S., Wu, J., & Zhuang, Q. (2024) · Progress in Quantum Electronics · doi:10.1016/j.pquantelec.2023.100496 · Cited by 91
Quantum Channel Capacities With Passive Environment Assistance
Karumanchi, S., Mancini, S., Winter, A., & Yang, D. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2522192 · Cited by 35
“(2): By Wolf and Perez-Garcia’s Lemma 12, each of the N η i is degradable or anti-degradable, so by Devetak and Shor [12], the coherent information is additive: Clearly, for those η such that N η is anti-degradable, we know that the r.h.s. is 0 , so we may discount them in the optimization.”
BackgroundInfluentialQuantum capacity analysis of multi-level amplitude damping channels
Chessa, S., & Giovannetti, V. (2021) · Communications Physics · doi:10.1038/s42005-021-00524-4 · Cited by 55
Complementarity of private and correctable subsystems in quantum cryptography and error correction
Kretschmann, D., Kribs, D. W., & Spekkens, R. W. (2008) · Physical Review A · doi:10.1103/physreva.78.032330 · Cited by 41
Decoding quantum information via the Petz recovery map
Beigi, S., Datta, N., & Leditzky, F. (2016) · Journal of Mathematical Physics · doi:10.1063/1.4961515 · Cited by 48
“Contents”
Public and private resource trade-offs for a quantum channel
Wilde, M. M., & Hsieh, M.-H. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0317-z · Cited by 35
An Infinite Sequence of Additive Channels: The Classical Capacity of Cloning Channels
Brádler, K. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158896 · Cited by 33
“The definition of conjugate degradability [25] resembles the one of degradability [15] which we present for the sake of completeness.”
BackgroundExperimental Detection of Quantum Channel Capacities
Cuevas, Á., Proietti, M., Ciampini, M. A., Duranti, S., Mataloni, P., Sacchi, M. F., & Macchiavello, C. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.100502 · Cited by 37
Optimal linear optical implementation of a single-qubit damping channel
Bonsma-Fisher, K., Prevedel, R., Kaltenbaek, R., & Resch, K. J. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/3/033016 · Cited by 38
Communication Over Quantum Channels With Parameter Estimation
Pereg, U. (2020) · IEEE Transactions on Information Theory · doi:10.1109/isit44484.2020.9174144 · Cited by 30
“A computable formula is obtained in the special case where the channel is degradable [16].”
MethodConvex resource theory of non-Markovianity
Bhattacharya, S., Bhattacharya, B., & Majumdar, A. S. (2020) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/abd191 · Cited by 52
Regula, B., Takagi, R., & Gu, M. (2021) · Quantum · doi:10.22331/q-2021-08-09-522 · Cited by 56
“The generalised dephasing channel [69] is defined by ∆p(X) := ∑dA−1 i=0 piZiXZ † i , where p = (p0, .”
BackgroundEntanglement boosts quantum turbo codes
Wilde, M. M., & Hsieh, M.-H. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6034165 · Cited by 38
Transmitting qubits through relativistic fields
Jonsson, R. H., Ried, K., Martín-Martínez, E., & Kempf, A. (2018) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aae78a · Cited by 39
“, the channel Φ can be obtained by composing the channel Φ and the complimentary channel Φ̄ [15, 16].”
MethodExact solution for the quantum and private capacities of bosonic dephasing channels
Lami, L., & Wilde, M. M. (2023) · Nature Photonics · doi:10.1038/s41566-023-01190-4 · Cited by 48
“Our formula can be seen as a natural generalization to bosonic systems of that given in [18, 36, 46] for the quantum and private capacities of the qudit dephasing channel.”
BackgroundEXIT-Chart Aided Quantum Code Design Improves the Normalised Throughput of Realistic Quantum Devices
Nguyen, H. V., Babar, Z., Alanis, D., Botsinis, P., Chandra, D., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2591910 · Cited by 34
“[14] L. M. K. Vandersypen, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang, ‘‘Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance,’’ Nature, vol. 414, pp. 883–887, Dec. 2001.”
BackgroundInfluentialClassical communication over a quantum interference channel
Fawzi, O., Hayden, P. M., Savov, I., Sen, P., & Wilde, M. M. (2012) · Civil War Book Review · Cited by 30
Smith, G. (2010) · IEEE Information Theory Workshop (ITW) · doi:10.1109/cig.2010.5592851 · Cited by 45
Channel capacities of an exactly solvable spin-star system
Arshed, N., Toor, A. H., & Lidar, D. A. (2010) · Physical Review A · doi:10.1103/physreva.81.062353 · Cited by 30
A quantum computing primer for operator theorists
Kribs, D. W. (2004) · Linear Algebra and its Applications · doi:10.1016/j.laa.2004.11.010 · Cited by 43
Enhanced energy-constrained quantum communication over bosonic Gaussian channels
Noh, K., Pirandola, S., & Jiang, L. (2020) · Nature Communications · doi:10.1038/s41467-020-14329-6 · Cited by 32
Polar codes for degradable quantum channels
Wilde, M. M., & Guha, S. (2013) · Civil War Book Review · Cited by 28
Pereg, U., Deppe, C., & Boche, H. (2021) · Journal of Mathematical Physics · doi:10.1063/5.0038083 · Cited by 30
“A computable formula is obtained in the special case where the channel is degradable 29 , or belongs to the more general class of less noisy channels 30 .”
BackgroundMethodКомплементарные каналы и проблема аддитивности
Холево, А. С., & Holevo, A. S. (2006) · Теория вероятностей и ее применения · doi:10.4213/tvp151 · Cited by 27
Quantum rate distortion, reverse shannon theorems, and source-channel separation
Datta, N., Hsieh, M. H., & Wilde, M. M. (2013) · Civil War Book Review · Cited by 27
Approximate simulation of quantum channels
Bény, C., & Oreshkov, O. (2011) · Physical Review A · doi:10.1103/physreva.84.022333 · Cited by 31
Error Thresholds for Arbitrary Pauli Noise
Bausch, J., & Leditzky, F. (2021) · SIAM Journal on Computing · doi:10.1137/20m1337375 · Cited by 40
Quantum capacity of a bosonic dephasing channel
Arqand, A., Memarzadeh, L., & Mancini, S. (2020) · Physical Review A · doi:10.1103/physreva.102.042413 · Cited by 29
Superadditivity of the Classical Capacity with Limited Entanglement Assistance
Zhu, E. Y., Zhuang, Q., & Shor, P. W. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.040503 · Cited by 29
“For quantum capacity, there are also examples like degradable channels [11].”
BackgroundSelf-citationPositivity and Nonadditivity of Quantum Capacities Using Generalized Erasure Channels
Siddhu, V., & Griffiths, R. B. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3080819 · Cited by 26
Polar Codes for Degradable Quantum Channels
Wilde, M. M., & Guha, S. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2250575 · Cited by 49
“For some channels known as degradable quantum channels [12], in which the channel to the environment is noisier than the channel to the intended receiver, the random-coding-based schemes from [11], [28], [43] achieve their quantum capacity, due to the particular structure of these channels.”
BackgroundEncoding Classical Information Into Quantum Resources
Korzekwa, K., Puchała, Z., Tomamichel, M., & Życzkowski, K. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3157440 · Cited by 28
“In other words, such channels process only coherences of a quantum system, and are also known in the literature as generalised dephasing channels [40].”
BackgroundRobust bidirectional links for photonic quantum networks
Xu, J., Yung, M., Xu, X.-Y., Tang, J., Li, C., & Guo, G. (2016) · Science Advances · doi:10.1126/sciadv.1500672 · Cited by 27
Energy-constrained two-way assisted private and quantum capacities of quantum channels
Davis, N., Широков, М. Е., & Wilde, M. M. (2018) · Physical Review A · doi:10.1103/physreva.97.062310 · Cited by 34
Spectrum conditions for symmetric extendible states
Myhr, G. O., & Lütkenhaus, N. (2009) · Physical Review A · doi:10.1103/physreva.79.062307 · Cited by 39
Estimating Quantum and Private Capacities of Gaussian Channels via Degradable Extensions
Fanizza, M., Kianvash, F., & Giovannetti, V. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.210501 · Cited by 26
Efficient Quantum Polar Codes Requiring No Preshared Entanglement
Renes, J. M., Sutter, D., Dupuis, F., & Renner, R. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2468084 · Cited by 33
“a relation that was first shown for degradable channels [24], [25].”
BackgroundThe capacity of black holes to transmit quantum information
Brádler, K., & Adami, C. (2014) · Journal of High Energy Physics · doi:10.1007/jhep05(2014)095 · Cited by 34
“Hayden and Preskill realized that the process of thermalization (called scrambling in the high-energy jargon) resembles a random code construction [32, 33, 41], which would imply automatic protection of quantum information thrown into black hole.”
BackgroundFundamental limitations to information transfer in accelerated frames
Martín-Martínez, E., Hosler, D., & Montero, M. (2012) · Physical Review A · doi:10.1103/physreva.86.062307 · Cited by 25
Selfcomplementary Quantum Channels
Smaczyński, M., Roga, W., & Życzkowski, K. (2016) · Open Systems & Information Dynamics · doi:10.1142/s1230161216500141 · Cited by 25
“Selfcomplementary channels appear in wider context as particular examples of the so called degradable and anti-degradable channels [7, 8, 35].”
BackgroundHadamard quantum broadcast channels
Wang, Q., Das, S., & Wilde, M. M. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1697-5 · Cited by 28
“We now argue an achievability statement based on some prior coding schemes from [28, 32, 33]:”
MethodCapacity Estimates via Comparison with TRO Channels
Gao, L., Junge, M., & LaRacuente, N. D. (2018) · Communications in Mathematical Physics · doi:10.1007/s00220-018-3249-y · Cited by 27
“Based on research due to Devetak and Shor [16], Abeyesinghe et al [1], Collins and Popescu [11], and many others, Hsieh and Wilde introduced the two kinds of capacity regions: the quantum dynamic region CCQE and private dynamic regionCRPS .”
BackgroundMethodInfluentialQuantum Keyless Private Communication Versus Quantum Key Distribution for Space Links
Vázquez-Castro, A., Rusca, D., & Zbinden, H. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.014006 · Cited by 29
“In a quantum setting, where Alice and Bob use an authenticated quantum channel for (keyless) secure direct communication, the asymptotically achievable rate, the private capacity, subject to the strong security criterion, was determined by Cai, Winter and Yeung in [18] and Devetak in [19][21].”
MethodPereg, U., Deppe, C., & Boche, H. (2021) · mediaTUM (Technical University of Munich) · doi:10.1109/tit.2021.3050529 · Cited by 21
Entropic singularities give rise to quantum transmission
Siddhu, V. (2021) · Nature Communications · doi:10.1038/s41467-021-25954-0 · Cited by 33
Channel covariance, twirling, contraction and some upper bounds on the quantum capacity
Ouyang, Y. (2014) · Quantum Information and Computation · doi:10.26421/qic14.11-12-2 · Cited by 33
“A degradable channel N has a simple expression for its quantum capacity, which is Q(N ) = Icoh(N ) [11].”
BackgroundInfluentialCodes for Simultaneous Transmission of Quantum and Classical Information
Grassl, M., Lu, S., & Zeng, B. (2017) · MPG.PuRe (Max Planck Society) · Cited by 23
On “Quantum and Classical Message Identification via Quantum Channels”
Winter, A. (2005) · Quantum Information and Computation · doi:10.26421/qic5.7-8 · Cited by 29
The Quantum Schur Transform: I. Efficient Qudit CircuitsPreprint
Bacon, D., Chuang, I. L., & Harrow, A. W. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0601001 · Cited by 73
“The basic goal of this new work has been the identification and quantification of different information resources in situations where the laws of quantum theory are applied to the physical carriers of information.”
BackgroundGeneric Nonadditivity of Quantum Capacity in Simple Channels
Leditzky, F., Leung, D., Siddhu, V., Smith, G., & Smolin, J. A. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.200801 · Cited by 25
Superadditivity in Trade-Off Capacities of Quantum Channels
Zhu, E. Y., Zhuang, Q., Hsieh, M.-H., & Shor, P. W. (2018) · IEEE Transactions on Information Theory · doi:10.1109/isit.2018.8437934 · Cited by 25
Self-citationPursuing the Fundamental Limits for Quantum Communication
Wang, X. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3068818 · Cited by 25
“Degradable quantum channels are among the only channels whose quantum capacity is known [38].”
BackgroundJahromi, H. R., & Amniat-Talab, M. (2015) · Annals of Physics · doi:10.1016/j.aop.2015.05.022 · Cited by 26
Quantum Shannon TheoryPreprint
Preskill, J. P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.07450 · Cited by 58
“d been discussed earlier, by Lubkin [40], Lloyd and Pagels [41], and Page [42]. Devetak, Harrow, and Winter [43, 44] introduced the mother and father protocols and their descendants. Devatak and Shor [45] introduced degradable quantum channels and proved that coherent information is additive for these channels. Bennet…”
Game-theoretic characterization of antidegradable channels
Buscemi, F., Datta, N., & Strelchuk, S. (2014) · Journal of Mathematical Physics · doi:10.1063/1.4895918 · Cited by 25
Detecting Incapacity of a Quantum Channel
Smith, G., & Smolin, J. A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.230507 · Cited by 27
Convergence Rates for the Quantum Central Limit Theorem
Becker, S., Datta, N., Lami, L., & Rouzé, C. (2021) · Communications in Mathematical Physics · doi:10.1007/s00220-021-03988-1 · Cited by 41
Continuous-Variable Error Correction for General Gaussian Noises
Wu, J., & Zhuang, Q. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.034073 · Cited by 27
Filippov, S. N. (2021) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/abfd61 · Cited by 21
“, there exists a quantum channel Ξ such that Φ̃ = Ξ ◦ Φ [33].”
Public and private communication with a quantum channel and a secret key
Hsieh, M.-H., & Wilde, M. M. (2009) · Physical Review A · doi:10.1103/physreva.80.022306 · Cited by 19
“The expurgation of any secret-key-assisted private code C has a minimal effect on the resulting channel input density operator [30]: ∥∥∥ρ′A′n (C)− ρA′n (C)∥∥∥ 1 ≤ 4 4 √ .”
BackgroundThe maximal p-norm multiplicativity conjecture is falsePreprint
Hayden, P. M. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.3291 · Cited by 33
“In addition, the weak additivity conjecture was confirmed for degradable channels [27], their conjugate channels [28] and some other special classes of channels [16, 29, 30, 31].”
BackgroundPerformance analysis of quantum channels
Sun, F. (2020) · Quantum Engineering · doi:10.1002/que2.35 · Cited by 19
Preserving information from the beginning to the end of time in a Robertson–Walker spacetime
Mancini, S., Pierini, R., & Wilde, M. M. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/12/123049 · Cited by 20
Maximal Privacy without Coherence
Leung, D., Li, K., Smith, G., & Smolin, J. A. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.030502 · Cited by 19
Unified quantum convolutional coding
Wilde, M. M., & Brun, T. A. (2008) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2008.4595008 · Cited by 24
“Another important capacity theorem determines the ability of a noisy quantum channel to send “classical-quantum” states [7].”
Information transmission over an amplitude damping channel with an arbitrary degree of memory
D’Arrigo, A., Benenti, G., Falci, G., & Macchiavello, C. (2015) · Physical Review A · doi:10.1103/physreva.92.062342 · Cited by 22
Bosonic Quantum Communication Across Arbitrarily High Loss Channels
Lami, L., Plenio, M. B., Giovannetti, V., & Holevo, A. S. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.110504 · Cited by 25
Approximate reconstructability of quantum states and noisy quantum secret sharing schemes
Ouyang, Y., Goswami, K., Romero, J., Sanders, B. C., Hsieh, M.-H., & Tomamichel, M. (2023) · Physical Review A · doi:10.1103/physreva.108.012425 · Cited by 22
“For this, we need to introduce complementary channels [21] for the channels NA, which intuitively model how much information the adversary retains after the attack.”
BackgroundBlack holes as bosonic Gaussian channels
Brádler, K., & Adami, C. (2015) · Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields · doi:10.1103/physrevd.92.025030 · Cited by 22
“A consequence of this intractability is that the quantum capacity is currently known only for three special cases of channels called degradable [39], conjugate degradable [40], and antidegradable (the quantum capacity vanishes for antidegradable channels), and in general only a lower bound can be given using Eq.”
Codes for simultaneous transmission of quantum and classical information
Grassl, M., Lu, S., & Zeng, B. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006823 · Cited by 26
“The simultaneous transmission of both quantum and classical information over a quantum channel was initially investigated in [6] from an information theoretic point of view, and followed up by many others (see, e. g. [10], [11], [15]).”
BackgroundBakraoui, M. E., Slaoui, A., Hadfi, H. E., & Mohammed Daoud, A. (2022) · Journal of the Optical Society of America B · doi:10.1364/josab.446354 · Cited by 21
Witnessing quantum capacities of correlated channels
Macchiavello, C., & Sacchi, M. F. (2016) · Physical Review A · doi:10.1103/physreva.94.052333 · Cited by 19
THE CAPACITY OF BLACK HOLES TO TRANSMIT QUANTUM INFORMATION
Bradler, K., & Adami, C. (2014) · Saint Mary's University Institutional Repository (Saint Mary's University) · Cited by 23
Capacity theorems for quantum multiple access channels
Yard, J., Devetak, I., & Hayden, P. M. (2005) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2005.1523464 · Cited by 17
“Since Np is a generalized dephasing channel [17], its quantum capacity is additive and can be calculated to be 2 − H(p).”
BackgroundMethodInfluentialSelf-citationBounding the quantum capacity with flagged extensions
Kianvash, F., Fanizza, M., & Giovannetti, V. (2022) · Quantum · doi:10.22331/q-2022-02-09-647 · Cited by 23
Some Open Problems in Quantum Information TheoryPreprint
Ruskai, M. B. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0708.1902 · Cited by 17
“Moreover, Shor’s channel extension methods give global equivalences which require consideration of CPT maps Φ : Md 7→Md′ with d ≥ d′.”
MethodInfluentialThe Structure and Quantum Capacity of a Partially Degradable Quantum Channel
Gyöngyösi, L. (2014) · IEEE Access · doi:10.1109/access.2014.2317652 · Cited by 15
“INTRODUCTION The quantum capacity [5]–[7] of degradable quantum channels has been proven to be additive [8].”
BackgroundUniform Additivity in Classical and Quantum Information
Cross, A. W., Li, K., & Smith, G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.040501 · Cited by 18
Public Quantum Communication and Superactivation
Brandao, F., & Oppenheim, J. (2013) · UCL Discovery (University College London) · Cited by 16
Detecting positive quantum capacities of quantum channels
Singh, S., & Datta, N. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00550-2 · Cited by 28
“(12) is not required only for certain special channels for which the coherent information is additive: Consequently, the quantum capacities of these channels admit nice single-letter expressions in terms of the channels’ coherent information Remark [DS05].”
BackgroundNonlocal quantum information in bipartite quantum error correction
Wilde, M. M., & Fattal, D. A. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0175-0 · Cited by 19
Extreme bosonic linear channels
Holevo, A. S. (2013) · Theoretical and Mathematical Physics · doi:10.1007/s11232-013-0026-0 · Cited by 16
Non-Markovianity as a Resource for Quantum Technologies
Bylicka, B., Chruściński, D., & Maniscalco, S. (2013) · arXiv · doi:10.48550/arxiv.1301.2585 · Cited by 16
“However, for degradable channels [25], the general definition coincide with Eq.”
BackgroundTransmission of classical and quantum information through a quantum memory channel with damping
D’Arrigo, A., Benenti, G., & Falci, G. (2012) · The European Physical Journal D · doi:10.1140/epjd/e2012-20593-7 · Cited by 14
A Relation Between Completely Bounded Norms and Conjugate Channels
Jenčová, A. (2006) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0035-z · Cited by 15
Quantum incompatibility of channels with general outcome operator algebras
Kuramochi, Y. (2018) · Journal of Mathematical Physics · doi:10.1063/1.5008300 · Cited by 17
Salek, F., Anshu, A., Hsieh, M.-H., Jain, R., & Fonollosa, J. R. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437856 · Cited by 12
“2This definition is in accord with the one given in [16].”
BackgroundResultQuantum communication on the bosonic loss-dephasing channel
Mele, F. A., Salek, F., Giovannetti, V., & Lami, L. (2024) · Physical Review A · doi:10.1103/physreva.110.012460 · Cited by 30
“Thanks to Corollary 35, a necessary condition for N 𝜆 , 𝛾 to be degradable is the degradability of the amplitude-phase damping channel N 𝜆 , 𝛾 .”
BackgroundInfluentialPreserving quantum information in f(Q) non-metric gravity cosmology
Capozzıello, S., Lapponi, A., Luongo, O., & Mancini, S. (2024) · The European Physical Journal C · doi:10.1140/epjc/s10052-024-13449-3 · Cited by 16
“A complete classification of OMGCs and the study of their properties or capacities are widely present in the literature [67–70].”
Capacity bounds via operator space methods
Gao, L., Junge, M., & LaRacuente, N. D. (2018) · Journal of Mathematical Physics · doi:10.1063/1.5058692 · Cited by 15
“Devetak and Shor in [16] proved that Q = Q (1) for degradable channels, those for which the environment can be retrieved from Bob’s output with the help of another channel.”
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.