اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA tensor network approach to 2D bosonization
94
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a 2D bosonization duality using the language of tensor networks. Specifically, we construct a tensor network operator (TNO) that implements an exact 2D bosonization duality. The primary benefit of the TNO is that it allows for bosonization at the level of quantum states. Thus, we use the TNO to provide an explicit algorithm for bosonizing fermionic projected entangled pair states (fPEPs). A key step in the algorithm is to account for a choice of spin-structure, encoded in a set of bonds of the bosonized fPEPS. This enables our tensor network approach to bosonization to be applied to systems on arbitrary triangulations of orientable 2D manifolds.
قيم البحث
اقرأ أيضاً
We use a recently proposed class of tensor-network states to study phase transitions in string-net models. These states encode the genuine features of the string-net condensate such as, e.g., a nontrivial perimeter law for Wilson loops expectation va
lues, and a natural order parameter detecting the breakdown of the topological phase. In the presence of a string tension, a quantum phase transition occurs between the topological phase and a trivial phase. We benchmark our approach for $mathbb{Z}_2$ string nets and capture the second-order phase transition which is well known from the exact mapping onto the transverse-field Ising model. More interestingly, for Fibonacci string nets, we obtain first-order transitions in contrast with previous studies but in qualitative agreement with mean-field results.
We implement and benchmark tensor network algorithms with $SU(2)$ symmetry for systems in two spatial dimensions and in the thermodynamic limit. Specifically, we implement $SU(2)$-invaria
We study equilibrium and nonequilibrium properties of the single-impurity Anderson model with a power-law pseudogap in the density of states. In equilibrium, the model is known to display a quantum phase transition from a generalized Kondo to a local
moment phase. In the present work, we focus on the extension of these phases beyond equilibrium, i.e. under the influence of a bias voltage. Within the auxiliary master equation approach combined with a scheme based on matrix product states (MPS) we are able to directly address the current-carrying steady state. Starting with the equilibrium situation, we first corroborate our results by comparing with a direct numerical evaluation of ground state spectral properties of the system by MPS. Here, a scheme to locate the phase boundary by extrapolating the power-law exponent of the self energy produces a very good agreement with previous results obtained by the numerical renormalization group. Our nonequilibrium study as a function of the applied bias voltage is then carried out for two points on either side of the phase boundary. In the Kondo regime the resonance in the spectral function is splitted as a function of the increasing bias voltage. The local moment regime, instead, displays a dip in the spectrum near the position of the chemical potentials. Similar features are observed in the corresponding self energies. The Kondo split peaks approximately obey a power-law behavior as a function of frequency, whose exponents depend only slightly on voltage. Finally, the differential conductance in the Kondo regime shows a peculiar maximum at finite voltages, whose height, however, is below the accuracy level.
Tensor network (TN) techniques - often used in the context of quantum many-body physics - have shown promise as a tool for tackling machine learning (ML) problems. The application of TNs to ML, however, has mostly focused on supervised and unsupervis
ed learning. Yet, with their direct connection to hidden Markov chains, TNs are also naturally suited to Markov decision processes (MDPs) which provide the foundation for reinforcement learning (RL). Here we introduce a general TN formulation of finite, episodic and discrete MDPs. We show how this formulation allows us to exploit algorithms developed for TNs for policy optimisation, the key aim of RL. As an application we consider the issue - formulated as an RL problem - of finding a stochastic evolution that satisfies specific dynamical conditions, using the simple example of random walk excursions as an illustration.
We comment on the paper by H. Yoshioka and A. Odintsov, to appear in PRL, see cond-mat/9805106.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
