Faster randomized partial trace estimation
From MaRDI portal
Publication:6638206
DOI10.1137/23M1620399MaRDI QIDQ6638206
Kevin X. Li, Yilu Pan, Yixin Wang, Tyler Chen, Skai Nzeuton, Robert H. Chen
Publication date: 14 November 2024
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Randomized algorithms (68W20) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- Randomized estimation of spectral densities of large matrices made accurate
- Improved bounds on sample size for implicit matrix trace estimators
- Quantum thermodynamics. Emergence of thermodynamic behavior within composite quantum systems
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- The simple Lanczos procedure: Estimates of the error of the Gauss quadrature formula and their applications
- Beweis des Ergodensatzes und des \(H\)-Theorems in der neuen Mechanik.
- Energieaustausch nach der Wellenmechanik.
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Randomized matrix-free trace and log-determinant estimators
- On randomized trace estimates for indefinite matrices with an application to determinants
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Quantum Computation and Quantum Information
- The kernel polynomial method
- Normal typicality and von Neumann’s quantum ergodic theorem
- A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- ARPACK Users' Guide
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature
- Improved Variants of the Hutch++ Algorithm for Trace Estimation
- Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
- Approximating Spectral Sums of Large-Scale Matrices using Stochastic Chebyshev Approximations
- Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse
- Two polynomial methods of calculating functions of symmetric matrices
- Randomized numerical linear algebra: Foundations and algorithms
- Krylov-Aware Stochastic Trace Estimation
- Randomized Low-Rank Approximation of Monotone Matrix Functions
- XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation
- Hutch++: Optimal Stochastic Trace Estimation
This page was built for publication: Faster randomized partial trace estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638206)