اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA primal-dual semidefinite programming algorithm tailored to the variational determination of the two-body density matrix
106
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The quantum many-body problem can be rephrased as a variational determination of the two-body reduced density matrix, subject to a set of N-representability constraints. The mathematical problem has the form of a semidefinite program. We adapt a standard primal-dual interior point algorithm in order to exploit the specific structure of the physical problem. In particular the matrix-vector product can be calculated very efficiently. We have applied the proposed algorithm to a pairing-type Hamiltonian and studied the computational aspects of the method. The standard N-representability conditions perform very well for this problem.
قيم البحث
اقرأ أيضاً
We introduce Extended Density Matrix Embedding Theory (EDMET), a static quantum embedding theory explicitly self-consistent with respect to two-body environmental interactions. This overcomes the biggest practical and conceptual limitation of more tr
aditional one-body embedding methods, namely the lack of screening and treatment of long-range correlations. This algebraic zero-temperature embedding augments the correlated cluster with a minimal number of bosons from the random phase approximation, and admits an analytic approach to build a self-consistent Coulomb-exchange-correlation kernel. For extended Hubbard models with non-local interactions, this leads to the accurate description of phase transitions, static quantities and dynamics. We also move towards {em ab initio} systems via the Parriser--Parr--Pople model of conjugated coronene derivatives, finding good agreement with experimental optical gaps.
Semidefinite Programming (SDP) is a class of convex optimization programs with vast applications in control theory, quantum information, combinatorial optimization and operational research. Noisy intermediate-scale quantum (NISQ) algorithms aim to ma
ke an efficient use of the current generation of quantum hardware. However, optimizing variational quantum algorithms is a challenge as it is an NP-hard problem that in general requires an exponential time to solve and can contain many far from optimal local minima. Here, we present a current term NISQ algorithm for SDP. The classical optimization program of our NISQ solver is another SDP over a smaller dimensional ansatz space. We harness the SDP based formulation of the Hamiltonian ground state problem to design a NISQ eigensolver. Unlike variational quantum eigensolvers, the classical optimization program of our eigensolver is convex, can be solved in polynomial time with the number of ansatz parameters and every local minimum is a global minimum. Further, we demonstrate the potential of our NISQ SDP solver by finding the largest eigenvalue of up to $2^{1000}$ dimensional matrices and solving graph problems related to quantum contextuality. We also discuss NISQ algorithms for rank-constrained SDPs. Our work extends the application of NISQ computers onto one of the most successful algorithmic frameworks of the past few decades.
A distributed-memory parallelization strategy for the density matrix renormalization group is proposed for cases where correlation functions are required. This new strategy has substantial improvements with respect to previous works. A scalability an
alysis shows an overall serial fraction of 9.4% and an efficiency of around 60% considering up to eight nodes. Sources of possible parallel slowdown are pointed out and solutions to circumvent these issues are brought forward in order to achieve a better performance.
We characterize the conditions under which a translationally invariant matrix product state (MPS) is invariant under local transformations. This allows us to relate the symmetry group of a given state to the symmetry group of a simple tensor. We expl
oit this result in order to prove and extend a version of the Lieb-Schultz-Mattis theorem, one of the basic results in many-body physics, in the context of MPS. We illustrate the results with an exhaustive search of SU(2)--invariant two-body Hamiltonians which have such MPS as exact ground states or excitations.
The density-matrix renormalization group (DMRG) method, which can deal with a large active space composed of tens of orbitals, is nowadays widely used as an efficient addition to traditional complete active space (CAS)-based approaches. In this paper
, we present the DMRG algorithm with a multi-level (ML) control of the active space based on chemical intuition-based hierarchical orbital ordering, which is called as ML-DMRG with its self-consistent field variant ML-DMRG-SCF. Ground and excited state calculations of H2O, N2, indole, and Cr2 with comparisons to DMRG references using fixed number of kept states (M) illustrate that MLtype DMRG calculations can obtain noticeable efficiency gains. It is also shown that the orbital re-ordering based on hierarchical multiple active subspaces may be beneficial for reducing computational time for not only ML-DMRG calculations but also DMRG ones with fixed M values.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
