Improved stochastic trace estimation using mutually unbiased bases

Abstract

We examine the problem of estimating the trace of a matrix $A$ when given access to an oracle which computes $x^{†}Ax$ for an input vector $x$. We make use of the basis vectors from a set of mutually unbiased bases, widely studied in the field of quantum information processing, in the selection of probing vectors $x$. This approach offers a new state of the art single shot sampling variance while requiring only $O(\log (n))$ random bits to generate each vector. This significantly improves on traditional methods such as Hutchinson's and Gaussian estimators in terms of the number of random bits required and worst case sample variance.

5 pages, 1 figure, 2 tables. Comments welcome

References in corpus (1)

• Numerical evidence for the maximum number of mutually unbiased bases in dimension six

Cited by in corpus (6)

• GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Acceleration
• Product Kernel Interpolation for Scalable Gaussian Processes
• Quantum algorithms for training Gaussian Processes
• Bayesian Inference of Log Determinants
• A Multigrid Preconditioner for Tensor Product Spline Smoothing
• VBALD - Variational Bayesian Approximation of Log Determinants