The DOI matches its Crossref record; 384 of the 384 references it cites were found in a registry or an index.
Quantum Information Theory
Abstract
What are the information processing capabilities of physical systems?As recently as the first half of the 20 th century this question did not even have a definite meaning.What is information, and how would one process it?It took the development of theories of computing (in the 1930s) and information (late in the 1940s) for us to formulate mathematically what it means to compute or communicate.Yet these theories were abstract, based on axiomatic mathematics: what did physical systems have to do with these axioms?Rolf Landauer had the essential insight -"Information is physical" -that information is always encoded in the state of a physical system, whose dynamics on a microscopic level are well-described by quantum physics.This means that we cannot discuss information without discussing how it is represented, and how nature dictates it should behave.Wigner considered the situation from another perspective when he wrote about "the unreasonable effectiveness of mathematics in the natural sciences".Why are the computational techniques of mathematics so astonishingly useful in describing the physical world [1]?One might begin to suspect foul play in the universe's operating principles.Interesting insights into the physics of information accumulated through the 1970s and 1980s -most sensationally in the proposal for a "quantum computer".If we were to mark a particular year in which an explosion of interest took place in information physics, that year would have to be 1994, when Shor showed that a problem of practical interest (factorisation of integers) could be solved easily on a quantum computer.But the applications of information in physics -and vice versa -have been far more widespread than this popular discovery.These applications range from improved experimental technology, more sophisticated measurement techniques, methods for characterising the quantum/classical boundary, tools for quantum chaos, and deeper insight into quantum theory and nature.In this thesis I present a short review of ideas in quantum information theory.The first chapter contains introductory material, sketching the central ideas of probability and information theory.Quantum mechanics is presented at the level of advanced undergraduate knowledge, together with some useful tools for quantum mechanics of open systems.In the second chapter I outline how classical information is represented in quantum systems and what this means for agents trying to extract information from these systems.The final chapter presents a new resource: quantum information.This resource has some bewildering applications which have been discovered in the last ten years, and continually presents us with unexpected insights into quantum theory and the universe.ii This thesis is dedicated to my mother.iii This thesis was begun as an intrepid adventure.It caught
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
Items 201–384 of 384
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
Mosca, M., & EKERT, A. K. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_15 · Cited by 179
Uncertainty Relations from Simple Entropic Properties
Coles, P. J., Colbeck, R., Yu, L., & Zwolak, M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.210405 · Cited by 178
The Mathematical Language of Quantum Theory: From Uncertainty to Entanglement
Heinosaari, T., & Ziman, M. (2012) · CERN Document Server (European Organization for Nuclear Research) · Cited by 174
Experimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Anton, Z. (1998) · Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.1998.0245 · Cited by 174
Hayashi, M. (2007) · Physical Review A · doi:10.1103/physreva.76.062301 · Cited by 174
Nielsen, M. A., & Chuang, I. L. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9780511976667.016 · Cited by 173
Strong converse to the quantum channel coding theorem
Ogawa, T., & Nagaoka, H. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796386 · Cited by 173
Additivity of the Classical Capacity of Entanglement-Breaking Quantum Channels
Shor, P. W. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 172
Information-capacity description of spin-chain correlations
Giovannetti, V., & Fazio, R. (2005) · Physical Review A · doi:10.1103/physreva.71.032314 · Cited by 171
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
Recoverability in quantum information theory
Wilde, M. M. (2015) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2015.0338 · Cited by 169
Small Accessible Quantum Information Does Not Imply Security
König, R., Renner, R., Bariska, A., & Maurer, U. M. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.140502 · Cited by 169
Quantum cloning without signaling
Gisin, N. (1998) · Physics Letters A · doi:10.1016/s0375-9601(98)00170-4 · Cited by 164
Properties of Conjugate Channels with Applications to Additivity and MultiplicativityPreprint
King, C., Matsumoto, K., Nathanson, M., & Ruskai, M. B. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0509126 · Cited by 158
Coding Theorems of Information Theory.
Good, I. J., & Wolfowitz, J. (1962) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2982637 · Cited by 158
On Quantum Fidelities and Channel Capacities
Barnum, H., Knill, E. H., & Nielsen, M. A. (2000) · Bristol Research (University of Bristol) · Cited by 157
Boojums All the Way through: Communicating Science in a Prosaic Age
Mermin, N. D. (1990) · Cambridge University Press eBooks · doi:10.1017/cbo9780511608216 · Cited by 156
Coding Theorems of Quantum Information TheoryPreprint
Winter, A. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9907077 · Cited by 154
Mermin, N. D. (1994) · American Journal of Physics · doi:10.1119/1.17733 · Cited by 149
Degenerate Quantum Codes for Pauli Channels
Smith, G., & Smolin, J. A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.030501 · Cited by 147
Yard, J., Hayden, P. M., & Devetak, I. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924665 · Cited by 147
Entanglement-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 143
Approximate Quantum Error Correction
Schumacher, B., & Westmoreland, M. D. (2002) · Quantum Information Processing · doi:10.1023/a:1019653202562 · Cited by 142
Machines, Logic and Quantum Physics
Deutsch, D., EKERT, A. K., & Lupacchini, R. (2000) · Bulletin of Symbolic Logic · doi:10.2307/421056 · Cited by 138
Minimum output entropy of bosonic channels: A conjecture
Giovannetti, V., Guha, S., Lloyd, S., Maccone, L., & Shapiro, J. H. (2004) · Physical Review A · doi:10.1103/physreva.70.032315 · Cited by 138
Relating Quantum Privacy and Quantum Coherence: An Operational Approach
Devetak, I., & Winter, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.080501 · Cited by 136
Yard, J., Hayden, P. M., & Devetak, I. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165811 · Cited by 135
Optimal Quantum Source Coding With Quantum Side Information at the Encoder and Decoder
Yard, J., & Devetak, I. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030494 · Cited by 135
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
Classical data compression with quantum side information
Devetak, I., & Winter, A. (2003) · Physical Review A · doi:10.1103/physreva.68.042301 · Cited by 130
I. Nineteenth century clouds over the dynamical theory of heat and light
Kelvin, L. (1901) · The London Edinburgh and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440109462664 · Cited by 129
Cooney, T., Mosonyi, M., & Wilde, M. M. (2014) · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · Cited by 123
Statistical problems in quantum physics
Holevo, A. S. (1973) · Lecture notes in mathematics · doi:10.1007/bfb0061483 · Cited by 121
Entanglement measures and the Hilbert-Schmidt distance
Ozawa, M. (2000) · CERN Document Server (European Organization for Nuclear Research) · Cited by 121
Private Capacity of Quantum Channels is Not Additive
Li, K., Winter, A., Zou, X., & Guo, G. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.120501 · Cited by 120
A.: Remote preparation of quantum states
Bennett, C. H., Hayden, P. M., Leung, D., Shor, P. W., & Winter, A. (2003) · Bristol Research (University of Bristol) · Cited by 120
The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory
Berta, M., Christandl, M., & Renner, R. (2011) · reroDoc Digital Library · doi:10.3929/ethz-b-000038997 · Cited by 119
Divincenzo, D. P., Fuchs, C. A., Mabuchi, H., Smolin, J. A., Thapliyal, A. V., & Uhlmann, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_21 · Cited by 113
Gupta, M. K., & Wilde, M. M. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2212-9 · Cited by 113
Entanglement-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
Finite Blocklength Converse Bounds for Quantum Channels
Matthews, W., & Wehner, S. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2353614 · Cited by 112
Quantum Information Processing with Finite Resources -- Mathematical Foundations
Tomamichel, M. (2015) · International Linear Collider · doi:10.48550/arxiv.1504.00233 · Cited by 112
Quantum Privacy and Quantum Coherence
Schumacher, B. W., & Westmoreland, M. D. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.5695 · Cited by 110
García−Patrón, R., Pirandola, S., Lloyd, S., & Shapiro, J. H. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.210501 · Cited by 108
A Strong Converse for Classical Channel Coding Using Entangled Inputs
König, R., & Wehner, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.070504 · Cited by 106
Quantum communication with Gaussian channels of zero quantum capacity
Smith, G., Smolin, J. A., & Yard, J. (2011) · Nature Photonics · doi:10.1038/nphoton.2011.203 · Cited by 105
Coherent Communication of Classical Messages
Harrow, A. W. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.097902 · Cited by 105
Distinguishability of states and von Neumann entropy
Jozsa, R., & Schlienz, J. (2000) · Physical Review A · doi:10.1103/physreva.62.012301 · Cited by 104
Lo, H., & Popescu, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1459 · Cited by 104
Rényi generalizations of the conditional quantum mutual information
Berta, M., Seshadreesan, K. P., & Wilde, M. M. (2015) · Journal of Mathematical Physics · doi:10.1063/1.4908102 · Cited by 104
Mathematical techniques for quantum communication theory
Fuchs, C. A., & Caves, C. M. (1995) · Open Systems & Information Dynamics · doi:10.1007/bf02228997 · Cited by 101
Unbounded number of channel uses may be required to detect quantum capacity
Cubitt, T. S., Elkouss, D., Matthews, W., Ozols, M., Pérez-García, D., & Strelchuk, S. (2015) · Nature Communications · doi:10.1038/ncomms7739 · Cited by 101
Universal Quantum Information Compression
Jozsa, R., Horodecki, M., Horodecki, P., & Horodecki, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.1714 · Cited by 100
The early days of information theory
Pierce, J. R. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1054955 · Cited by 100
Estimating Mutual Information Via Kolmogorov Distance
Zhang, Z. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.903122 · Cited by 99
Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
Ogawa, T., & Nagaoka, H. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.896874 · Cited by 98
Quantum capacities of channels with small environment
Wolf, M. M., & Pérez-García, D. (2007) · Physical Review A · doi:10.1103/physreva.75.012303 · Cited by 97
Entanglement Cost of Quantum Channels
Berta, M., Brandão, F. G. S. L., Christandl, M., & Wehner, S. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2268533 · Cited by 97
Information-theoretic characterization of quantum chaos
Schack, R., & Caves, C. M. (1996) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.53.3257 · Cited by 96
Quantum nondemolition and gravity-wave detection
Unruh, W. G. (1979) · Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields · doi:10.1103/physrevd.19.2888 · Cited by 96
On the optimum rate of transmitting information
Kemperman, J. H. B. (1969) · Lecture notes in mathematics · doi:10.1007/bfb0079123 · Cited by 96
Structured Codes Improve the Bennett-Brassard-84 Quantum Key Rate
Smith, G., Renes, J. M., & Smolin, J. A. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.170502 · Cited by 95
Ensemble-Dependent Bounds for Accessible Information in Quantum Mechanics
Fuchs, C. A., & Caves, C. M. (1994) · Physical Review Letters · doi:10.1103/physrevlett.73.3047 · Cited by 93
Private classical capacity with a symmetric side channel and its application to quantum cryptography
Smith, G. (2008) · Physical Review A · doi:10.1103/physreva.78.022306 · Cited by 92
Maxwell’s Demon, Szilard’s Engine and Quantum Measurements
Zurek, W. H. (1986) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4613-2181-1_11 · Cited by 91
A Father Protocol for Quantum Broadcast Channels
Dupuis, F., Hayden, P. M., & Li, K. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046217 · Cited by 91
The decoupling approach to quantum information theory
Dupuis, F. (2010) · arXiv · doi:10.48550/arxiv.1004.1641 · Cited by 90
Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map
Sutter, D., Tomamichel, M., & Harrow, A. W. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2545680 · Cited by 90
Quantum redundancies and local realism
Horodecki, R., & Horodecki, P. (1994) · Physics Letters A · doi:10.1016/0375-9601(94)91275-0 · Cited by 90
Smooth Entropies and the Quantum Information Spectrum
Datta, N., & Renner, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018340 · Cited by 89
Quantum Conditional Mutual Information, Reconstructed States, and State Redistribution
Brandão, F. G. S. L., Harrow, A. W., Oppenheim, J., & Strelchuk, S. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.050501 · Cited by 89
A convexity theorem for certain groups of transformations
Hirschman, I. I. (1952) · Journal d Analyse Mathématique · doi:10.1007/bf02825637 · Cited by 88
Trade-off capacities of the quantum Hadamard channels
Brádler, K., Hayden, P. M., Touchette, D., & Wilde, M. M. (2010) · Physical Review A · doi:10.1103/physreva.81.062312 · Cited by 87
General fidelity limit for quantum channels
Barnum, H., Fuchs, C. A., Jozsa, R., & Schumacher, B. W. (1996) · Physical Review A · doi:10.1103/physreva.54.4707 · Cited by 86
Achievable rates for the Gaussian quantum channel
Harrington, J., & Preskill, J. P. (2001) · Physical Review A · doi:10.1103/physreva.64.062301 · Cited by 86
Asymptotic relative entropy of entanglement for orthogonally invariant states
Audenaert, K., Moor, B. D., Vollbrecht, K. G. H., & Werner, R. F. (2002) · Physical Review A · doi:10.1103/physreva.66.032310 · Cited by 84
Communication cost of entanglement transformations
Hayden, P. M., & Winter, A. (2003) · Physical Review A · doi:10.1103/physreva.67.012326 · Cited by 82
Quantum electronics and coherent light
Townes, C. H., Miles, P. A., Durán, R. C., Ramírez, J. J., & Flores, K. V. (1964) · Cited by 82
On entanglement-assisted classical capacity
Holevo, A. S. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 81
HASTINGS’S ADDITIVITY COUNTEREXAMPLE VIA DVORETZKY’S THEOREM
Aubrun, G., Szarek, S. J., & Werner, E. M. (2013) · Cited by 79
Quantum coding with finite resources
Tomamichel, M., Berta, M., & Renes, J. M. (2016) · Nature Communications · doi:10.1038/ncomms11419 · Cited by 78
Multiplicativity of completely bounded p-norms implies a new additivity result
Devetak, I., Junge, M., King, C., & Ruskai, M. B. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 78
Comments on Hastings’ Additivity Counterexamples
Fukuda, M., King, C., & Moser, D. K. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-010-0996-9 · Cited by 77
Classical model for bulk-ensemble NMR quantum computation
Schack, R., & Caves, C. M. (1999) · Physical Review A · doi:10.1103/physreva.60.4354 · Cited by 76
Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions
Datta, N., & Leditzky, F. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2366994 · Cited by 76
Landauer, R. W. (1995) · Springer eBooks · doi:10.1007/978-94-011-0041-0_33 · Cited by 75
Classical capacity of a noiseless quantum channel assisted by noisy entanglement
Horodecki, M., Horodecki, P., Horodecki, R., Leung, D., & Terha, B. (2001) · Quantum Information and Computation · doi:10.26421/qic1.3-6 · Cited by 73
Grudka, A., & Horodecki, P. (2010) · Physical Review A · doi:10.1103/physreva.81.060305 · Cited by 73
Classical capacity of bosonic broadcast communication and a minimum output entropy conjecture
Guha, S., Shapiro, J. H., & Erkmen, B. I. (2007) · Physical Review A · doi:10.1103/physreva.76.032303 · Cited by 72
On Hastings' Counterexamples to the Minimum Output Entropy Additivity Conjecture
Brandão, F. G. S. L., & Horodecki, M. (2010) · Open Systems & Information Dynamics · doi:10.1142/s1230161210000047 · Cited by 72
Entanglement Assisted Capacity of the Broadband Lossy Channel
Giovannetti, V., Lloyd, S., Maccone, L., & Shor, P. W. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.047901 · Cited by 72
John Wheeler, relativity, and quantum information
Misner, C. W., Thorne, K. S., & Zurek, W. H. (2009) · Physics Today · doi:10.1063/1.3120895 · Cited by 69
The 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
Giovannetti, V., Lloyd, S., Maccone, L., & Shor, P. W. (2003) · Physical Review A · doi:10.1103/physreva.68.062323 · Cited by 68
The Capacity of the Quantum Multiple Access Channel
Winter, A. (1998) · Explore Bristol Research · Cited by 68
On the second-order asymptotics for entanglement-assisted communication
Datta, N., Tomamichel, M., & Wilde, M. M. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1272-5 · Cited by 67
One-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
Quantum 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
Limits for compression of quantum information carried by ensembles of mixed states
Horodecki, M. (1998) · Physical Review A · doi:10.1103/physreva.57.3364 · Cited by 64
The capacity of hybrid quantum memory
Kuperberg, G. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.811917 · Cited by 64
Fidelity of recovery, squashed entanglement, and measurement recoverability
Seshadreesan, K. P., & Wilde, M. M. (2015) · Physical Review A · doi:10.1103/physreva.92.042321 · Cited by 63
Quantum information: How much information in a state vector?Preprint
Caves, C. M., & Fuchs, C. A. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9601025 · Cited by 61
A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution
Harrow, A. W., & Lo, H. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.822597 · Cited by 61
Identifying the Information Gain of a Quantum Measurement
Berta, M., Renes, J. M., & Wilde, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2365207 · Cited by 60
Caves, C. M. (1993) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.47.4010 · Cited by 60
Lower Bounds to the Probability of Error for Classical and Classical-Quantum ChannelsPreprint
Dalai, M. (2016) · Cited by 60
Fawzi, O., Hayden, P. M., & Sen, P. (2013) · Journal of the ACM · doi:10.1145/2518131 · Cited by 59
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
Universal recovery map for approximate Markov chains
Sutter, D., Fawzi, O., & Renner, R. (2016) · HAL · doi:10.3929/ethz-b-000114249 · Cited by 57
McEvoy, J. P., & Zárate, O. S. (1992) · Cited by 55
Achieving the Holevo bound via sequential measurements
Giovannetti, V., Lloyd, S., & Maccone, L. (2012) · Physical Review A · doi:10.1103/physreva.85.012302 · Cited by 54
Reliability function of general classical-quantum channelPreprint
Holevo, A. S. (1999) · Cited by 53
Bowen, G. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834749 · Cited by 52
REVERSIBILITY CONDITIONS FOR QUANTUM OPERATIONS
Jenčová, A. (2012) · Reviews in Mathematical Physics · doi:10.1142/s0129055x1250016x · Cited by 51
The Fidelity of Recovery Is Multiplicative
Berta, M., & Tomamichel, M. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2527683 · 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
Exponents of quantum fixed-length pure-state source coding
Hayashi, M. (2002) · Physical Review A · doi:10.1103/physreva.66.032321 · Cited by 48
Sequential Projective Measurements for Channel Decoding
Lloyd, S., Giovannetti, V., & Maccone, L. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.250501 · Cited by 48
Triangle of Dualities between Quantum Communication Protocols
Devetak, I. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.140503 · Cited by 46
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
Operator monotones, the reduction criterion and the relative entropy
Plenio, M. B., Virmani, S., & Papadopoulos, P. P. (2000) · CERN Document Server (European Organization for Nuclear Research) · Cited by 46
Remainder terms for some quantum entropy inequalities
Carlen, E. A., & Lieb, É. H. (2014) · Journal of Mathematical Physics · doi:10.1063/1.4871575 · Cited by 45
Multiple-access bosonic communications
Yen, B. J., & Shapiro, J. H. (2005) · Physical Review A · doi:10.1103/physreva.72.062312 · Cited by 45
A quantum analog of Huffman coding
Braunstein, S. L., Fuchs, C. A., Gottesman, D., & Lo, H. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850709 · Cited by 45
The locking-decoding frontier for generic dynamics
Dupuis, F., Florjanczyk, J., Hayden, P. M., & Leung, D. (2013) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2013.0289 · Cited by 44
Criteria for continuous-variable quantum teleportation
Braunstein, S. L., Fuchs, C. A., & Kimble, H. J. (2000) · Journal of Modern Optics · doi:10.1080/095003400148196 · Cited by 44
On quantum coding for ensembles of mixed statesPreprint
Barnum, H., Caves, C. M., Fuchs, C. A., Jozsa, R., & Schumacher, B. (2000) · Cited by 42
Capacity of the bosonic wiretap channel and the Entropy Photon-Number Inequality
Guha, S., Shapiro, J. H., & Erkmen, B. I. (2008) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2008.4594954 · Cited by 41
Universal quantum data compression via nondestructive tomography
Bennett, C. H., Harrow, A. W., & Lloyd, S. (2006) · Physical Review A · doi:10.1103/physreva.73.032336 · Cited by 39
A Fresh Look at Entropy and the Second Law of Thermodynamics
Lieb, É. H., & Yngvason, J. (2000) · Springer eBooks · doi:10.1007/978-3-662-10018-9_20 · Cited by 39
Superadditivity of Private Information for Any Number of Uses of the Channel
Elkouss, D., & Strelchuk, S. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.040501 · Cited by 38
Information Rates Achievable With Algebraic Codes on Quantum Discrete Memoryless Channels
Hamada, M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860824 · Cited by 38
Quantum state redistribution based on a generalized decoupling
Ye, M.-Y., Bai, Y.-K., & Wang, Z. D. (2008) · Physical Review A · doi:10.1103/physreva.78.030302 · Cited by 37
Classical 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 37
Giovannetti, V., Holevo, A. S., Lloyd, S., & Maccone, L. (2010) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/43/41/415305 · Cited by 37
Universal quantum information compression and degrees of prior knowledge
Jozsa, R., & Presnell, S. (2003) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2003.1162 · Cited by 37
Purely Quantum Superadditivity of Classical Capacities of Quantum Multiple Access Channels
Czekaj, Ł., & Horodecki, P. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110505 · Cited by 36
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
Quantum-Locked Key Distribution at Nearly the Classical Capacity Rate
Lupo, C., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.160502 · Cited by 35
Simultaneous classical-quantum capacities of quantum multiple access channelsPreprint
Yard, J. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0506050 · Cited by 33
Multipartite quantum correlations and local recoverability
Wilde, M. M. (2015) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2014.0941 · Cited by 33
A Random Coding Based Proof for the Quantum Coding Theorem
Klesse, R. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000055 · Cited by 32
On Feedback and the Classical Capacity of a Noisy Quantum Channel
Bowen, G., & Nagarajan, R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839519 · Cited by 32
Compression of quantum-measurement operations
Winter, A., & Massar, S. (2001) · Physical Review A · doi:10.1103/physreva.64.012311 · Cited by 31
On the Distributed Compression of Quantum Information
Ahn, C., Doherty, A. C., Hayden, P. M., & Winter, A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881734 · Cited by 31
Classical 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
Landauer's erasure, error correction and entanglement
Vedral, V. (1999) · CERN Document Server (European Organization for Nuclear Research) · Cited by 29
Quantum networks for concentrating entanglement
Kaye, P., & Mosca, M. (2001) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/34/35/319 · Cited by 28
Quantum Markov chains, sufficiency of quantum channels, and Rényi information measures
Datta, N., & Wilde, M. M. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/50/505301 · Cited by 27
Multiparty quantum protocols for assisted entanglement distillationPreprint
Dutil, N. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1105.4657 · Cited by 27
Multiple-User Quantum Information Theory for Optical Communication Channels
Guha, S. (2008) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 26
Equivalence of Additivity Questions in Quantum Information Theory
Shor, P. W. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1071-1 · Cited by 26
Bounds on entanglement distillation and secret key agreement for quantum broadcast channels
Seshadreesan, K. P., Takeoka, M., & Wilde, M. M. (2016) · Civil War Book Review · Cited by 26
A lower bound of quantum conditional mutual information
Zhang, L., & Wu, J. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/41/415303 · Cited by 25
Structure of sufficient quantum coarsegrainingsPreprint
Mosonyi, M., Petz, D., Abstract Let, H., & B(h, T. (n.d.) · Cited by 25
Entanglement of random subspaces via the Hastings bound
Fukuda, M., & King, C. (2009) · eScholarship (California Digital Library) · Cited by 24
The Holevo bound and Landauer's principle
Plenio, M. B. (1999) · Physics Letters A · doi:10.1016/s0375-9601(99)00737-9 · Cited by 23
Error exponents for entanglement concentration
Hayashi, M., Koashi, M., Matsumoto, K., et al. (2002) · Bristol Research (University of Bristol) · Cited by 22
Rényi squashed entanglement, discord, and relative entropy differences
Seshadreesan, K. P., Berta, M., & Wilde, M. M. (2015) · Civil War Book Review · Cited by 22
Classical Information Capacity of the Bosonic Broadcast Channel
Guha, S., & Shapiro, J. H. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557498 · Cited by 21
Coherent communication with continuous quantum variables
Wilde, M. M., Krovi, H., & Brun, T. A. (2007) · Physical Review A · doi:10.1103/physreva.75.060303 · Cited by 21
Network information theory for classical-quantum channelsPreprint
Savov, I. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.4188 · Cited by 21
From Rationality and Consistency to Bayesian Probability
Smith, C. R., & Erickson, G. J. (1989) · Springer eBooks · doi:10.1007/978-94-015-7860-8_2 · Cited by 20
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 topsy turvy world of quantum computing
Mullins, J. (2001) · IEEE Spectrum · doi:10.1109/6.898799 · Cited by 17
Secret-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
Unified Quantum Convolutional CodingPreprint
Wilde, M. M., & Brun, T. A. (2008) · Cited by 17
Second-order coding rates for pure-loss bosonic channelsPreprint
Wilde, M. M., Renes, J. M., & Guha, S. (2016) · Cited by 16
Security of EPR-based Quantum Key DistributionPreprint
Inamori, H. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0008064 · Cited by 13
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
FEEDBACK IN QUANTUM COMMUNICATION
Bowen, G. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749905000621 · Cited by 11
Quantum enigma machines and the locking capacity of a quantum channel
Guha, S., Hayden, P. M., Krovi, H., Lloyd, S., Lupo, C., Shapiro, J. H., Takeoka, M., & Wilde, M. M. (2013) · Civil War Book Review · doi:10.48550/arxiv.1307.5368 · Cited by 11
Universal coding for transmission of private information
Datta, N., & Hsieh, M.-H. (2010) · Journal of Mathematical Physics · doi:10.1063/1.3521499 · Cited by 10
Upper and Lower Bounds on Quantum Codes
Smith, G. S. B. (2006) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/m0xg-zs21 · Cited by 9
Sending Classical Bits via Quantum Its
Hausladen, P. A., Schumacher, B. W., Westmoreland, M. D., & Wootters, W. K. (1995) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1995.tb39011.x · Cited by 9
Entanglement generation with a quantum channel and a shared state
Wilde, M. M., & Hsieh, M.-H. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513540 · Cited by 9
Comment on “Secret-key-assisted private classical communication capacity over quantum channels”
Wilde, M. M. (2011) · Physical Review A · doi:10.1103/physreva.83.046303 · Cited by 7
Strong converse for the classical capacity of all phase-insensitive bosonic Gaussian channelsPreprint
Bardhan, B. R., García−Patrón, R., Wilde, M. M., & Winter, A. (2014) · arXiv (Cornell University) · Cited by 6
Experimental Tests of Bell’s Inequalities with Pairs of Low Energy Correlated Photons
Aspect, A. (1986) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4613-2181-1_12 · Cited by 5
Information Transfer through Quantum Channels
Kretschmann, D. (2007) · Digitale Bibliothek Braunschweig (Verbundzentrale Göttingen (VZG)) · doi:10.24355/dbbs.084-200801240100-0 · Cited by 4
Unification of Quantum Information Theory
Abeyesinghe, A. (2006) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/xb1h-6193 · Cited by 3
A resource-based view of quantum information
Bennett, C. H. (2004) · doi:10.5555/2011593.2011598 · Cited by 3
Distributed Compression and Squashed EntanglementPreprint
Savov, I. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0802.0694 · Cited by 3
Joint source-channel coding for a quantum multiple access channelPreprint
Wilde, M. M., & Savov, I. (2012) · Cited by 3
Cited by
6G and Beyond: The Future of Wireless Communications Systems
Akyildiz, I. F., Kak, A., & Nie, S. (2020) · IEEE Access · doi:10.1109/access.2020.3010896 · Cited by 1,385
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
Vinjanampathy, S., & Anders, J. (2016) · Contemporary Physics · doi:10.1080/00107514.2016.1201896 · Cited by 937
Operational Resource Theory of Coherence
Winter, A., & Yang, D. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.120404 · Cited by 933
Metadata
- Venue
- Information Theory
- Publisher
- IEEE
- Published
- 2009
- OpenAlex
- W245337057
- Cited by
- 533
- References
- 384
- FWCI
- 3.24
- Type
- book chapter
- Language
- en
- Open access
- closed
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.