Related papers: Tensor network calculation of boundary and corner …
In many applications, it is needed to change the topology of a tensor network directly and without approximation. This work will introduce a general scheme that satisfies these needs. We will describe the procedure by two examples and show…
Squared tensor networks (TNs) and their extension as computational graphs--squared circuits--have been used as expressive distribution estimators, yet supporting closed-form marginalization. However, the squaring operation introduces…
We propose an efficient numerical method to obtain local order parameter in two-dimensional systems using spiral boundary conditions. As a benchmark, we first estimate the magnitude of staggered magnetization for the $S=1/2$ XXZ Heisenberg…
Systems of Y-junctions are interesting both from a fundamental viewpoint and because of their potential use in nanoscale devices. These systems can be studied numerically with the density matrix renormalization group(DMRG), but existing…
We speed up thermal simulations of quantum many-body systems in both one- (1D) and two-dimensional (2D) models in an exponential way by iteratively projecting the thermal density matrix $\hat\rho=e^{-\beta \hat{H}}$ onto itself. We refer to…
The development of tensor renormalization group (TRG) algorithm in higher dimensions is an important and urgent task, as the TRG is expected to provide a way to overcome the sign problem in lattice quantum chromodynamics (QCD) calculations…
We analyze in some detail a recently proposed transfer matrix mean field approximation which yields the exact critical point for several two dimensional nearest neighbor Ising models. For the square lattice model we show explicitly that…
Simple analytical formulae, directly relating the experimental geometry and sample orientation to the measured R(M)XS scattered intensity are very useful to design experiments and analyse data. Such formulae can be obtained by the…
Tensor-network Born machines (TNBMs) are quantum-inspired generative models for learning data distributions. Using tensor-network contraction and optimization techniques, the model learns an efficient representation of the target…
Tensor-based modulation (TBM) has been proposed in the context of unsourced random access for massive uplink communication. In this modulation, transmitters encode data as rank-1 tensors, with factors from a discrete vector constellation.…
A modified density matrix renormalization group (DMRG) algorithm is applied to the zigzag spin-1/2 chain with frustrated antiferromagnetic exchange $J_1$, $J_2$ between first and second neighbors. The modified algorithm yields accurate…
The density-matrix renormalization-group (DMRG) algorithm is extended to treat time-dependent problems. The method provides a systematic and robust tool to explore out-of-equilibrium phenomena in quantum many-body systems. We illustrate the…
The numerical study of anyonic systems is known to be highly challenging due to their non-bosonic, non-fermionic particle exchange statistics, and with the exception of certain models for which analytical solutions exist, very little is…
Given in the title are two algorithms to compute the extreme eigenstate of a high-dimensional Hermitian matrix using the tensor train (TT) / matrix product states (MPS) representation. Both methods empower the traditional alternating…
A new density matrix renormalisation group (DMRG) approach is presented for quantum systems of two spatial dimensions. In particular, it is shown that it is possible to create a multi-chain-type 2D DMRG approach which utilises previously…
Tensor decomposition of convolutional and fully-connected layers is an effective way to reduce parameters and FLOP in neural networks. Due to memory and power consumption limitations of mobile or embedded devices, the quantization step is…
The physical properties of a quantum many-body system can, in principle, be determined by diagonalizing the respective Hamiltonian, but the dimensions of its matrix representation scale exponentially with the number of degrees of freedom.…
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…
A zero-site density matrix renormalization algorithm (DMRG0) is proposed to minimize the energy of matrix product states (MPS). Instead of the site tensors themselves, we propose to optimize sequentially the "message" tensors between…
We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex…