اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum symmetry from enhanced sampling methods
205
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We address the problem of the minus sign sampling for two electron systems using the path integral approach. We show that this problem can be reexpressed as one of computing free energy differences and sampling the tails of statistical distributions. Using Metadynamics, a realistic problem like that of two electrons confined in a quantum dot can be solved. We believe that this is a strategy that can possibly be extended to more complex systems.
قيم البحث
اقرأ أيضاً
We investigate how the presence of quantum correlations can influence work extraction in closed quantum systems, establishing a new link between the field of quantum non-equilibrium thermodynamics and the one of quantum information theory. We conside
r a bipartite quantum system and we show that it is possible to optimise the process of work extraction, thanks to the correlations between the two parts of the system, by using an appropriate feedback protocol based on the concept of ergotropy. We prove that the maximum gain in the extracted work is related to the existence of quantum correlations between the two parts, quantified by either quantum discord or, for pure states, entanglement. We then illustrate our general findings on a simple physical situation consisting of a qubit system.
Many processes in chemistry and physics take place on timescales that cannot be explored using standard molecular dynamics simulations. This renders the use of enhanced sampling mandatory. Here we introduce an enhanced sampling method that is based o
n constructing a model probability density from which a bias potential is derived. The model relies on the fact that in a physical system most of the configurations visited can be grouped into isolated metastable islands. To each island we associate a distribution that is fitted to a Gaussian mixture. The different distributions are linearly combined together with coefficients that are computed self consistently. Remarkably, from this biased dynamics, rates of transition between different metastable states can be straightforwardly computed.
The spectral fluctuations of complex quantum systems, in appropriate limit, are known to be consistent with that obtained from random matrices. However, this relation between the spectral fluctuations of physical systems and random matrices is valid
only if the spectra are desymmetrized. This implies that the fluctuation properties of the spectra are affected by the discrete symmetries of the system. In this work, it is shown that in the chaotic limit the fluctuation characteristics and symmetry structure for any arbitrary sequence of measured or computed levels can be inferred from its higher-order spectral statistics without desymmetrization. In particular, we consider a spectrum composed of $k>0$ independent level sequences with each sequence having the same level density. The $k$-th order spacing ratio distribution of such a composite spectrum is identical to its nearest neighbor counterpart with modified Dyson index $k$. This is demonstrated for the spectra obtained from random matrices, quantum billiards, spin chains and experimentally measured nuclear resonances with disparate symmetry features.
Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a given discrete objective function. An interpretation of such a function as the energy of a classical system allows us to reduce the optimization proble
m into the preparation of a low-temperature thermal state of the system. Motivated by the quantum annealing method, we present three strategies to prepare the low-temperature state that exploit quantum mechanics in remarkable ways. We focus on implementations without uncontrolled errors induced by the environment. This allows us to rigorously prove a quantum advantage. The first strategy uses a classical-to-quantum mapping, where the equilibrium properties of a classical system in $d$ spatial dimensions can be determined from the ground state properties of a quantum system also in $d$ spatial dimensions. We show how such a ground state can be prepared by means of quantum annealing, including quantum adiabatic evolutions. This mapping also allows us to unveil some fundamental relations between simulated and quantum annealing. The second strategy builds upon the first one and introduces a technique called spectral gap amplification to reduce the time required to prepare the same quantum state adiabatically. If implemented on a quantum device that exploits quantum coherence, this strategy leads to a quadratic improvement in complexity over the well-known bound of the classical simulated annealing method. The third strategy is not purely adiabatic; instead, it exploits diabatic processes between the low-energy states of the corresponding quantum system. For some problems it results in an exponential speedup (in the oracle model) over the best classical algorithms.
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of quantum algorit
hms that provide unbiased samples by preparing a state encoding the entire Gibbs distribution. We show that this approach leads to a speedup over a classical Markov chain algorithm for several examples including the Ising model and sampling from weighted independent sets of two different graphs. Our approach connects computational complexity with phase transitions, providing a physical interpretation of quantum speedup. Moreover, it opens the door to exploring potentially useful sampling algorithms on near-term quantum devices as the algorithm for sampling from independent sets on certain graphs can be naturally implemented using Rydberg atom arrays.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
