Richard Kueng: Quantum information and complexity - lecture 1 скачать в хорошем качестве

Richard Kueng: Quantum information and complexity - lecture 1

In these three lectures on quantum information and complexity, we will (1) review the basic concepts of quantum information processing units (QPUs), (2) prove a version of the claim that almost all quantum circuits are very complex in the sense that they are exponentially expensive to realize in the quantum circuit model of computation and (3) that the quantum complexity of a random quantum circuit grows linearly with the size of the circuit up to exponentially large circuits. The underlying proof technique uses a versatile proof strategy from high-dimensional probability theory that can (and has been) readily extended to other problems within quantum computing theory and beyond. Recording during the thematic meeting : « Complexity as a kaleidoscope » the April 02, 2025 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker : Luca Récanzone Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathematics Library: http://library.cirm-math.fr. And discover all its functionalities: - Chapter markers and keywords to watch the parts of your choice in the video - Videos enriched with abstracts, bibliographies, Mathematics Subject Classification - Multi-criteria search by author, title, tags, mathematical area