Gauging tensor networks with belief propagation
Effectively compressing and optimizing tensor networks requires reliable methods for fixing
the latent degrees of freedom of the tensors, known as the gauge. Here we introduce a new …
the latent degrees of freedom of the tensors, known as the gauge. Here we introduce a new …
Survey on Computational Applications of Tensor-Network Simulations
Tensor networks are a popular and computationally efficient approach to simulate general
quantum systems on classical computers and, in a broader sense, a framework for dealing …
quantum systems on classical computers and, in a broader sense, a framework for dealing …
Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor networks
Quantum algorithms reformulate computational problems as quantum evolutions in a large
Hilbert space. Most quantum algorithms assume that the time evolution is perfectly unitary …
Hilbert space. Most quantum algorithms assume that the time evolution is perfectly unitary …
Optimal tree tensor network operators for tensor network simulations: Applications to open quantum systems
Tree tensor network states (TTNS) decompose the system wavefunction to the product of low-
rank tensors based on the tree topology, serving as the foundation of the multi-layer multi …
rank tensors based on the tree topology, serving as the foundation of the multi-layer multi …
Tree tensor network state approach for solving hierarchical equations of motion
Y Ke - The Journal of Chemical Physics, 2023 - pubs.aip.org
The hierarchical equations of motion (HEOM) method is a numerically exact open quantum
system dynamics approach. The method is rooted in an exponential expansion of the bath …
system dynamics approach. The method is rooted in an exponential expansion of the bath …
Automatic structural optimization of tree tensor networks
The tree tensor network (TTN) provides an essential theoretical framework for the practical
simulation of quantum many-body systems, where the network structure defined by the …
simulation of quantum many-body systems, where the network structure defined by the …
Automated reasoning in quantum circuit compilation
Automated reasoning techniques have been proven of immense importance in classical
applications like formal verification, circuit design and probabilistic inference. The domain of …
applications like formal verification, circuit design and probabilistic inference. The domain of …
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 …
computer science. We introduce a method to efficiently approximate tensor network …
Entanglement bipartitioning and tree tensor networks
We propose the entanglement bipartitioning approach to design an optimal network
structure of the tree tensor network (TTN) for quantum many-body systems. Given an exact …
structure of the tree tensor network (TTN) for quantum many-body systems. Given an exact …
Tensor networks for -spin models
B Lanthier, J Côté, S Kourtis - Frontiers in Physics, 2024 - frontiersin.org
We introduce a tensor network algorithm for the solution of p-spin models. We show that
bond compression through rank-revealing decompositions performed during the tensor …
bond compression through rank-revealing decompositions performed during the tensor …