Demystifying Quantum Computing: A Linear Algebra Approach

Abstract:

This talk demystifies quantum computation by connecting its core ideas to familiar linear algebra concepts, without delving into complex quantum mechanics. We'll focus on how quantum bits (qubits) are represented, how quantum operations function, and the key differences from classical computing. You'll discover how the unique properties of qubits, like superposition and entanglement, give quantum computers their potential advantages. We'll explore how these concepts translate into real-world quantum algorithms and their potential future applications. Lastly, we will also briefly survey the current state of quantum computing and highlight some of the most exciting developments in this rapidly evolving field, providing a glimpse into the transformative possibilities ahead. This talk is designed for anyone curious about quantum computing, regardless of your background in physics or math. I’ll keep the concepts accessible and focus on the big picture, giving you a solid foundation to understand this revolutionary technology.

Brief bio:

Bicheng Ying currently work as a senior quantum engineer at Google Quantum AI. He received his BS degree from Shanghai Jiao Tong University at 2013 and obtained M.S. and Ph.D. degree in Electrical and Computer Engineering from the University of California, Los Angeles (UCLA) in 2015 and 2018 respectively. Before joined the google, he was a visiting researcher at École Polytechnique Fédérale de Lausanne (EPFL) in 2018. His research interests are broad and cross multiple domains, spanning quantum computation, machine learning, decentralized optimization, and signal processing.