Eigenvectors and Eigenvalues (Linear Algebra for Quantum Computing)
February 1, 2025
Eigenvectors and eigenvalues are the bridge between linear algebra and quantum measurement. They tell you which states are “stable” (up to a scale factor) under an operator, and what numbers you can observe when you measure.
The core idea (intuition)
Think of a matrix as a machine that transforms vectors. In general it can rotate them and change their length.
An eigenvector is special: it does not change direction under . It only scales.
The definition
A nonzero vector is an eigenvector of with eigenvalue if:
- : eigenvector (direction that is preserved)
- : eigenvalue (how much it scales; negative values flip the direction, but remain collinear)
A quick example
Let
Then:
- is an eigenvector with eigenvalue
- is an eigenvector with eigenvalue
Why this matters in quantum computing
In quantum mechanics, measurable quantities (observables) are represented by Hermitian operators (Hermitian matrices in a chosen basis).
The key rule is:
- the possible measurement outcomes are the eigenvalues of the observable operator
- a state that gives a definite outcome is an eigenstate (eigenvector)
If an observable is with eigenpairs , then measuring a system in state returns with probability:
This is why eigenvectors show up everywhere: they define the “questions” you can ask (measurement settings) and the “answers” you can get (outcomes).
Why Hermitian operators?
Hermitian operators are used for observables because their eigenvalues are real, matching physical measurement results.
Next
- Learn how we write these ideas compactly: Dirac notation
- See concrete operators in qubit land: Pauli matrices