Session 2 - Quantum Computing and Cybersecurity Lecture Series (March 7, 2026)
From Quantum Computing and Cybersecurity Lecture Series
Joseph R. Delcarman•Associate Professor 5; Quantum Computing Coordinator, New West
Executive Summary
The episode provides a foundational lecture on the mathematics underpinning quantum computing, designed for learners with a basic conceptual understanding.
It draws a clear distinction between classical computing (bits, classical mechanics) and quantum computing (qubits, quantum mechanics), focusing on the principles of superposition and entanglement.
A significant portion is dedicated to essential linear algebra concepts, including complex vector spaces, Dirac notation (kets), and the properties of matrix multiplication (non-commutative, associative).
The session bridges theory and practice by explaining how matrix operations represent quantum gates and promotes community engagement through hackathons like XQBIT and C-Quantathon.
6 quotes
Concerns Raised
The inherent complexity and steep mathematical learning curve required to enter the field of quantum computing.
The challenge of translating abstract mathematical concepts into practical, functioning quantum algorithms.
Opportunities Identified
Applying principles of linear algebra to model and solve complex problems in a new computational paradigm.
Leveraging the exponential state space of multi-qubit systems to tackle problems intractable for classical computers.
Gaining practical experience and recognition through participation in quantum-focused hackathons and community projects.