اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFermionic orbital optimisation in tensor network states
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Tensor network states and specifically matrix-product states have proven to be a powerful tool for simulating ground states of strongly correlated spin models. Recently, they have also been applied to interacting fermionic problems, specifically in the context of quantum chemistry. A new freedom arising in such non-local fermionic systems is the choice of orbitals, it being far from clear what choice of fermionic orbitals to make. In this work, we propose a way to overcome this challenge. We suggest a method intertwining the optimisation over matrix product states with suitable fermionic Gaussian mode transformations. The described algorithm generalises basis changes in the spirit of the Hartree-Fock method to matrix-product states, and provides a black box tool for basis optimisation in tensor network methods.
قيم البحث
اقرأ أيضاً
Suppose we would like to approximate all local properties of a quantum many-body state to accuracy $delta$. In one dimension, we prove that an area law for the Renyi entanglement entropy $R_alpha$ with index $alpha<1$ implies a matrix product state r
epresentation with bond dimension $mathrm{poly}(1/delta)$. For (at most constant-fold degenerate) ground states of one-dimensional gapped Hamiltonians, it suffices that the bond dimension is almost linear in $1/delta$. In two dimensions, an area law for $R_alpha(alpha<1)$ implies a projected entangled pair state representation with bond dimension $e^{O(1/delta)}$. In the presence of logarithmic corrections to the area law, similar results are obtained in both one and two dimensions.
We define a class of tensor network states for spin systems where the individual tensors are functionals of fields. The construction is based on the path integral representation of correlators of operators in quantum field theory. These tensor network states are infinite dimension
Tensor networks are a central tool in condensed matter physics. In this paper, we study the task of tensor network non-zero testing (TNZ): Given a tensor network T, does T represent a non-zero vector? We show that TNZ is not in the Polynomial-Time Hi
erarchy unless the hierarchy collapses. We next show (among other results) that the special cases of TNZ on non-negative and injective tensor networks are in NP. Using this, we make a simple observation: The commuting variant of the MA-complete stoquastic k-SAT problem on D-dimensional qudits is in NP for logarithmic k and constant D. This reveals the first class of quantum Hamiltonians whose commuting variant is known to be in NP for all (1) logarithmic k, (2) constant D, and (3) for arbitrary interaction graphs.
The study of critical quantum many-body systems through conformal field theory (CFT) is one of the pillars of modern quantum physics. Certain CFTs are also understood to be dual to higher-dimensional theories of gravity via the anti-de Sitter/conform
al field theory (AdS/CFT) correspondence. To reproduce various features of AdS/CFT, a large number of discrete models based on tensor networks have been proposed. Some recent models, most notably including toy models of holographic quantum error correction, are constructed on regular time-slice discretizations of AdS. In this work, we show that the symmetries of these models are well suited for approximating CFT states, as their geometry enforces a discrete subgroup of conformal symmetries. Based on these symmetries, we introduce the notion of a quasiperiodic conformal field theory (qCFT), a critical theory less restrictive than full CFT with characteristic multi-scale quasiperiodicity. We discuss holographic code states and their renormalization group flow as specific implementations of a qCFT with fractional central charges and argue that their behavior generalizes to a large class of existing and future models. Beyond approximating CFT properties, we show that these can be best understood as belonging to a new paradigm of discrete holography.
Tensor network states (TNS) are a powerful approach for the study of strongly correlated quantum matter. The curse of dimensionality is addressed by parametrizing the many-body state in terms of a network of partially contracted tensors. These tensor
s form a substantially reduced set of effective degrees of freedom. In practical algorithms, functionals like energy expectation values or overlaps are optimized over certain sets of TNS. Concerning algorithmic stability, it is important whether the considered sets are closed because, otherwise, the algorithms may approach a boundary point that is outside the TNS set and tensor elements diverge. We discuss the closedness and geometries of TNS sets, and we propose regularizations for optimization problems on non-closed TNS sets. We show that sets of matrix product states (MPS) with open boundary conditions, tree tensor network states (TTNS), and the multiscale entanglement renormalization ansatz (MERA) are always closed, whereas sets of translation-invariant MPS with periodic boundary conditions (PBC), heterogeneous MPS with PBC, and projected entangled pair states (PEPS) are generally not closed. The latter is done using explicit examples like the W state, states that we call two-domain states, and fine-grain
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
