arXiv subjects

Miles Stoudenmire

Publications and source records attributed to Miles Stoudenmire.

6 recordsLinked to original sources

arXiv2025

Dynamics of disordered quantum systems with two- and three-dimensional tensor networks

Large scale quantum annealing dynamics of Ising spin glasses were recently implemented on D-Wave's Advantage$2$ system on a range of lattices. Following extensive comparison to existing numerical methods, these experiments were claimed to be beyond the reach of classical computation. Here, we simulate these spin glass models with lattice-specific tensor networks, using belief propagation (BP) to keep up with the entanglement generated during the time evolution and then extracting expectation values with more sophisticated variants of BP. We find that state-of-the-art accuracies can be achieved with modest computational resources. Moreover, our results are scalable in both two and three dimensions, which we leverage to verify universal Kibble-Zurek physics on systems involving hundreds of qubits.

quant-ph↗

arXiv2024

Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm

Tensor network contractions are widely used in statistical physics, quantum computing, and computer science. We introduce a method to efficiently approximate tensor network contractions using low-rank approximations, where each intermediate tensor generated during the contractions is approximated as a low-rank binary tree tensor network. The proposed algorithm has the flexibility to incorporate a large portion of the environment when performing low-rank approximations, which can lead to high accuracy for a given rank. Here, the environment refers to the remaining set of tensors in the network, and low-rank approximations with larger environments can generally provide higher accuracy. For contracting tensor networks defined on lattices, the proposed algorithm can be viewed as a generalization of the standard boundary-based algorithms. In addition, the algorithm includes a cost-efficient density matrix algorithm for approximating a tensor network with a general graph structure into a tree structure, whose computational cost is asymptotically upper-bounded by that of the standard algorithm that uses canonicalization. Experimental results indicate that the proposed technique outperforms previously proposed approximate tensor network contraction algorithms for multiple problems in terms of both accuracy and efficiency.

quant-ph↗

arXiv2024

Efficient tensor network simulation of IBM's Eagle kicked Ising experiment

We report an accurate and efficient classical simulation of a kicked Ising quantum system on the heavy-hexagon lattice. A simulation of this system was recently performed on a 127 qubit quantum processor using noise mitigation techniques to enhance accuracy (Nature volume 618, p.~500-505 (2023)). Here we show that, by adopting a tensor network approach that reflects the geometry of the lattice and is approximately contracted using belief propagation, we can perform a classical simulation that is significantly more accurate and precise than the results obtained from the quantum processor and many other classical methods. We quantify the tree-like correlations of the wavefunction in order to explain the accuracy of our belief propagation-based approach. We also show how our method allows us to perform simulations of the system to long times in the thermodynamic limit, corresponding to a quantum computer with an infinite number of qubits. Our tensor network approach has broader applications for simulating the dynamics of quantum systems with tree-like correlations.

quant-ph↗

arXiv2020

A Multi-Scale Tensor Network Architecture for Classification and Regression

We present an algorithm for supervised learning using tensor networks, employing a step of preprocessing the data by coarse-graining through a sequence of wavelet transformations. We represent these transformations as a set of tensor network layers identical to those in a multi-scale entanglement renormalization ansatz (MERA) tensor network, and perform supervised learning and regression tasks through a model based on a matrix product state (MPS) tensor network acting on the coarse-grained data. Because the entire model consists of tensor contractions (apart from the initial non-linear feature map), we can adaptively fine-grain the optimized MPS model backwards through the layers with essentially no loss in performance. The MPS itself is trained using an adaptive algorithm based on the density matrix renormalization group (DMRG) algorithm. We test our methods by performing a classification task on audio data and a regression task on temperature time-series data, studying the dependence of training accuracy on the number of coarse-graining layers and showing how fine-graining through the network may be used to initialize models with access to finer-scale features.

stat.ML↗

arXiv2019

Finite temperature density matrix embedding theory

We describe a formulation of the density matrix embedding theory at finite temperature. We present a generalization of the ground-state bath orbital construction that embeds a mean-field finite-temperature density matrix up to a given order in the Hamiltonian, or the Hamiltonian up to a given order in the density matrix. We assess the performance of the finite-temperature density matrix embedding on the 1D Hubbard model both at half-filling and away from it, and the 2D Hubbard model at half-filling, comparing to exact data where available, as well as results from finite-temperature density matrix renormalization group, dynamical mean-field theory, and dynamical cluster approximations. The accuracy of finite-temperature density matrix embedding appears comparable to that of the ground-state theory, with at most a modest increase in bath size, and competitive with that of cluster dynamical mean-field theory.

cond-mat.str-el↗

arXiv2017

Monte Carlo Tensor Network Renormalization

Techniques for approximately contracting tensor networks are limited in how efficiently they can make use of parallel computing resources. In this work we demonstrate and characterize a Monte Carlo approach to the tensor network renormalization group method which can be used straightforwardly on modern computing architectures. We demonstrate the efficiency of the technique and show that Monte Carlo tensor network renormalization provides an attractive path to improving the accuracy of a wide class of challenging computations while also providing useful estimates of uncertainty and a statistical guarantee of unbiased results.

cond-mat.str-el↗