Introduction¶
Randomized algorithms for approximating the trace of a matrix using only matrix-vector products with are increasingly used as a computational primitive in a number of areas in the computational sciences.
Many commonly used stochastic trace estimation algorithms make critical use of the fact that is an unbiased estimator for , at least provided that . Indeed,
Common choice of distribution for include sampling the entries independently from or or sampling from , the uniform distribution on the hypersphere of radius . For all of these distributions, tail bounds of the form
have been studied Reimann, 2007Popescu et al., 2006Avron & Toledo, 2011Roosta-Khorasani & Ascher, 2014Meyer et al., 2021Cortinovis & Kressner, 2021Chen et al., 2022. Current state of the art bounds offer refined tail bounds for depending on through and with the precise bounds depending on the choice of distribution for .
In this note, we provide a brief historical overview of these algorithms and their corresponding analyses. While our exposition is far from comprehensive, we believe it provides some insight into the history of typicality-based algorithms. We hope that some of the connections highlighted in this letter motivate further the interaction between physics, numerical analysis, and theoretical computer science.
Quantum mechanics and linear algebra¶
In the now standard mathematical formalism of quantum mechanics, pure states of a quantum system are represented as (unit length) elements of a Hilbert space , and physical observables (such as energy, translational momentum, orbital angular momentum, and spin) are self-adjoint operators on . If has dimension (which we shall assume throughout this paper), the spectral theorem ensures an observable can be decomposed as
where are the eigenvalues of and are the (orthonormal) eigenstates.
When a measurement is made of while the system is in a state , the value of the measurement observed will be . More generally, if the measurement is made while the system is in an arbitrary state , the value of the measurement observed may be any of . In particular, the values observed will be with probability proportional to the norm of the projection of onto the the eigenstates associated with . That is,
Here the subscript ``qm’’ indicates that the probability is with respect to the inherent randomness in the formalism of quantum mechanics.
That the results of a measurement are probabilistic is distinctly quantum; in the classical setting, repeated measurements of a system in a given state result in exactly the same measurement value. However, repeated measurements of an observable in a given state will eventually reveal an average value
referred to as \emph{quantum expectation value} (QEV) of in state .
In fact, as noted by von Neumann Neumann, 1929 , the probability distribution \cref{eqn:Aphi_dist} can be recovered by knowledge of the moments
The simplest description of a state by means of a wave function is obtained in this way: the expectation value of the quantity in the state is equal to . The specification of all expectation values provides, as it includes the expectation values of all powers (i.e., the so-called higher moments of a probability distribution), knowledge of the entire probability distribution of every quantity—and thus a complete statistical characterization of the system
More generally, a quantum system may be be in a mixture of pure states each occurring with probability . Such an ensemble is represented mathematically by the density matrix
When the observable is measured in such a state, the corresponding QEV is given by
Note that in the case of a single pure state, so that , we recover the original formula for the QEV by the identity .
- Reimann, P. (2007). Typicality for Generalized Microcanonical Ensembles. Physical Review Letters, 99(16). 10.1103/physrevlett.99.160404
- Popescu, S., Short, A. J., & Winter, A. (2006). Entanglement and the foundations of statistical mechanics. Nature Physics, 2(11), 754–758. 10.1038/nphys444
- Avron, H., & Toledo, S. (2011). Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix. Journal of the ACM, 58(2), 1–34. 10.1145/1944345.1944349
- Roosta-Khorasani, F., & Ascher, U. (2014). Improved Bounds on Sample Size for Implicit Matrix Trace Estimators. Foundations of Computational Mathematics, 15(5), 1187–1212. 10.1007/s10208-014-9220-1
- Meyer, R. A., Musco, C., Musco, C., & Woodruff, D. P. (2021). Hutch++: Optimal Stochastic Trace Estimation. In Symposium on Simplicity in Algorithms (SOSA) (pp. 142–155). Society for Industrial. 10.1137/1.9781611976496.16
- Cortinovis, A., & Kressner, D. (2021). On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants. Foundations of Computational Mathematics. 10.1007/s10208-021-09525-9
- Chen, T., Trogdon, T., & Ubaru, S. (2022). Randomized matrix-free quadrature for spectrum and spectral sum approximation.
- von Neumann, J. (1929). Beweis des Ergodensatzes und desH-Theorems in der neuen Mechanik. Zeitschrift Für Physik, 57(1–2), 30–70. 10.1007/bf01339852