اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBures metric over thermal state manifolds and quantum criticality
161
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We analyze the Bures metric over the manifold of thermal density matrices for systems featuring a zero temperature quantum phase transition. We show that the quantum critical region can be characterized in terms of the temperature scaling behavior of the metric tensor itself. Furthermore, the analysis of the metric tensor when both temperature and an external field are varied, allows to complement the understanding of the phase diagram including cross-over regions which are not characterized by any singular behavior. These results provide a further extension of the scope of the metric approach to quantum criticality.
قيم البحث
اقرأ أيضاً
The quantum information and the Bures metric are equivalent to each other, except at points where the rank of the density matrix changes. Here we show that by slightly modifying the definition of the Bures metric, the quantum information will be full
y equivalent to the Bures metric without exception.
Promising applications of the anisotropic quantum Rabi model (AQRM) in broad parameter ranges are explored, which is realized with superconducting flux qubits simultaneously driven by two-tone time-dependent magnetic fields. Regarding the quantum pha
se transitions (QPTs), with assistant of fidelity susceptibility, we extract the scaling functions and the critical exponents, with which the universal scaling of the cumulant ratio is captured with rescaling of the parameters due to the anisotropy. Moreover, a fixed point of the cumulant ratio is predicted at the critical point of the AQRM. In respect to quantum information tasks, the generation of the macroscopic Schr{o}dinger cat states and quantum controlled phase gates are investigated in the degenerate case of the AQRM, whose performance is also investigated by numerical calculation with practical parameters. Therefore, our results pave a way to explore distinct features of the AQRM in circuit QED systems for QPTs, quantum simulations and quantum information processings.
As a vital problem in classification-oriented transfer, unsupervised domain adaptation (UDA) has attracted widespread attention in recent years. Previous UDA methods assume the marginal distributions of different domains are shifted while ignoring th
e discriminant information in the label distributions. This leads to classification performance degeneration in real applications. In this work, we focus on the conditional distribution shift problem which is of great concern to current conditional invariant models. We aim to seek a kernel covariance embedding for conditional distribution which remains yet unexplored. Theoretically, we propose the Conditional Kernel Bures (CKB) metric for characterizing conditional distribution discrepancy, and derive an empirical estimation for the CKB metric without introducing the implicit kernel feature map. It provides an interpretable approach to understand the knowledge transfer mechanism. The established consistency theory of the empirical estimation provides a theoretical guarantee for convergence. A conditional distribution matching network is proposed to learn the conditional invariant and discriminative features for UDA. Extensive experiments and analysis show the superiority of our proposed model.
This article contains a survey of the geometric approach to quantum correlations. We focus mainly on the geometric measures of quantum correlations based on the Bures and quantum Hellinger distances.
Generative Adversarial Networks (GANs) are performant generative methods yielding high-quality samples. However, under certain circumstances, the training of GANs can lead to mode collapse or mode dropping, i.e. the generative models not being able t
o sample from the entire probability distribution. To address this problem, we use the last layer of the discriminator as a feature map to study the distribution of the real and the fake data. During training, we propose to match the real batch diversity to the fake batch diversity by using the Bures distance between covariance matrices in feature space. The computation of the Bures distance can be conveniently done in either feature space or kernel space in terms of the covariance and kernel matrix respectively. We observe that diversity matching reduces mode collapse substantially and has a positive effect on the sample quality. On the practical side, a very simple training procedure, that does not require additional hyperparameter tuning, is proposed and assessed on several datasets.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
