A proposed quantum algorithm uses thermalization under the eigenstate thermalization hypothesis to compute expectation values of inverses and log-determinant gradients without explicit wavefunction preparation.
Build your own tensor network library: DMRjulia I. Basic library for the density matrix renormalization group
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
An introduction to the density matrix renormalization group is contained here, including coding examples. The focus of this code is on basic operations involved in tensor network computations, and this forms the foundation of the DMRjulia library. Algorithmic complexity, measurements from the matrix product state, convergence to the ground state, and other relevant features are also discussed. The present document covers the implementation of operations for dense tensors into the Julia language. The code can be used as an educational tool to understand how tensor network computations are done in the context of entanglement renormalization or as a template for other codes in low level languages. A comprehensive Supplemental Material is meant to be a "Numerical Recipes" style introduction to the core functions and a simple implementation of them. The code is fast enough to be used in research and can be used to make new algorithms.
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Quantum computation with the eigenstate thermalization hypothesis instead of wavefunction preparation
A proposed quantum algorithm uses thermalization under the eigenstate thermalization hypothesis to compute expectation values of inverses and log-determinant gradients without explicit wavefunction preparation.