The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
The mother of all protocols: restructuring quantum information’s family tree
Open accessAbstract
We give a simple, direct proof of the ‘mother’ protocol of quantum information theory. In this new formulation, it is easy to see that the mother, or rather her generalization to the fully quantum Slepian–Wolf protocol, simultaneously accomplishes two goals: quantum communication-assisted entanglement distillation and state transfer from the sender to the receiver. As a result, in addition to her other ‘children’, the mother protocol generates the state-merging primitive of Horodecki, Oppenheim and Winter, a fully quantum reverse Shannon theorem, and a new class of distributed compression protocols for correlated quantum sources which are optimal for sources described by separable density operators. Moreover, the mother protocol described here is easily transformed into the so-called ‘father’ protocol whose children provide the quantum capacity and the entanglement-assisted capacity of a quantum channel, demonstrating that the division of single-sender/single-receiver protocols into two families was unnecessary: all protocols in the family are children of the mother.
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
The ‘transition probability’ in the state space of a—algebra
Uhlmann, A. (1976) · Reports on Mathematical Physics · doi:10.1016/0034-4877(76)90060-4 · Cited by 1,649
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
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
Self-citationEntanglement-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 by
Black holes as mirrors: quantum information in random subsystems
Hayden, P., & Preskill, J. (2007) · Journal of High Energy Physics · doi:10.1088/1126-6708/2007/09/120 · Cited by 1,332
Self-citationThe Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Quantum autoencoders for efficient compression of quantum data
Romero, J., Olson, J. P., & Aspuru-Guzik, A. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa8072 · Cited by 559
Better Late than Never: Information Retrieval from Black Holes
Braunstein, S. L., Pirandola, S., & Życzkowski, K. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.101301 · Cited by 460
Quantum Error Correction in Scrambling Dynamics and Measurement-Induced Phase Transition
Choi, S., Bao, Y., Qi, X.-L., & Altman, E. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.030505 · Cited by 435
Local Random Quantum Circuits are Approximate Polynomial-Designs
Brandão, F. G. S. L., Harrow, A. W., & Horodecki, M. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2706-8 · Cited by 404
“Examples of the use of random unitaries, drawn from the Haar measure on the unitary group, include the encoding for almost every known protocol for sending information down a quantum channel [1], approximate encryption of quantum information [2], quantum data-hiding [2], information locking [2], and solving certain”
MethodMeasures and applications of quantum correlations
Adesso, G., Bromley, T. R., & Cianciaruso, M. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/47/473001 · Cited by 385
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
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
Random Quantum Circuits are Approximate 2-designs
Harrow, A. W., & Low, R. A. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0873-6 · Cited by 324
“model the evolution of black holes [22]. In Ref. [22], they conjecture that short random local quantum circuits are approximately 2-designs, and thus can be used for decoupling quantum systems (as in [2]). This, in turn, is used to make claims about the rate at which black holes leak information. While our model differ…”
MethodA mathematical theory of resources
Coecke, B., Fritz, T., & Spekkens, R. W. (2016) · Information and Computation · doi:10.1016/j.ic.2016.02.008 · Cited by 301
Computing quantum discord is NP-complete
Huang, Y. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033027 · Cited by 286
A Decoupling Approach to the Quantum Capacity
Hayden, P., Horodecki, M., Winter, A., & Yard, J. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000043 · Cited by 170
Self-citationEntanglement-Assisted Communication of Classical and Quantum Information
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2053903 · Cited by 112
“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].”
BackgroundEntanglement-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
The decoupling approach to quantum information theory
Dupuis, F. (2010) · arXiv · doi:10.48550/arxiv.1004.1641 · Cited by 90
Simple factorization of unitary transformations
de Guise, H., Di Matteo, O., & Sánchez-Soto, L. L. (2018) · Physical Review A · doi:10.1103/physreva.97.022328 · Cited by 70
Trading 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
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
Self-citationWeak Decoupling Duality and Quantum Identification
Hayden, P., & Winter, A. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191695 · Cited by 36
Self-citation
Metadata
- Authors
- Abeyesinghe, A., Devetak, I., Hayden, P., & Winter, A.
- Venue
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 2009-06-05
- Volume
- 465
- Issue
- 2108
- Pages
- 2537-2563
- ISSN
- 1364-5021 (ISSN-L)
- 1471-2946
- OpenAlex
- W2146720213
- Cited by
- 246
- References
- 4
- FWCI
- 16.26
- Type
- journal article
- Language
- en
- Open access
- green
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.