Entanglement-Assisted Communication of Classical and Quantum Information
Open accessThe DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Abstract
In this paper, we consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum (EAQ) channel. Our main result is a capacity theorem that gives a 3-D achievable rate region. Points in the region are rate triples, consisting of the classical communication rate, the quantum communication rate, and the entanglement consumption rate of a particular coding scheme. The crucial protocol in achieving the boundary points of the capacity region is a protocol that we name the classically enhanced father(CEF) protocol. The CEF protocol is more general than other protocols in the family tree of quantum Shannon theoretic protocols, in the sense that several previously known quantum protocols are now child protocols of it. The CEF protocol also shows an improvement over a timesharing strategy for the case of a qubit dephasing channel-this result justifies the need for simultaneous coding of classical and quantum information over an EAQ channel. Our capacity theorem is of a multiletter nature (requiring a limit over many uses of the channel), but it reduces to a single-letter characterization for at least three channels: the completely depolarizing channel, the quantum erasure channel, and the qubit dephasing channel.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
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
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703 · cited 1×
“…communication with limited entanglement [12], quantum communication (LSD) [4]–[6], combining CEF with entanglement distribution and superdense coding (CEF-SD-ED) as detailed in Section VI-F, the CEF protocol outlined in Section VI, and combining the CEF protocol with teleportation [24] (CEF-TP).”
MethodCommunication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470 · cited 1×
“Index Terms— Classically enhanced father (CEF) protocol, entanglement-assisted classical and quantum (EACQ) coding, en-tanglement-assisted quantum (EAQ) channel, quantum Shannon theory.”
BackgroundElements of Information Theory
Phoenix, S. J. D. (1992) · Journal of Modern Optics · doi:10.1080/09500349214551641 · Cited by 1,380
The 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 6×
“The closeness of each expected channel input to a product state allows us to apply the HSW coding theorem [1], [2] so that Bob can decode the classical message while causing almost no disturbance to the encoded quantum information.”
BackgroundMethodInfluential
Cited by
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
Self-citationQuantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
“Authors in [139] investigated the tradeoffs for channel coding both quantum and classical information over a noise-less entanglement-assisted quantum channel and proved that the proposed entanglement-assisted classical and quantum capacity theorem provides the achievable rates in the considered…”
Background(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.1203 · Cited by 330
“An unification of these quantities under a common formalism based on resource inequalities has been presented in (Abeyesinghe and Hayden, 32 2003; Abeyesinghe et al., 2009; Devetak, Harrow, and Winter, 2004, 2008; Hsieh and Wilde, 2010 a,b).”
BackgroundQuantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
“An unification of these quantities under a common formalism based on resource inequalities has been presented in (Abeyesinghe and Hayden, 32 2003; Abeyesinghe et al., 2009; Devetak, Harrow, and Winter, 2004, 2008; Hsieh and Wilde, 2010 a,b).”
Background(2016) · Quantum Information Theory · doi:10.1017/9781316809976.001 · Cited by 186
Self-citationCatalytic Quantum Error Correction
Brun, T. A., Devetak, I., & Hsieh, M.-H. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2313559 · Cited by 145
“Moreover, the latter can be made coherent [16], [19], [24]–[26] to recover the father protocol.”
BackgroundSelf-citationApproaches for approximate additivity of the Holevo information of quantum channels
Leditzky, F., Kaur, E., Datta, N., & Wilde, M. M. (2018) · Physical Review A · doi:10.1103/physreva.97.012332 · Cited by 136
“in (21) and (22) of Section4, respectively) that exhibited the usefulness of our approach. More generally, we note here that one can obtain single-letter upper bounds on the triple trade-o capacities [24,23,58,57] of approximately Hadamard channels, given that Hadamard channels are quite special, as their triple-trade…”
BackgroundSelf-citationResource convertibility and ordered commutative monoids
Fritz, T. A. (2015) · Mathematical Structures in Computer Science · doi:10.1017/s0960129515000444 · Cited by 119
“The formalism of resource inequalities has been used for example in [74, 75, 76, 77] and further developed in [78].”
MethodEntanglement-Assisted Quantum Turbo Codes
Wilde, M. M., Hsieh, M.-H., & Babar, Z. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292052 · Cited by 102
“It would be interesting to explore the performance of the other suggested code structures in Section X to determine if they could come close to achieving the optimal rates from quantum Shannon theory [61], [62].”
InfluentialSelf-citationEntropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes
Grassl, M., Huber, F., & Winter, A. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3149291 · Cited by 103
Trade-off capacities of the quantum Hadamard channels
Brádler, K., Hayden, P., Touchette, D., & Wilde, M. M. (2010) · Physical Review A · doi:10.1103/physreva.81.062312 · Cited by 80
Self-citationAcharya, J., Issa, I., Shende, N. V., & Wagner, A. B. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3015235 · Cited by 90
“Indeed, entanglement has been fruitfully exploited as a resource in a number of quantum information processing protocols [1]–[5].”
BackgroundBeyond Bits: A Review of Quantum Embedding Techniques for Efficient Information Processing
Khan, M. A., Aman, M. N., & Sikdar, B. (2024) · IEEE Access · doi:10.1109/access.2024.3382150 · Cited by 88
“This capability facilitates an exponential speedup in processing power for certain types of computations [8], [9].”
BackgroundTrading classical communication, quantum communication, and entanglement in quantum Shannon theory
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054532 · Cited by 68
“The proof of one of the octants is the converse proof in [31].”
BackgroundMethodInfluentialSelf-citationQuantum Rate Distortion, Reverse Shannon Theorems, and Source-Channel Separation
Datta, N., Hsieh, M.-H., & Wilde, M. M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2215575 · Cited by 75
“It is likely that this protocol uses much more entanglement than necessary for the purpose of entanglement-assisted quantum rate-distortion coding with classical channels, and it should be worthwhile to study the tradeoff between classical communication and entanglement consumption in more detail, as previous authors…”
MethodSelf-citationBotsinis, P., Ng, S. X., & Hanzo, L. (2013) · IEEE Access · doi:10.1109/access.2013.2259536 · Cited by 64
“Nevertheless, this does not limit the applications of the quantum algorithms, since at the time of writing substantial research efforts are devoted into quantum-based communications, where quantum information is conveyed over quantum channels [95]–[97], with particularly attractive applications in the field of optical…”
BackgroundThe quantum dynamic capacity formula of a quantum channel
Wilde, M. M., & Hsieh, M.-H. (2012) · Quantum Information Processing · doi:10.1007/s11128-011-0310-6 · Cited by 43
“[16,15,17] is that its computation for a general quantum channel is intractable.”
BackgroundMethodInfluentialSelf-citationMitigating 5G security challenges for next-gen industry using quantum computing
Mangla, C., Rani, S., Qureshi, N. M. F., & Singh, A. D. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.07.009 · Cited by 69
“Along with entangled based communication Devetak and Shor (2005); Hsieh and Wilde (2010), quantum-entanglement-assisted turbo codes Wilde et al. (2013) and two quantum channels having additive function providing tensor product Takeoka et al. (2014).”
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
“smitted information [44, 62, 15, 33, 36, 37], whether assisting resources are available [4, 63, 38, 18], or whether the sender and receiver would like to trade o dierent resources against each other [17, 16, 39]. 2 Summary of Results In this paper, we introduce the quantum interference channel, a natural generalizatio…”
BackgroundSelf-citationQuantum trade-off coding for bosonic communication
Wilde, M. M., Hayden, P. M., & Guha, S. (2012) · Physical Review A · doi:10.1103/physreva.86.062306 · Cited by 64
Self-citationThe apex of the family tree of protocols: optimal rates and resource inequalities
Datta, N., & Hsieh, M.-H. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/9/093042 · Cited by 69
Self-citationTrading classical communication, quantum communication, and entanglement in quantum Shannon Theory
Hsieh, M.-H., & Wilde, M. M. (2010) · Civil War Book Review · Cited by 57
Self-citationOne-Shot Entanglement-Assisted Quantum and Classical Communication
Datta, N., & Hsieh, M.-H. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2228737 · Cited by 65
Self-citationInformation 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
Self-citationThe learnability of unknown quantum measurements
Cheng, H., Hsieh, M.-H., & Yeh, P. (2016) · Quantum Information and Computation · doi:10.26421/qic16.7-8-4 · Cited by 51
Self-citationPublic 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 36
“[31]): fμ (N ) ≡ max ρ I (X;B)ρ + I (A〉BX)ρ + μI (A〉BX)ρ , where ρ is a state of the form ρ ≡ ∑”
BackgroundResultInfluentialSelf-citationEntanglement 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
Self-citationEXIT-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
“[25] M.M.Wilde andM.”
BackgroundInfluentialAcharya, J., Issa, I., Shende, N. V., & Wagner, A. B. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849572 · Cited by 32
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 37
“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]).”
BackgroundMethodSuperadditivity 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
“Coincidentally, these two classes of channels also admit an additive CQE tradeoff capacity, suggesting a non-trivial connection [13, 22, 32].”
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
Capacities of quantum amplifier channels
Qi, H., & Wilde, M. M. (2017) · Physical Review A · doi:10.1103/physreva.95.012339 · Cited by 26
Self-citationSuperadditivity 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-citationEntanglement-assisted classical capacities of compound and arbitrarily varying quantum channels
Boche, H., Janßen, G., & Kaltenstadler, S. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1538-6 · Cited by 26
“It is possible to derive coding constructions and protocols for several other important quantum communication tasks, by making entanglement-assisted classical message transmission codes coherent [21], [28].”
BackgroundEntanglement-Assisted Quantum Error-Correcting Codes
Devetak, I., Brun, T. A., & Hsieh, M.-H. (2009) · New Trends in Mathematical Physics · doi:10.1007/978-90-481-2810-5_14 · Cited by 22
Self-citationThe mathematical structure of theories of resource convertibility IPreprint
Fritz, T. A. (2015) · arXiv (Cornell University) · Cited by 22
Routing protocol for wireless ad hoc quantum communication network based on quantum teleportation
Yu, X., Jin, X., & Zai-Chen, Z. (2012) · Acta Physica Sinica · doi:10.7498/aps.61.220303 · Cited by 22
Pereg, U., Deppe, C., & Boche, H. (2021) · mediaTUM (Technical University of Munich) · doi:10.1109/tit.2021.3050529 · Cited by 21
Adnane, B., Moqine, Y., Houça, R., Belouad, A., & Choubabi, E. B. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03974-7 · Cited by 21
“Non-local quantum correlations arising from entanglement and the appearance of a violation of the laws of relativistic causality allowed physicists to make detailed theoretical studies [10, 11] and also in practice [12–14].”
BackgroundPublic 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
Self-citationEntanglement-assisted concatenated quantum codes
Fan, J., Li, J., Zhou, Y., Hsieh, M.-H., & Poor, H. V. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2202235119 · Cited by 23
“As an important physical resource, entanglement can boost the classical information capacity of quantum channels [2, 22, 23, 25, 28, 27].”
Self-citationApproaching the Quantum Singleton Bound with Approximate Error Correction
Bergamaschi, T., Golowich, L., & Gunn, S. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649680 · Cited by 26
“[21,30,50, 55, 69, 74] proved Singleton bounds and other upper bounds on the capacity of quantum codes, even in the presence of quantum or classical side-channels.”
BackgroundQuantum-Enabled Communication without a Phase Reference
Zhuang, Q. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.060502 · Cited by 17
One-shot quantum error correction of classical and quantum information
Nakata, Y., Wakakuwa, E., & Yamasaki, H. (2021) · Physical Review A · doi:10.1103/physreva.104.012408 · Cited by 18
“[22].”
BackgroundSequential, successive, and simultaneous decoders for entanglement-assisted classical communication
Xu, S., & Wilde, M. M. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0410-y · Cited by 14
“For this reason, one could argue that these protocols and their noisy generalizations [10, 29, 30] make quantum information theory [31, 37] richer than its classical counterpart [7].”
BackgroundSelf-citationCommunication With Unreliable Entanglement Assistance
Pereg, U., Deppe, C., & Boche, H. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3253600 · Cited by 19
“The tradeoff between transmission, leakage, key, and entanglement rates is studied extensively in the literature as well [21], [22], [23], [24], [25], [26], [27], [28], and [29].”
Li, C.-K., Lyles, S., & Poon, Y. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02639-z · Cited by 16
“] Similarly, we can check the formula (Pt 2kX kP ;P t 2k Y 2P ;P t 2k Z P ) = (D X I 2 2k ;( 1) k 1D Y I 2 2k ;D Z I 2 2k by calculating (for k= 3) respectively as follows: Norm[Transpose[R[3]].X[6].R[3] - KroneckerProduct[DX,IdentityMatrix[2^4]]] Norm[Transpose[R[3]].Y[6].R[3] - (-1)^2*KroneckerProduct[DY,IdentityMat…”
BackgroundMethodInfluentialNew Lower Bounds to the Output Entropy of Multi-Mode Quantum Gaussian Channels
Palma, G. D. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2914434 · Cited by 14
Trade-off coding for universal qudit cloners motivated by the Unruh effect
Jochym-O’Connor, T., Brádler, K., & Wilde, M. M. (2011) · Journal of Physics A Mathematical and Theoretical · doi:10.48550/arxiv.1103.0286 · Cited by 12
“in (11). 2.3.3 Quantum Dynamic Capacity Region Finally, the capacity region for entanglement-assisted transmission of quantum and classical information (CQE) is characterized by the following region [18]: CCQE(N) ≡ [∞ k=1 1 k C(1) CQE(N⊗k), (15) where again the “one-shot” region C(1) CQE(N) is defined to be the union o…”
BackgroundMethodInfluentialSelf-citationCapacities of Grassmann channels
Brádler, K., Jochym-O’Connor, T., & Jáuregui, R. (2011) · Journal of Mathematical Physics · doi:10.1063/1.3597233 · Cited by 11
Stabilizer Formalism for Operator Algebra Quantum Error Correction
Dauphinais, G., Kribs, D. W., & Vasmer, M. (2024) · Quantum · doi:10.22331/q-2024-02-21-1261 · Cited by 22
“Subsequently, a further generalization was discovered, called ‘operator algebra quantum error correction’ (OAQEC) [9,10], which additionally provided an approach for hybrid classical-quantum and infinite-dimensional error correction [11, 21, 36, 37, 45].”
MethodHigher rank matricial ranges and hybrid quantum error correction
Cao, N., Kribs, D. W., Li, C.-K., Nelson, M. I., Poon, Y., & Zeng, B. (2020) · Linear and Multilinear Algebra · doi:10.1080/03081087.2020.1748852 · Cited by 15
“g the tasks of transmitting both quantum and classical information together compared to independent solutions have been discovered, from both information theoretic and coding theoretic points of view [25, 26, 27, 28, 29, 30, 11, 12]. Additionally it is felt that these hybrid codes may find applications in physical 2010…”
BackgroundChannel capacities via p-summing norms
Junge, M., & Palazuelos, C. (2014) · Advances in Mathematics · doi:10.1016/j.aim.2014.12.005 · Cited by 11
Asymmetric Quantum Concatenated and Tensor Product Codes With Large Z-Distances
Fan, J., Li, J., Wang, J., Wei, Z., & Hsieh, M.-H. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3064566 · Cited by 10
Self-citationBassoli, R., Boche, H., Deppe, C., Ferrara, R., Fitzek, F. H. P., Janßen, G., & Saeedinaeeni, S. (2020) · Foundations in signal processing, communications and networking · doi:10.1007/978-3-030-62938-0_4 · Cited by 10
A Unification of the Coding Theory and OAQEC Perspectives on Hybrid Codes
Majidy, S. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05439-0 · Cited by 14
“This work has since been followed by many authors [2–8].”
ResultAn improved control mode for the ping-pong protocol operation in imperfect quantum channels
Zawadzki, P. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0989-x · Cited by 9
Performance Analysis of Quantum Based Cloud Radio Access Networks
Khalif, B. N. A., Hasan, J. A. K., Alhumaima, R. S., & Al-Raweshidy, H. S. (2019) · IEEE Access · doi:10.1109/access.2019.2925902 · Cited by 12
“The classical information was sent using quantum entanglement assisted channel between two parties, where the quantum, classical and power consumption rates while using coding schemes are all evaluated [33].”
MethodCB-Norm Estimates for Maps Between NoncommutativeLp-Spaces and Quantum Channel Theory
Junge, M., & Palazuelos, C. (2015) · International Mathematics Research Notices · doi:10.1093/imrn/rnv161 · Cited by 11
“Interestingly, the quantity C(Dλ) has been also studied in some other works by using different techniques ([13], [41]) and its exact value seems to be unknown.”
Quality of Service of Quantum Entanglement in Mobile Networks
Al-Karawi, Y., Alhumaima, R. S., & Al-Raweshidy, H. S. (2021) · IEEE Access · doi:10.1109/access.2021.3136782 · Cited by 11
One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
Wakakuwa, E., & Nakata, Y. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3222775 · Cited by 11
“First, we review a complete characterization of the achievable rate region, which was obtained by Hsieh and Wilde [14].”
BackgroundMethodResultInfluentialNemec, A., & Klappenecker, A. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437497 · Cited by 9
“For instance, Hsieh and Wilde [4] considered the problem of simultaneous transmission of classical and quantum information over an entanglement-assisted quantum channel.”
BackgroundSingle-Serving Quantum Broadcast Channel With Common, Individualized, and Confidential Messages
Salek, F., Hsieh, M.-H., & Fonollosa, J. R. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3013098 · Cited by 8
Self-citationBoche, H., Janßen, G., & Saeedinaeeni, S. (2019) · Journal of Mathematical Physics · doi:10.1063/1.5078430 · Cited by 8
“that the alternative characterization could entail larger one-shot regions compared to our Cˆ(Ns,p,Ψ). An instance of such a characterization in the case of perfectly known quantum channels exists in [19] Theorem 5. Therein however, the authorsnotethat their one-shot trapezoidsis the same asrectangular regions offered…”
BackgroundMethodInfluentialKey Assistance, Key Agreement, and Layered Secrecy for Bosonic Broadcast Channels
Pereg, U., Ferrara, R., & Bloch, M. R. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw48936.2021.9611359 · Cited by 8
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
Explicit decoders using fixed-point amplitude amplification based on QSVT
Utsumi, T., & Nakata, Y. (2026) · Quantum · doi:10.22331/q-2026-03-13-2024 · Cited by 8
Noisy Quantum State Redistribution With Promise and the Alpha-Bit
Anshu, A., Hsieh, M.-H., & Jain, R. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3021289 · Cited by 7
“In this case we compose the best known protocols for state redistribution with the best known entanglement assisted protocols for transfer of quantum information through noisy channels [21]–[26].”
MethodSelf-citationBoche, H., Janßen, G., & Saeedinaeeni, S. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2358-7 · Cited by 8
Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes
Mamindlapally, M., & Winter, A. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3277808 · Cited by 10
“For us, the paper by Hsieh and Wilde [18] is fundamental, which derives a multi-letter capacity formula for the triple tradeoff, of which we take the converse proof and develop it in several directions.”
BackgroundMethodInfluentialQuantum communication over bit flip channels using entangled bipartite and tripartite states
Raina, A., & Srinivasa, S. G. (2014) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2014.7028615 · Cited by 6
Encoding 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
“Devetak and Shor [1] showed for certain small error rates that simultaneous transmission is superior to the time-sharing of a quantum channel, and subsequent work on the topic has been focused primarily on information-theoretic results [2, 3, 4].”
BackgroundMethodInfluentialThe Primary Role of the Electric Near-Field in Brain Function
Morgera, S. D. (2018) · InTech eBooks · doi:10.5772/intechopen.71945 · Cited by 5
Randomized Partial Decoupling Unifies One-Shot Quantum Channel CapacitiesPreprint
Wakakuwa, E., & Nakata, Y. (2020) · arXiv (Cornell University) · Cited by 5
Codes for entanglement-assisted classical communication
Prasad, T., & Grassl, M. (2025) · npj Quantum Information · doi:10.1038/s41534-024-00954-2 · Cited by 6
Capacity of multiple-input multiple-output quantum depolarizing channels
Xiao, H., & Ouyang, S. (2012) · Journal of Applied Physics · doi:10.1063/1.4739764 · Cited by 4
Three-Party Quantum Network Communication Protocols Based on Quantum Teleportation
Zhou, N., Cheng, H.-L., Gong, L.-H., & Li, C. (2013) · International Journal of Theoretical Physics · doi:10.1007/s10773-013-1936-1 · Cited by 4
Quantum and Classical Hybrid Generations for Classical Correlations
Lin, X., Wei, Z., & Yao, P. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3123401 · Cited by 4
Relativistic Quantum Communication
Hosler, D. (2013) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York) · doi:10.48550/arxiv.1306.4853 · Cited by 4
“There are two main families, those derived from the mother protocol and those from the father protocol [49].”
BackgroundFoundations of In-Network Quantum Computing for Future Communication Networks
Bock, Y. N., Boche, H., Bassoli, R., & Fitzek, F. H. P. (2024) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn61486.2024.10637517 · Cited by 4
“The reliability and transmission rates of many forms of classical, secure, and quantum communication benefit directly from adding entangled quantum states as an auxiliary network resource [33, 34, 35, 36, 37, 38].”
BackgroundUnified and Generalized Approach to Entanglement-Assisted Quantum Error Correction
Nadkarni, P. J., Adonsou, S., Dauphinais, G., Kribs, D. W., & Vasmer, M. (2026) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2026.3692012 · Cited by 4
“These latest advances helped to provide the impetus to develop a stabilizer formalism for OAQEC, and very recently, this was accomplished for finite-dimensional cases in [45].”
The resource theory of causal influence and knowledge of causal influence
Ansanelli, M. M., Zjawin, B., Schmid, D., Yīng, Y., Selby, J. H., Gilligan-Lee, C. M., Sainz, A. B., & Spekkens, R. W. (2026) · New Journal of Physics · doi:10.1088/1367-2630/aeb568 · Cited by 3
“In this vein, it is worth noting that the quantum analogue of Shannon is the theory of quantum channels where we allow shared entanglement between the sender and receiver [25].”
Nonbinary Error-Detecting Hybrid Codes
Nemec, A., & Klappenecker, A. (2020) · American Journal of Science & Engineering · doi:10.15864/ajse.1201 · Cited by 3
Skew Constacyclic Codes over a Non-Chain Ring
Köroğlu, M. E., & Sarı, M. (2023) · Entropy · doi:10.3390/e25030525 · Cited by 3
“For an [[n, k, d; c]]q EAQECC, the number c of maximally entanglement states based on the linear codes is less than or equal to n − k, and if c = n − k, then this is called an EAQECC with maximal entanglement [51].”
Li, L., Cao, Z., Wu, T., & Liu, L. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04534-3 · Cited by 2
Mitigating X2‐AP interface cost using quantum teleportation
Alhumaima, R. S., Alwan, S. T., & Ahmed, R. K. (2020) · IET Networks · doi:10.1049/iet-net.2019.0230 · Cited by 3
“The researchers of [39] have used the free space to experimentally distribute the entangled photons over a distance of 13.5 km.”
InfluentialShared entanglement for three-party causal order guessing game
Kukulski, R., Lewandowska, P., & Życzkowski, K. (2025) · New Journal of Physics · doi:10.1088/1367-2630/ada4d2 · Cited by 1
“Utilizing quantum bits for communication and sharing entanglement [9] between parties is one of the recognized methods to enhance the likelihood of success in communication scenarios.”
MethodQuantum teleportation over hyper entangled states
Raina, A., & Srinivasa, S. G. (2015) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2015.7308996 · Cited by 1
Entanglement-Assisted Classical Communication
Wilde, M. M. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139525343.021 · Cited by 1
Self-citationBoche, H., Janßen, G., & Saeedinaeeni, S. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849791 · Cited by 1
Pereg, U., Deppe, C., & Boche, H. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw46852.2021.9457622 · Cited by 14
“information of a quantum point to point channel were drawn in [107]. Related models appear in [108–113] as well. The entanglement-assisted secrecy capacity was determined by Qi et al. [114] (see also [66,115]). Boche et al. [14,116] studied the quantum wiretap channel with an active jammer. Furthermore, the capacity-e…”
BackgroundBassoli, R., Boche, H., Deppe, C., Ferrara, R., Fitzek, F. H. P., Janßen, G., & Saeedinaeeni, S. (2020) · Foundations in signal processing, communications and networking · doi:10.1007/978-3-030-62938-0_1 · Cited by 1
Singleton bounds for entanglement-assisted classical and quantum error correcting codes
Mamindlapally, M., & Winter, A. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834561 · Cited by 1
“We have shown that one can adapt the information theoretic converse proofs of Hsieh and Wilde [28] and of Wilde [29] for the triple-tradeoff region of communication over a general channel to the one-shot setting.”
BackgroundMethodInfluential樊, J.-H. 继. F., 夏, P.-W. 沛. X., 戴, D.-K. 迪. D., & 陈, Y.-X. 一. C. (2023) · Chinese Physics B · doi:10.1088/1674-1056/acf492 · Cited by 1
The implementation of hybrid codes and nuclear magnetic resonance quantum information processing
Majidy, S. (2017) · The Atrium (University of Guelph) · Cited by 1
Glisic, S., & Lorenzo, B. (2022) · Wiley eBooks · doi:10.1002/9781119790327.ch14 · Cited by 1
Quantum complementarity and operator structures
Kribs, D. W., Livick, J., Nelson, M. I., Perira, R., & Rahaman, M. (2019) · Quantum Information and Computation · doi:10.26421/qic19.1-2-5 · Cited by 10
“This linkage of two fundamental topics in quantum information has more recently [14] been extended to the complementarity of appropriate notions of correctable operator algebras [6, 7] and private subsystems and algebras [1, 9, 2, 3, 13, 22, 23, 34, 35, 14], and to a setting that embraces descriptions of hybrid classi…”
BackgroundParameter Regime Giving Zero Quantum Coherent Information of A Non-Pauli Quantum Channel
Liu, T. (2015) · The Atrium (University of Guelph)
Metadata
- Authors
- Hsieh, M.-H., & Wilde, M. M.
- Affiliations
- Japan Science and Technology Agency (JP)
- Centre for Quantum Technologies (SG)
- Venue
- IEEE Transactions on Information Theory
- Published
- 2010-09
- Volume
- 56
- Issue
- 9
- Pages
- 4682-4704
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2127688694
- Cited by
- 112
- References
- 48
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 5 · 2023: 8 · 2022: 9 · 2021: 9 · 2020: 13 · 2019: 9 · 2018: 4 · 2017: 7 · 2016: 3 · 2015: 6 · 2014: 6 · 2013: 6 · 2012: 12
- FWCI
- 8.80
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Civil War Book Review (submittedVersion)
- UTS ePRESS (University of Technology Sydney) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Center for Theoretical Sciences
- Ministère du Développement Économique, de l’Innovation et de l’Exportation
- National Research Foundation Singapore
- Ministry of Education - Singapore
- 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 Shannon theory, capacity region, quantum erasure channel, time-sharing, single-letter characterization
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.