اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGeneric Construction of Efficient Matrix Product Operators
70
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Matrix Product Operators (MPOs) are at the heart of the second-generation Density Matrix Renormalisation Group (DMRG) algorithm formulated in Matrix Product State language. We first summarise the widely known facts on MPO arithmetic and representations of single-site operators. Second, we introduce three compression methods (Rescaled SVD, Deparallelisation and Delinearisation) for MPOs and show that it is possible to construct efficient representations of arbitrary operators using MPO arithmetic and compression. As examples, we construct powers of a short-ranged spin-chain Hamiltonian, a complicated Hamiltonian of a two-dimensional system and, as proof of principle, the long-range four-body Hamiltonian from quantum chemistry.
قيم البحث
اقرأ أيضاً
Motivated by the existence of exact many-body quantum scars in the AKLT chain, we explore the connection between Matrix Product State (MPS) wavefunctions and many-body quantum scarred Hamiltonians. We provide a method to systematically search for and
construct parent Hamiltonians with towers of exact eigenstates composed of quasiparticles on top of an MPS wavefunction. These exact eigenstates have low entanglement in spite of being in the middle of the spectrum, thus violating the strong Eigenstate Thermalization Hypothesis (ETH). Using our approach, we recover the AKLT chain starting from the MPS of its ground state, and we derive the most general nearest-neighbor Hamiltonian that shares the AKLT quasiparticle tower of exact eigenstates. We further apply this formalism to other simple MPS wavefunctions, and derive new families of Hamiltonians that exhibit AKLT-like quantum scars. As a consequence, we also construct a scar-preserving deformation that connects the AKLT chain to the integrable spin-1 pure biquadratic model. Finally, we also derive other families of Hamiltonians that exhibit new types of exact quantum scars, including a $U(1)$-invariant perturbed Potts model.
Models whose ground states can be written as an exact matrix product state (MPS) provide valuable insights into phases of matter. While MPS-solvable models are typically studied as isolated points in a phase diagram, they can belong to a connected ne
twork of MPS-solvable models, which we call the MPS skeleton. As a case study where we can completely unearth this skeleton, we focus on the one-dimensional BDI class -- non-interacting spinless fermions with time-reversal symmetry. This class, labelled by a topological winding number, contains the Kitaev chain and is Jordan-Wigner-dual to various symmetry-breaking and symmetry-protected topological (SPT) spin chains. We show that one can read off from the Hamiltonian whether its ground state is an MPS: defining a polynomial whose coefficients are the Hamiltonian parameters, MPS-solvability corresponds to this polynomial being a perfect square. We provide an explicit construction of the ground state MPS, its bond dimension growing exponentially with the range of the Hamiltonian. This complete characterization of the MPS skeleton in parameter space has three significant consequences: (i) any two topologically distinct phases in this class admit a path of MPS-solvable models between them, including the phase transition which obeys an area law for its entanglement entropy; (ii) we illustrate that the subset of MPS-solvable models is dense in this class by constructing a sequence of MPS-solvable models which converge to the Kitaev chain (equivalently, the quantum Ising chain in a transverse field); (iii) a subset of these MPS states can be particularly efficiently processed on a noisy intermediate-scale quantum computer.
We present an extension of the Lowdin strategy to find arbitrary matrix elements of generic Slater determinants. The new method applies to arbitrary number of fermionic operators, even in the case of a singular overlap matrix.
We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product satisfiabi
lity and give a geometrical criterion for deciding when a QSAT interaction graph is product satisfiable with positive probability. We show that the same criterion suffices to establish quantum satisfiability for all projectors. Second, we apply these results to the random graph ensemble with generic projectors and obtain improved lower bounds on the location of the SAT--unSAT transition. Third, we present numerical results on random, generic satisfiability which provide estimates for the location of the transition for k=3 and k=4 and mild evidence for the existence of a phase which is satisfiable by entangled states alone.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
