اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn Efficient Matrix Product Operator Representation of the Quantum-Chemical Hamiltonian
147
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 product 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.
قيم البحث
اقرأ أيضاً
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 ne
twork. 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 develop a resource efficient step-merged quantum imaginary time evolution approach (smQITE) to solve for the ground state of a Hamiltonian on quantum computers. This heuristic method features a fixed shallow quantum circuit depth along the state e
volution path. We use this algorithm to determine binding energy curves of a set of molecules, including H$_2$, H$_4$, H$_6$, LiH, HF, H$_2$O and BeH$_2$, and find highly accurate results. The required quantum resources of smQITE calculations can be further reduced by adopting the circuit form of the variational quantum eigensolver (VQE) technique, such as the unitary coupled cluster ansatz. We demonstrate that smQITE achieves a similar computational accuracy as VQE at the same fixed-circuit ansatz, without requiring a generally complicated high-dimensional non-convex optimization. Finally, smQITE calculations are carried out on Rigetti quantum processing units (QPUs), demonstrating that the approach is readily applicable on current noisy intermediate-scale quantum (NISQ) devices.
Any quantum process is represented by a sequence of quantum channels. We consider ergodic processes, obtained by sampling channel valued random variables along the trajectories of an ergodic dynamical system. Examples of such processes include the ef
fect of repeated application of a fixed quantum channel perturbed by arbitrary correlated noise, or a sequence of channels drawn independently and identically from an ensemble. Under natural irreducibility conditions, we obtain a theorem showing that the state of a system evolving by such a process converges exponentially fast to an ergodic sequence of states depending on the process, but independent of the initial state of the system. As an application, we describe the thermodynamic limit of ergodic matrix product states and prove that the 2-point correlations of local observables in such states decay exponentially with their distance in the bulk. Further applications and physical implications of our results are discussed in the companion paper [11].
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.
Matrix Product States form the basis of powerful simulation methods for ground state problems in one dimension. Their power stems from the fact that they faithfully approximate states with a low amount of entanglement, the area law. In this work, we
establish the mixed state analogue of this result: We show that one-dimensional mixed states with a low amount of entanglement, quantified by the entanglement of purification, can be efficiently approximated by Matrix Product Density Operators (MPDOs). In combination with results establishing area laws for thermal states, this helps to put the use of MPDOs in the simulation of thermal states on a formal footing.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
