اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMatrix product operator representation of polynomial interactions
75
0
0.0
(
0
)
تأليف
Michael L. Wall
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 tensor network. We show that the bond dimension is $(k+3)$ for a polynomial of order $k$, independent of the system size and the number of particles. Our construction is manifestly translationally invariant, and so may be used in finite- or infinite-size variational matrix product state algorithms. Our results provide new insight into the correlation structure of many-body quantum operators, and may also be practical in simulations of many-body systems whose interactions are exponentially screened at large distances, but may have complex short-distance structure.
قيم البحث
اقرأ أيضاً
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 particular
, we construct translational invariant matrix product operators suitable for time evolution, and show how such descriptions are possible for Hamiltonians with long-range interactions. We illustrate how those tools can be exploited for constructing new algorithms for simulating quantum spin systems.
We describe how to efficiently construct the quantum chemical Hamiltonian operator in matrix product form. We present its implementation as a density matrix renormalization group (DMRG) algorithm for quantum chemical applications in a purely matrix p
roduct based framework. Existing implementations of DMRG for quantum chemistry are based on the traditional formulation of the method, which was developed from a viewpoint of Hilbert space decimation and attained a higher performance compared to straightforward implementations of matrix product based DMRG. The latter variationally optimizes a class of ansatz states known as matrix product states (MPS), where operators are correspondingly represented as matrix product operators (MPO). The MPO construction scheme presented here eliminates the previous performance disadvantages while retaining the additional flexibility provided by a matrix product approach; for example, the specification of expectation values becomes an input parameter. In this way, MPOs for different symmetries - abelian and non-abelian - and different relativistic and non-relativistic models may be solved by an otherwise unmodified program.
Just as matrix product states represent ground states of one-dimensional quantum spin systems faithfully, continuous matrix product states (cMPS) provide faithful representations of the vacuum of interacting field theories in one spatial dimension. U
nlike the quantum spin case however, for which the density matrix renormalization group and related matrix product state algorithms provide robust algorithms for optimizing the variational states, the optimization of cMPS for systems with inhomogeneous external potentials has been problematic. We resolve this problem by constructing a piecewise linear parameterization of the underlying matrix-valued functions, which enables the calculation of the exact reduced density matrices everywhere in the system by high-order Taylor expansions. This turns the variational cMPS problem into a variational algorithm from which both the energy and its backwards derivative can be calculated exactly and at a cost that scales as the cube of the bond dimension. We illustrate this by finding ground states of interacting bosons in external potentials, and by calculating boundary or Casimir energy corrections of continuous many-body systems with open boundary conditions.
We report numerical results on the diagonalization of 1D transverse field Ising model. Numerical simulations using the Pauli product representation yield diagonalization from 3 spins to 22 spins in the transverse field Ising model with the number of
global Jacobi unitary transformations and number of final terms in diagonalized spin z representation both grew polynomial with the number of spins. These results computed on a classical computer show promise in constructing a quantum circuit to simulate diagonalized generic many-particle Hamiltonians using polynomial number of gates.
We demonstrate that the optimal states in lossy quantum interferometry may be efficiently simulated using low rank matrix product states. We argue that this should be expected in all realistic quantum metrological protocols with uncorrelated noise an
d is related to the elusive nature of the Heisenberg precision scaling in presence of decoherence.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
