Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the first lecture in a three-part series on quantum information and complexity delivered by Richard Kueng at the Centre International de Rencontres Mathématiques in Marseille, France. Begin with a review of basic concepts of quantum information processing units (QPUs), before delving into proofs that demonstrate why almost all quantum circuits are exponentially complex to implement and how quantum complexity grows linearly with circuit size up to exponentially large circuits. Learn about the versatile proof strategy from high-dimensional probability theory that underpins these concepts and has applications beyond quantum computing theory. This 1-hour 14-minute recording from the thematic meeting "Complexity as a kaleidoscope" (April 2, 2025) was filmed by Luca Récanzone and is available on CIRM's Audiovisual Mathematics Library with features including chapter markers, keywords, abstracts, bibliographies, and multi-criteria search capabilities.
