Skip to main content
IBM Quantum Platform

Introduction

Before we begin, please take a moment to complete our pre-course survey, which is important to help improve our content offerings and user experience.

In the "Basics of quantum information" course, we discussed a framework for quantum information in which quantum states are represented by quantum state vectors, operations are represented by unitary matrices, and so on. We then used this framework in the "Fundamentals of quantum algorithms" course to describe and analyze quantum algorithms.

There are actually two common mathematical descriptions of quantum information, with the one introduced in "Basics of quantum information" being the simpler of the two. For this reason we'll refer to it as the simplified formulation of quantum information.

In this lesson, we'll begin our exploration of the second description, which is the general formulation of quantum information. It is, naturally, consistent with the simplified formulation, but offers noteworthy advantages. For instance, it can be used to describe uncertainty in quantum states and model the effects of noise on quantum computations. It provides the foundation for quantum information theory, quantum cryptography, and other topics connected with quantum information, and it also happens to be quite beautiful from a mathematical perspective.

In the general formulation of quantum information, quantum states are not represented by vectors like in the simplified formulation, but instead are represented by a special class of matrices called density matrices. Here are a few key points that motivate their use.

  • Density matrices can represent a broader class of quantum states than quantum state vectors. This includes states that arise in practical settings, such as states of quantum systems that have been subjected to noise, as well as random choices of quantum states.

  • Density matrices allow us to describe states of isolated parts of systems, such as the state of one system that happens to be entangled with another system that we wish to ignore. This isn't easily done in the simplified formulation of quantum information.

  • Classical (probabilistic) states can also be represented by density matrices, specifically ones that are A square matrix is diagonal when all of its off-diagonal entries are zero. This is important because it allows quantum and classical information to be described together within a single mathematical framework, with classical information essentially being a special case of quantum information.

At first glance, it may seem peculiar that quantum states are represented by matrices, which more typically represent actions or operations, as opposed to states. For example, unitary matrices describe quantum operations in the simplified formulation of quantum information and stochastic matrices describe probabilistic operations in the context of classical information. In contrast, although density matrices are indeed matrices, they represent states — not actions or operations.

Despite this, the fact that density matrices can (like all matrices) be associated with linear mappings is a critically important aspect of them. For example, the eigenvalues of density matrices describe the randomness or uncertainty inherent to the states they represent.


Lesson video

In the following video, John Watrous steps you through the content in this lesson on density matrices. Alternatively, you can open the YouTube video for this lesson in a separate window.

Was this page helpful?
Report a bug or request content on GitHub.