Related papers: Quantum real-time evolution using tensor renormali…
We have discussed the tensor-network representation of classical statistical or interacting quantum lattice models, and given a comprehensive introduction to the numerical methods we recently proposed for studying the tensor-network…
We propose a new tensor renormalization group algorithm, Anisotropic Tensor Renormalization Group (ATRG), for lattice models in arbitrary dimensions. The proposed method shares the same versatility with the Higher-Order Tensor…
A novel scheme to simulate the evolution of a restricted set of observables of a quantum system is proposed. The set comprises the spectrum-generating algebra of the Hamiltonian. The idea is to consider a certain open-system evolution,…
Understanding the intricate properties of one-dimensional quantum systems coupled to multiple reservoirs poses a challenge to both analytical approaches and simulation techniques. Fortunately, density matrix renormalization group-based…
We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of quantum circuits. This algorithm can be seen as the extension of time-dependent DMRG from the usual situation of hermitian Hamiltonian matrices to…
Imaginary-time evolution, an important technique in tensor network and quantum Monte Carlo algorithms on classical computers, has recently been adapted to quantum computing. In this study, we focus on probabilistic imaginary-time evolution…
The machine learning approaches are applied in the dynamical simulation of open quantum systems. The long short-term memory recurrent neural network (LSTM-RNN) models are used to simulate the long-time quantum dynamics, which are built…
An important aspect in understanding the dynamics in the context of deparametrized models of LQG is to obtain a sufficient control on the quantum evolution generated by a given Hamiltonian operator. More specifically, we need to be able to…
We introduce a coarse-graining transformation for tensor networks that can be applied to study both the partition function of a classical statistical system and the Euclidean path integral of a quantum many-body system. The scheme is based…
In light of recent exciting progress in building up quantum computing facilities based on both optical and cold-atom techniques, the algorithms for quantum simulations of particle-physics systems are in rapid progress. In this paper, we…
We investigate the behavior of quantum coherence of the ground states of 2D Heisenberg XY model and 2D Ising model with transverse field on square lattices, by using the method of Quantum Renormalization Group (QRG). We show that the…
The simulation of time evolution of large quantum systems is a classically challenging and in general intractable task, making it a promising application for quantum computation. A Trotter-Suzuki approximation yields an implementation…
A new theoretical method is proposed to describe the ground and excited cluster states of atomic nuclei. The method utilizes the equation-of-motion of the Gaussian wave packets to generate the basis wave functions having various cluster…
The advent of near-term digital quantum computers could offer us an exciting opportunity to investigate quantum many-body phenomena beyond that of classical computing. To make the best use of the hardware available, it is paramount that we…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
In these lecture notes, we present a pedagogical review of a number of related {\it numerically exact} approaches to quantum many-body problems. In particular, we focus on methods based on the exact diagonalization of the Hamiltonian matrix…
We propose a method to construct the initial tensor representation of partition functions and observables for the tensor renormalization group (TRG). The TRG is a numerical calculation technique that utilizes a tensor network…
We present a quantum algorithm for simulating the time evolution generated by any bounded, time-dependent operator $-A$ with non-positive logarithmic norm, thereby serving as a natural generalization of the Hamiltonian simulation problem.…
We study the time evolution of correlation functions in closed quantum systems for nonequilibrium ensembles of initial conditions. For a scalar quantum field theory we show that generic time-reversal invariant evolutions approach…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…