The solution of sets of linear simultaneous equations can be accomplished using matrices and we show how this is done. In quantum computation, matrices ‘operate’ or act on vectors to move a system from one quantum state to another as it evolves with time. The solution of sets of linear simultaneous equations can be accomplished using matrices and we show how this is done. Matrices can also be used to perform transformations of points in two- and three-dimensional space through rotations and reflections. Self-adjoint matrices play an important role in quantum computation because, as we shall see, they have real eigenvalues which correspond to the measured values of quantum observables. The procedure for calculating the inverse of a general n×n matrix necessitates the introduction of some new terminology. The rows of a unitary matrix are pairwise orthogonal so that the inner product of two distinct rows will be zero.
The solution of sets of linear simultaneous equations can be accomplished using matrices and we show how this is done. In quantum computation, matrices ‘operate’ or act on vectors to move a system from one quantum state to another as it evolves with time. The solution of sets of linear simultaneous equations can be accomplished using matrices and we show how this is done. Matrices can also be used to perform transformations of points in two- and three-dimensional space through rotations and reflections. Self-adjoint matrices play an important role in quantum computation because, as we shall see, they have real eigenvalues which correspond to the measured values of quantum observables. The procedure for calculating the inverse of a general n×n matrix necessitates the introduction of some new terminology. The rows of a unitary matrix are pairwise orthogonal so that the inner product of two distinct rows will be zero.
Abstract Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the ‘sender-receiver’ model, we propose quantum algorithms for matrix operations such as matrix-vector product, matrix-matrix product, the sum of two matrices, and the calculation of determinant and inverse matrix. We encode the matrix entries into the probability amplitudes of the pure initial states of senders. After applying proper unitary transformation to the complete quantum system, the desired result can be found in certain blocks of the receiver’s density matrix. These quantum protocols can be used as subroutines in other quantum schemes. Furthermore, we present an alternative quantum algorithm for solving linear systems of equations.
This chapter discusses the linear operator and demonstrate how one can be represented by a matrix. Two particularly important types of the linear operator are unitary operators and the self-adjoint operators. Following the measurement of an observable on a quantum state the post-measurement state is related to the eigenvectors of the operator and the possible measured values are its eigenvalues. Finally, given two linear operators, and say, we explain how their tensor product is calculated. A calligraphic font has been used to denote the linear operator, but occasionally we shall abuse this notation and simply denote by its matrix representation.
Quantum computing uses a mathematical language that can seem unfamiliar to readers from programming, engineering and other technical backgrounds. Qubits are represented by vectors, quantum gates by matrices, measurement outcomes by eigenvalues, and probability amplitudes by complex numbers. Quantum Computing Preliminaries develops this language carefully, connecting each mathematical idea with its computational and physical meaning. The book begins with complex vector spaces and explains why quantum states require more than classical probabilities. It introduces qubits, superposition, normalisation, basis vectors and Dirac bra–ket notation, supported by worked calculations and geometric interpretation using the Bloch sphere. The discussion then turns to inner products and the geometry of quantum states. Readers learn how to calculate norms, test orthogonality, determine state overlap and apply the Born rule. Particular attention is given to complex conjugation and the distinction between the ordinary dot product and the Hermitian inner product used in quantum mechanics.The treatment of matrix operators establishes the roles of linear, unitary and Hermitian operators. It explains matrix multiplication, non-commutativity, eigenvalues, eigenvectors, reversibility and norm preservation. The Pauli and Hadamard gates provide concrete examples that link matrix algebra to rotations, the Bloch sphere, quantum-state evolution, and measurement. Outer products and projection operators are developed as tools for constructing operators, selecting state components and describing ideal projective measurements. The book examines idempotence, completeness, repeated measurement and the distinction between the ket–bra outer product and the tensor product used to form composite quantum systems. The final chapter explores changes of basis, operator representations and diagonalisation. It shows how the same physical state or operation can have different numerical representations in the computational and Hadamard bases. Readers derive the similarity transformation, use outer-product substitution, diagonalise Hermitian operators and interpret the spectral decomposition geometrically. Examples involving the Pauli-X, Pauli-Y, Pauli-Z and Hadamard operators demonstrate how basis choice exposes phase, population and measurement structure without changing the underlying physics. Throughout the book, Python and NumPy examples translate the mathematics into executable calculations. The programs demonstrate complex-vector operations, inner products, eigendecomposition, basis transformation and numerical verification while explaining the importance of using operations suited to complex Hilbert spaces. Each chapter includes conceptual, mathematical, computational and challenge exercises. Detailed solutions provide step-by-step derivations, program output and physical interpretation, allowing the book to support both guided study and independent practice. Quantum Computing Preliminaries is intended for students, software developers, engineers and technically minded readers preparing to study quantum circuits, algorithms, simulation, measurement, entanglement or error correction. It assumes familiarity with elementary algebra and programming but does not require prior training in quantum mechanics. Its purpose is to provide a clear mathematical foundation for understanding how quantum information is represented, transformed and measured.
There is a notational discrepancy in how mathematicians and physicists treat Hilbert spaces. In physics, one often works with finite-dimensional Hilbert spaces treated as ℂ n , and hence wants to write the Hermitian inner product as (x, y) = x ∗ y. This definition dictates the use of a Hermitian inner product that is antilinear in the first argument, the convention followed, for example, in Reed & Simon [246]. This is also the choice adopted in Dirac’s bracket notation, whose usage in quantum mechanics is very widespread. Our notation is chosen to extend-as closely as possible-the traditional notation of standard finite-dimensional matrix algebra to arbitrary complex inner product spaces and associated linear operators. In matrix algebra, column vectors and the corresponding matrices with one column are identical objects, row vectors are the linear functionals, and the adjoint is the conjugate transpose. For example, ℍ = ℍ × = ℂ n is the space of column vectors of size n, the dual space ℍ ∗ is the space of row vectors of size n, and the operator product ϕ ∗ ψ of a row vector ϕ ∗ and a column vector ψ is the standard Hermitian inner product of the column vectors ϕ and ψ. We use Greek lower case letters to write vectors, thus emphasizing their intended use as quantum state vectors in quantum mechanics. On the other hand, mathematicians working on reproducing kernel Hilbert spaces use an inner product (x, y) antilinear in the second argument, related to the physicist’s inner product (x, y) by (x, y) =( ). This is the convention followed, for example, in Rudin [252]. Although the two ways of defining the inner product lead to fully equivalent theories, all details look a bit different, a fact that has to be taken into account when reading the literature on the subject. For example, in the description based on the physical tradition, it is preferable to work with the antidual space in place of the dual space used in the mathematical tradition. In functional analysis, linear operators in Hilbert spaces are usually considered each with their own domain. But many computations in quantum mechanics require the consideration of algebras of operators with a common domain. The latter is a Euclidean space, a dense subspace of a Hilbert space. This space and its antidual play in many respects a more basic role in quantum physics than the Hilbert space itself. Therefore, and to avoid possible confusion caused by the different traditions, we give in the present chapter a self-contained introduction to Euclidean spaces and their associated spaces. All proofs are carried out in detail.
Hilbert spaces provide the fundamental mathematical framework for describing quantum mechanical systems. Their structure, characterized by an inner product and completeness, allows for the representation of quantum states as vectors and physical observables as self-adjoint operators. Key quantum phenomena such as superposition and entanglement find natural expression within this formalism. Superposition, where a quantum system can exist in multiple states simultaneously, is represented by linear combinations of basis vectors in the Hilbert space. Entanglement, a non-classical correlation between quantum systems, is described by non-separable state vectors in a tensor product of Hilbert spaces. These concepts are pivotal in quantum computing, where the unit of information, the qubit, is a two-level quantum system whose state is a vector in a two-dimensional complex Hilbert space (ℂ²). Quantum gates, which perform operations on qubits, are represented by unitary operators acting on these state vectors. The power of quantum computation, particularly in algorithms like Shor's or Grover's, stems from the ability to exploit superposition and entanglement, processes intrinsically described within the Hilbert space framework. Thus, a thorough understanding of Hilbert spaces is indispensable for grasping the principles of quantum mechanics and for advancing the field of quantum information and computation [1, 7]. The transition from classical bits to quantum qubits, and from classical logic gates to quantum unitary operations, is entirely predicated on the mathematical properties endowed by Hilbert spaces.
Hilbert spaces provide the fundamental mathematical framework for describing quantum mechanical systems. Their structure, characterized by an inner product and completeness, allows for the representation of quantum states as vectors and physical observables as self-adjoint operators. Key quantum phenomena such as superposition and entanglement find natural expression within this formalism. Superposition, where a quantum system can exist in multiple states simultaneously, is represented by linear combinations of basis vectors in the Hilbert space. Entanglement, a non-classical correlation between quantum systems, is described by non-separable state vectors in a tensor product of Hilbert spaces. These concepts are pivotal in quantum computing, where the unit of information, the qubit, is a two-level quantum system whose state is a vector in a two-dimensional complex Hilbert space (ℂ²). Quantum gates, which perform operations on qubits, are represented by unitary operators acting on these state vectors. The power of quantum computation, particularly in algorithms like Shor's or Grover's, stems from the ability to exploit superposition and entanglement, processes intrinsically described within the Hilbert space framework. Thus, a thorough understanding of Hilbert spaces is indispensable for grasping the principles of quantum mechanics and for advancing the field of quantum information and computation [1, 7]. The transition from classical bits to quantum qubits, and from classical logic gates to quantum unitary operations, is entirely predicated on the mathematical properties endowed by Hilbert spaces.