• Publications
  • Influence
Quantum Information Theory
  • M. Wilde
  • Mathematics, Computer Science
  • 10 June 2013
TLDR
The author develops all of the tools necessary for understanding important results in quantum information theory, including capacity theorems for classical, entanglement-assisted, private and quantum communication. Expand
Strong Converse for the Classical Capacity of Entanglement-Breaking and Hadamard Channels via a Sandwiched Rényi Relative Entropy
TLDR
It is shown that a strong converse theorem holds for the classical capacity of all entanglement-breaking channels and all Hadamard channels (the complementary channels of the former) that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of communication exceeds the classical Capacity. Expand
From Classical to Quantum Shannon Theory
  • M. Wilde
  • Computer Science, Physics
  • ArXiv
  • 7 June 2011
TLDR
Part V and VI are the culmination of this book, where all of the tools developed come into play for understanding many of the important results in quantum Shannon theory. Expand
Optical Atomic Clocks
Polar Codes for Classical-Quantum Channels
  • M. Wilde, S. Guha
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 12 September 2011
TLDR
Several known results from the quantum information literature are leveraged to demonstrate that the channel polarization effect occurs for channels with classical inputs and quantum outputs, and linear polar codes are constructed based on this effect, and the encoding complexity is O(NlogN), where N is the blocklength of the code. Expand
Optimal entanglement formulas for entanglement-assisted quantum coding
We provide several formulas that determine the optimal number of entangled bits (ebits) that a general entanglement-assisted quantum code requires. Our first theorem gives a formula that applies toExpand
Fundamental rate-loss tradeoff for optical quantum key distribution.
TLDR
It is shown that the secret key agreement capacity of a lossy and noisy optical channel assisted by unlimited two-way public classical communication is limited by an upper bound that is solely a function of the channel loss, regardless of how much optical power the protocol may use. Expand
Recoverability in quantum information theory
  • M. Wilde
  • Mathematics, Physics
  • Proceedings of the Royal Society A: Mathematical…
  • 18 May 2015
TLDR
If the decrease in quantum relative entropy between two quantum states after a quantum physical evolution is relatively small, then it is possible to perform a recovery operation, such that one can perfectly recover one state while approximately recovering the other. Expand
Universal Recovery Maps and Approximate Sufficiency of Quantum Relative Entropy
TLDR
The existence of an explicit recovery map that depends only onσ and the quantum channel N to be reversed is shown, which gives an alternate, information-theoretic characterization of the conditions for approximate quantum error correction. Expand
Converse Bounds for Private Communication Over Quantum Channels
TLDR
This paper establishes several converse bounds on the private transmission capabilities of a quantum channel by using the notion of a private state along with a “privacy test” to establish a general meta-converse bound for private communication, which has a number of applications. Expand
...
1
2
3
4
5
...