Description
Back to topThere are many practical and theoretical challenges in the emerging area of quantum information processing, which seeks to optimally use the information embedded in the state of a quantum system to solve previously intractable computational problems and revolutionize simulation. The engineering goal is to develop scalable quantum hardware that circumvents the physical limits on the computational power of existing technologies, which are ultimately constrained by energy dissipation as the physical size of the components is reduced to the nanometer scale. In parallel with such “practical” difficulties, new theory is required to understand the limitations of quantum media and capitalize on the advantages of quantum superposition and entanglement. This includes the creation of new quantum algorithms that are targeted toward real-world problems, e.g., in finance, chemistry, and medicine; a study of the required resources to achieve a particular outcome, as well as methods to efficiently characterize such resources; and the development of novel protocols for secure quantum-enhanced communication, as well as classical ‘post-quantum encryption’ methods that are immune to quantum hacking. For all of these, quantum information theory relies on and draws inspiration from many different aspects of mathematics and theoretical computer science, including geometry, group theory, functional analysis, number theory, operator theory, probability theory, topology, complexity theory, and learning theory. Furthermore, the recent resolution of Connes’ embedding conjecture using quantum information-theoretic methods shows that ideas and results from quantum information theory can also influence research in pure mathematics.
Organizers
Back to topUniversity of Texas at Austin
University of Chicago
University of Illinois at Urbana_Champaign
University of Illinois at Urbana_Champaign
University of California, Berkeley
Speakers
Back to topSchedule
Back to topSpeaker: Bill Fefferman (University of Chicago)
Speaker: Roman Orus (Donostia International Physics Center)
Speaker: Ulysse Chabaud (Institute for Quantum Information and Matter, California Institute of Technology)
Speaker: Damian Markham (Centre National de la Recherche Scientifique (CNRS))
Speaker: Marco Pistoia (JPMorgan Chase)
Speaker: Andreas Winter (Universitat Autònoma de Barcelona)
Speaker: Henry Yuen (Columbia University)
Speaker: Bryan Clark (University of Illinois at Urbana-Champaign)
Speaker: Maria Kieferova (University of Technology Sydney)
Speaker: Andrew Childs (University of Maryland)
Speaker: Joel Wallman (University of Waterloo)
Speaker: Giuseppe Carleo (EPFL (Ecole Polytechnique Fédérale de Lausanne))
Speaker: Edgar Solomonik (University of Illinois at Urbana-Champaign)
Videos
Back to top
The Power of Random Quantum Circuits
Bill Fefferman
May 24, 2021
Applying quantum computing to solve problems in finance
Roman Orus
May 24, 2021
Quantum state certification with phase-space measurements
Ulysse Chabaud
May 24, 2021
Loophole-free Contextuality Inequalities
Damian Markham
May 25, 2021
Quantum Advantage in Games of Incomplete Information
Andreas Winter
May 26, 2021
The proofs perspective on MIP* = RE
Henry Yuen
May 26, 2021
Improved Optimization of Variational Quantum Algorithms
Bryan Clark
May 26, 2021
Quantum barren plateaus and a possible way out
Maria Kieferova
May 27, 2021
Efficient quantum algorithm for dissipative nonlinear differential equations
Andrew Childs
May 27, 2021
Running useful algorithms on near-term quantum hardware
Joel Wallman
May 27, 2021
Efficient quantum algorithms for variational state preparation
Giuseppe Carleo
May 28, 2021
Tensor Optimization Algorithms and Libraries for Quantum Simulation
Edgar Solomonik
May 28, 2021