Mark Wilde: Quantum Renyi relative entropies and their use

Channel:
Subscribers:
2,470
Published on ● Video Link: https://www.youtube.com/watch?v=hbXx5_PUD4M



Duration: 1:01:14
583 views
0


The past decade of research in quantum information theory has witnessed extraordinary progress in understanding communication over quantum channels, due in large part to quantum generalizations of the classical Renyi relative entropy. One generalization is known as the sandwiched Renyi relative entropy and finds its use in characterizing asymptotic behavior in quantum hypothesis testing. It has also found use in establishing strong converse theorems (fundamental communication capacity limitations) for a variety of quantum communication tasks. Another generalization is known as the geometric Renyi relative entropy and finds its use in establishing strong converse theorems for feedback assisted protocols, which apply to quantum key distribution and distributed quantum computing scenarios. Finally, a generalization now known as the Petz--Renyi relative entropy plays a critical role for statements of achievability in quantum communication. In this talk, I will review these quantum generalizations of the classical Renyi relative entropy, discuss their relevant information-theoretic properties, and the applications mentioned above.




Other Videos By QuICS


2021-04-14Sisi Zhou: Error-corrected quantum metrology
2021-03-28Martin Fraas: Quantized quantum transport in interacting systems
2021-03-12Michael DeMarco: A Commuting Projector Model for Hall Conductance
2021-03-09Daniel Stilck França: Limitations of optimization algorithms on noisy quantum devices
2021-03-09Robert Huang: Fundamental aspects of solving quantum problems with machine learning
2020-11-04Wolfgang Pfaff: Increasing connectivity and modularity in superconducting quantum circuits
2020-10-29Iordanis Kerenidis: Quantum Machine Learning: prospects and challenges
2020-10-21Urmila Mahadev: Classical homomorphic encryption for quantum circuits
2020-10-08Thomas Baker: Density functionals, Kohn-Sham potentials & Green’s functions from a quantum computer
2020-09-23James D. Whitfield: Limitations of Hartree-Fock with Quantum Resources
2020-09-18Mark Wilde: Quantum Renyi relative entropies and their use
2020-08-17Dmitry Green: A superconducting circuit realization of combinatorial gauge symmetry
2020-07-23Matt Hastings: The Power of Adiabatic Quantum Computation with No Sign Problem
2020-06-19William Slofstra: Arkhipov's theorem, games, groups, and graphs
2020-06-10Ramis Movassagh:Cayley path & quantum supremacy:Average case # P-Hardness of random circuit sampling
2020-06-04Steve Flammia: Characterization of Solvable Spin Models via Graph Invariants
2020-05-20Aram Harrow: Small Quantum Computers and Large Classical Data Sets
2020-02-05Dominik Hangleiter: (How) can we verify quantum supremacy?
2020-02-05Giacomo Torlai: Enhancing Quantum Simulators with Neural Networks
2019-11-21Felix Leditzky: Playing Games with Multiple Access Channels
2019-11-14Anand Natarajan: NEEXP ⊆ MIP*



Tags:
quantum computing