1. Linear Algebra and Probability

This chapter delves into the fundamental concepts of linear algebra and probability that are vital for quantum computing. It begins with an introduction to vectors and matrices, transitioning to the Dirac notation used in quantum computing. The chapter explores important matrix classes such as Hermitian, unitary, and orthogonal projection matrices, explaining their roles in representing operations on quantum states. It also covers the concept of measurements, which are expressed as projection operations, and connects these to probability distributions determined by quantum state probability amplitudes. The chapter then moves on to numerical problems involving matrices, providing an overview of important matrix decompositions like the eigenvalue transformation and singular value decomposition. It discusses the condition number of matrices and its implications for solving linear systems, presenting both direct and iterative solvers. The chapter concludes with an introduction to the Krylov subspace and Kronecker product of matrices, highlighting their relevance in quantum computing. Readers will gain a deeper understanding of how linear algebra and probability underpin quantum computing, equipping them with the tools to analyze and understand basic quantum algorithms and concepts.