Finite-size scaling of typicality-based estimates
arXiv:2002.00411 · doi:10.1515/zna-2020-0031
Abstract
According to the concept of typicality, an ensemble average can be accurately approximated by an expectation value with respect to a single pure state drawn at random from a high-dimensional Hilbert space. This random-vector approximation, or trace estimator, provides a powerful approach to, e.g., thermodynamic quantities for systems with large Hilbert-space sizes, which usually cannot be treated exactly, analytically or numerically. Here, we discuss the finite-size scaling of the accuracy of such trace estimators from two perspectives. First, we study the full probability distribution of random-vector expectation values and, second, the full temperature dependence of the standard deviation. With the help of numerical examples, we find pronounced Gaussian probability distributions and the expected decrease of the standard deviation with system size, at least above certain system-specific temperatures. Below and in particular for temperatures smaller than the excitation gap, simple rules are not available.
arXiv comment9 pages, 11 figures
References in corpus (33)
- The Kernel Polynomial Method
- Quantum phase transitions
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Canonical Thermal Pure Quantum State
- Thermal Pure Quantum States at Finite Temperature
- Fast Algorithm for Finding the Eigenvalue Distribution of Very Large Matrices
- Dynamical typicality of quantum expectation values
- The spin-1/2 J1-J2 Heisenberg antiferromagnet on the square lattice: Exact diagonalization for N=40 spins
- An efficient scheme for numerical simulations of the spin-bath decoherence
- Typical fast thermalization processes in closed many-body systems
- Spin-current autocorrelations from single pure-state propagation
- Magnetism of the N=42 kagome lattice antiferromagnet
- Frustrated two dimensional quantum magnets
- Regression relation for pure quantum states and its implications for efficient computing
- Highly Frustrated Magnetic Clusters: The kagome on a sphere
- Properties of highly frustrated magnetic molecules studied by the finite-temperature Lanczos method
- Improved bounds on sample size for implicit matrix trace estimators
- Spin and energy currents in integrable and nonintegrable spin-1/2 chains: A typicality approach to real-time autocorrelations
- Quantum spin liquid at finite temperature: proximate dynamics and persistent typicality
- Quantum phase transitions in electronic systems
- Accuracy of the finite-temperature Lanczos method compared to simple typicality-based estimates
- Frustration effects in magnetic molecules
- Delta chain with ferromagnetic and antiferromagnetic interactions at the critical point
- Finite-temperature properties of the Kitaev-Heisenberg models on kagome and triangular lattices studied by improved finite-temperature Lanczos methods
- Advanced Finite-Temperature Lanczos Method for anisotropic spin systems
- Heisenberg exchange parameters of molecular magnets from the high-temperature susceptibility expansion
- Interpolation between low and high temperatures of the specific heat for spin systems
- Accuracy of the microcanonical Lanczos method to compute real-frequency dynamical spectral functions of quantum models at finite temperatures
- Frustration effects in antiferromagnetic molecules: the cuboctahedron
- Delta chain with anisotropic ferromagnetic and antiferromagnetic interactions
- Kondo Lattice Model with Finite Temperature Lanczos Method
- Magneto-thermal properties of the spin-s Heisenberg antiferromagnet on the cuboctahedron
- Full expectation value statistics for randomly sampled pure states in high-dimensional quantum systems
Cited by in corpus (5)
- The pyrochlore S=1/2 Heisenberg antiferromagnet at finite temperature
- Entanglement of midspectrum eigenstates of chaotic many-body systems: Reasons for deviation from random ensembles
- Density dynamics in the mass-imbalanced Hubbard chain
- Accuracy of the typicality approach using Chebyshev polynomials
- A spectrum adaptive kernel polynomial method