相关论文: Optimal Symbolic Construction of Matrix Product Op…

This work is concerned with tree tensor network operators (TTNOs) for representing quantum Hamiltonians. We first establish a mathematical framework connecting tree topologies with state diagrams. Based on these, we devise an algorithm for…

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-configuration time-dependent Hartree (ML-MCTDH) method. In…

Compactly representing and efficently applying linear operators are fundamental ingredients in tensor network methods for simulating quantum many-body problems and solving high-dimensional problems in scientific computing. In this work, we…

We propose a tensor-network (TN) approach for solving classical optimization problems that is inspired by spectral filtering and sampling on quantum states. We first shift and scale an Ising Hamiltonian of the cost function so that all…

We provide an exact construction of interaction Hamiltonians on a one-dimensional lattice which grow as a polynomial multiplied by an exponential with the lattice site separation as a matrix product operator (MPO), a type of one-dimensional…

We introduce a matrix product operator (MPO) encoding of the Magnus expansion and the Dyson series for one-dimensional quantum lattice models with time-dependent Hamiltonians. The MPO construction can be made accurate up to arbitrary order…

Matrix Product Operators (MPOs) are tensor networks representing operators acting on 1D systems. They model a wide variety of situations, including communication channels with memory effects, quantum cellular automata, mixed states in 1D…

We show how to construct relevant families of matrix product operators in one and higher dimensions. Those form the building blocks for the numerical simulation methods based on matrix product states and projected entangled pair states. In…

Tensor network operators, such as the matrix product operator (MPO) and the projected entangled-pair operator (PEPO), can provide efficient representation of certain linear operators in high dimensional spaces. This paper focuses on the…

Matrix product states (MPS) and matrix product operators (MPOs) are one dimensional tensor networks that underlie the modern density matrix renormalization group (DMRG) algorithm. The use of MPOs accounts for the high level of generality…

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 correlation function, which in essence strategically reshapes a…

Quantum computing is arguably one of the most revolutionary and disruptive technologies of this century. Due to the ever-increasing number of potential applications as well as the continuing rise in complexity, the development, simulation,…

We introduce a coefficient-decoupled matrix product operator (MPO) representation for Pauli-sum operators that separates reusable symbolic operator support from a tunable coefficient bridge across a fixed bipartition. This representation…

A deep neural network is a parametrization of a multilayer mapping of signals in terms of many alternatively arranged linear and nonlinear transformations. The linear transformations, which are generally used in the fully connected as well…

We present an algorithmic construction scheme for matrix-product-operator (MPO) representations of arbitrary $U(1)$-invariant operators whenever there is an expression of the local structure in terms of a finite-states machine (FSM). Given…

Approaching the long-time dynamics of non-Markovian open quantum systems presents a challenging task if the bath is strongly coupled. Recent proposals address this problem through a representation of the so-called process tensor in terms of…

Tensor networks and quantum computation are two of the most powerful tools for the simulation of quantum many-body systems. Rather than viewing them as competing approaches, here we consider how these two methods can work in tandem. We…

In optimization, one of the well-known classical algorithms is power iterations. Simply stated, the algorithm recovers the dominant eigenvector of some diagonalizable matrix. Since numerous optimization problems can be formulated as an…

We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our…

We show how to learn structures of generic, non-Markovian, quantum stochastic processes using a tensor network based machine learning algorithm. We do this by representing the process as a matrix product operator (MPO) and train it with a…