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.”
BackgroundMethodInfluentialProof of the strong subadditivity of quantum-mechanical entropy
Lieb, E. H., & Ruskai, M. B. (1973) · Journal of Mathematical Physics · doi:10.1063/1.1666274 · Cited by 831
The 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 10×
“In particular, we show random father codes exist whose expected channel input is close to a product state (similar to result of the random quantum coding theorem in [6, App.”
BackgroundMethodInfluentialCapacity of the noisy quantum channel
Lloyd, S. (1997) · Physical Review A · doi:10.1103/physreva.55.1613 · Cited by 783 · cited 20×
“2) Quantum Capacity: The following theorem gives the 1-D quantum capacity region of a quantum channel [4]–[6].”
BackgroundInfluentialEntanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.802612 · Cited by 698 · cited 4×
“to explore if one could improve the classical capacity of a noisy quantum channel by assisting it with unlimited entanglement [10], [11].”
BackgroundInfluentialQuantum data processing and error correction
Schumacher, B., & Nielsen, M. A. (1996) · Physical Review A · doi:10.1103/physreva.54.2629 · Cited by 654 · cited 1×
“Yard’s thesis [21] provides a good introduction to quantum Shannon theory, and we point the reader there for properties such as strong subadditivity [22] and the quantum data processing inequality [23].”
BackgroundEntanglement-Assisted Classical Capacity of Noisy Quantum Channels
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.3081 · Cited by 610 · cited 5×
“So for our case, the following inequality: (41) holds because the protocol is -good for quantum communication according to the criterion in (10).”
BackgroundMethodInfluentialCoding theorem and strong converse for quantum channels
Winter, A. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796385 · Cited by 451 · cited 1×
“Let denote the following “pruned state”: (75) For any and sufficiently large , the state is close to by the gentle measurement lemma [36] and the typical subspace theorem [8] For any density operator , it is possible to construct an EAQ code that achieves the quantum communication rate and…”
BackgroundThe Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
Devetak, I., & Shor, P. W. (2005) · Communications in Mathematical Physics · doi:10.1007/s00220-005-1317-6 · Cited by 445 · cited 10×
“4) Classically enhanced quantum communication when there is no entanglement assistance [7].”
BackgroundMethodResultInfluentialA continuity property of the entropy density for spin lattice systems
Fannes, M. (1973) · Communications in Mathematical Physics · doi:10.1007/bf01646490 · Cited by 405 · cited 1×
“[27]): Suppose two states and are close Then, their respective entropies are close (34) is the dimension of the system and is the binary entropy function that has the property .”
BackgroundCodes for the quantum erasure channel
Grassl, M., Beth, T., & Pellizzari, T. (1997) · Physical Review A · doi:10.1103/physreva.56.33 · Cited by 374 · cited 2×
“The quantum erasure channel is perhaps one of the simplest noisy quantum channels [32], because it has a simple specifi-cation and its known transmission capacities admit simple formulas [33].”
BackgroundCapacities of Quantum Erasure Channels
Bennett, C. H., DiVincenzo, D. P., & Smolin, J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3217 · Cited by 365 · cited 2×
“The quantum erasure channel is perhaps one of the simplest noisy quantum channels [32], because it has a simple specifi-cation and its known transmission capacities admit simple formulas [33].”
BackgroundContinuity of quantum conditional information
Alicki, R., & Fannes, M. (2004) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/37/5/l01 · Cited by 256 · cited 1×
“Theorem 8 (Alicki–Fannes Inequality [28]): Suppose two states and are close Then, their respective coherent informations are close (35) Corollary 1: Suppose two states and are close Then, their respective quantum mutual informations are close (36) Proof: The proof follows in two steps by applying…”
BackgroundThe mother of all protocols: restructuring quantum information’s family tree
Abeyesinghe, A., Devetak, I., Hayden, P., & Winter, A. (2009) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2009.0202 · Cited by 246 · cited 3×
“We first establish some definitions relevant to an EAQ code, or father code for short, and recall the direct coding theorem for EAQ communication [13]–[15].”
BackgroundA Resource Framework for Quantum Shannon Theory
Devetak, I., Harrow, A. W., & Winter, A. J. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928980 · Cited by 208 · cited 10×
“One member of the family tree is the father protocol [13], [14].”
BackgroundMethodInfluentialOn quantum fidelities and channel capacities
Barnum, H., Knill, E., & Nielsen, M. A. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850671 · Cited by 199 · cited 1×
“This task is equivalent to the task of subspace transmission (quantum communication) by the methods in [31].”
MethodOn Quantum Fidelities and Channel Capacities
Barnum, H., Knill, E. H., & Nielsen, M. A. (2000) · Bristol Research (University of Bristol) · Cited by 157
Coding Theorems of Quantum Information TheoryPreprint
Winter, A. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9907077 · Cited by 154
Generalized remote state preparation: Trading cbits, qubits, and ebits in quantum communication
Abeyesinghe, A., & Hayden, P. M. (2003) · Physical Review A · doi:10.1103/physreva.68.062319 · Cited by 131 · cited 1×
“Previous work has addressed tradeoffs for the task of remotely preparing quantum states with the aid of classical communication, quantum communication, and entanglement [ 17 ], but no one has yet considered the triple tradeoffs for channel coding.”
BackgroundDevetak, I., Harrow, A. W., & Winter, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.230504 · Cited by 124 · cited 9×
“We dub this protocol the “CEF protocol” because it is an extension of the father protocol, and it generates five child protocols in the sense of [13], [14].”
BackgroundMethodInfluentialEntanglement-Assisted Capacity of Quantum Multiple-Access Channels
Hsieh, M.-H., Devetak, I., & Winter, A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924726 · Cited by 121 · cited 1×
“The ensemble , where each state is a pure tripartite state, is essential in the ensuing analysis of this 1 As a side note, we mention that former papers discuss the possibility of this protocol but never fully developed it [18], [14].”
BackgroundSelf-citationYard, J., Hayden, P., & Devetak, I. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924665 · Cited by 120 · cited 2×
“The above entropic quantities are with respect to a “one-shot” quantum state where (15) the states are pure, and it is sufficient to consider by the method in [25].”
BackgroundMethodRelating Quantum Privacy and Quantum Coherence: An Operational Approach
Devetak, I., & Winter, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.080501 · Cited by 116 · cited 3×
“After expurgation, the code forms a good EAQ code, resulting in failure with probability by the arguments in [6] and [37].”
MethodOptimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder
Yard, J. T., & Devetak, I. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030494 · Cited by 116 · cited 1×
“This method of efficiently coding classical and quantum information is the “piggybacking” technique introduced in [7] and applied again in [25] and [29].”
MethodTrade-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-citationTrading 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
Self-citationThe classical capacity achievable by a quantum channel assisted by limited entanglement
Shor, P. W. (2004) · Quantum Information and Computation · doi:10.26421/qic4.6-7-12 · Cited by 64
Trading 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-citationState redistribution as merging: introducing the coherent relayPreprint
Oppenheim, J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0805.1065 · Cited by 50
The quantum dynamic capacity formula of a quantum channel
Wilde, M. M., & Hsieh, M. H. (2012) · Civil War Book Review · Cited by 49
Self-citationClassical enhancement of quantum-error-correcting codes
Kremsky, I., Hsieh, M.-H., & Brun, T. A. (2008) · Physical Review A · doi:10.1103/physreva.78.012341 · Cited by 44 · cited 3×
“In [19], the other author constructed a CEF code that uses both ancilla qubits and ebits for encoding classical information.”
BackgroundMethodSelf-citationThe 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
Self-citationSimultaneous classical-quantum capacities of quantum multiple access channelsPreprint
Yard, J. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0506050 · Cited by 33 · cited 6×
“A conditional quantum encoder , or conditional quantum channel [21], is a collection of CPTP maps.”
BackgroundMethodInfluentialQuantum Information, Statistics, Probability
広田, 修. (2004) · Rinton Press eBooks · Cited by 30
The classical capacity achievable by a quantum channel assisted by a limited entanglement
Shor, P. W. (2004) · doi:10.5555/2011593.2011605 · Cited by 25
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 · cited 3×
“In [20], one of the authors constructed a CEF code that uses only ancilla qubits for encoding classical information.”
BackgroundMethodSelf-citationLocal purity distillation with bounded classical communication
Krovi, H., & Devetak, I. (2007) · Physical Review A · doi:10.1103/physreva.76.012321 · Cited by 20 · cited 1×
“If lies in the typical set , then we can construct a conditional permutation operation that permutes the elements of the input sequence as follows [39]: where (for “ garbage”) denotes the remaining symbols in .”
BackgroundSecret-key-assisted private classical communication capacity over quantum channels
Hsieh, M.-H., Luo, Z., & Brun, T. A. (2008) · Physical Review A · doi:10.1103/physreva.78.042306 · Cited by 17 · cited 1×
“Indeed, in [38], one of the current authors showed how to construct secret-key-assisted private classical codes for a quantum channel.”
BackgroundSelf-citationUnified Quantum Convolutional CodingPreprint
Wilde, M. M., & Brun, T. A. (2008) · Cited by 17
Self-citationThe classical capacity achievable by a quantum channel assisted by limited entanglementPreprint
Shor, P. W. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0402129
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
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.