Related papers: Tensor network variational optimizations for real-…
We analyze the recently developed folding algorithm [Phys. Rev. Lett. 102, 240603 (2009)] to simulate the dynamics of infinite quantum spin chains, and relate its performance to the kind of entanglement produced under the evolution of…
Matrix product states (MPSs) and matrix product operators (MPOs) are fundamental tools in the study of quantum many-body systems, particularly in the context of tensor network methods such as Time-Evolving Block Decimation (TEBD). However,…
We present an improved version of the algorithm contracting and optimizing finite projected entangled pair states (fPEPS) in conjunction with projected entangled pair operators (PEPOs). Our work has two components to it. First, we explain…
We introduce a widely applicable tensor network-based framework for developing reduced order models describing wall-bounded fluid flows. As a paradigmatic example, we consider the incompressible Navier-Stokes equations and the lid-driven…
In this study, we introduce a novel family of tensor networks, termed constrained matrix product states (MPS), designed to incorporate exactly arbitrary discrete linear constraints, including inequalities, into sparse block structures.…
The recently proposed Clifford Circuits Augmented Matrix Product States (CA-MPS) (arXiv:2405.09217) seamlessly augments Density Matrix Renormalization Group with Clifford circuits. In CA-MPS, the entanglement from stabilizers is transferred…
The transverse folding algorithm [Phys. Rev. Lett. 102, 240603] is a tensor network method to compute time-dependent local observables in out-of-equilibrium quantum spin chains that can sometimes overcome the limitations of matrix product…
Temporal network link prediction is an important task in the field of network science, and has a wide range of applications in practical scenarios. Revealing the evolutionary mechanism of the network is essential for link prediction, and…
We introduce a new tensor integration method for time-dependent PDEs that controls the tensor rank of the PDE solution via time-dependent diffeomorphic coordinate transformations. Such coordinate transformations are generated by minimizing…
Recently, the Shifted Boundary Method (SBM) was proposed within the class of unfitted (or immersed, or embedded) finite element methods. By reformulating the original boundary value problem over a surrogate (approximate) computational…
Tensor networks, a model that originated from quantum physics, has been gradually generalized as efficient models in machine learning in recent years. However, in order to achieve exact contraction, only tree-like tensor networks such as…
We study an asymptotic preserving scheme for the temporal discretization of a system of parabolic semilinear SPDEs with two time scales. Owing to the averaging principle, when the time scale separation $\epsilon$ vanishes, the slow…
We present the partial evolutionary tensor neural networks (pETNNs), a novel framework for solving time-dependent partial differential equations with high accuracy and capable of handling high-dimensional problems. Our architecture…
The adaptive variational quantum dynamics simulation (AVQDS) method performs real-time evolution of quantum states using automatically generated parameterized quantum circuits that often contain substantially fewer gates than Trotter…
Unrolled computation graphs arise in many scenarios, including training RNNs, tuning hyperparameters through unrolled optimization, and training learned optimizers. Current approaches to optimizing parameters in such computation graphs…
A Gibbs operator $e^{-\beta H}$ for a 2D lattice system with a Hamiltonian $H$ can be represented by a 3D tensor network, the third dimension being the imaginary time (inverse temperature) $\beta$. Coarse-graining the network along $\beta$…
We report on a systematic implementation of su(2) invariance for matrix product states (MPS) with concrete computations cast in a diagrammatic language. As an application we present a variational MPS study of $su(2)$ invariant quantum spin…
When considering a general system of equations describing the space-time evolution (flow) of one or several variables, the problem of the optimization over a finite period of time of a measure of the state variable at the final time is a…
A numerical method is proposed to solve the full-Eulerian time-dependent Vlasov-Poisson system in high dimension. The algorithm relies on the construction of a tensor decomposition of the solution whose rank is adapted at each time step.…
This paper is a manual with tips and tricks for programming tensor network algorithms with global $SU(2)$ symmetry. We focus on practical details that are many times overlooked when it comes to implementing the basic building blocks of…