اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBethe ansatz on a quantum computer?
101
0
0.0
(
0
)
تأليف
Rafael I. Nepomechie
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider the feasibility of studying the anisotropic Heisenberg quantum spin chain with the Variational Quantum Eigensolver (VQE) algorithm, by treating Bethe states as variational states, and Bethe roots as variational parameters. For short chains, we construct exact one-magnon trial states that are functions of the variational parameter, and implement the VQE calculations in Qiskit. However, exact multi-magnon trial states appear to be out out of reach.
قيم البحث
اقرأ أيضاً
Several quantum many-body models in one dimension possess exact solutions via the Bethe ansatz method, which has been highly successful for understanding their behavior. Nevertheless, there remain physical properties of such models for which analytic
results are unavailable, and which are also not well-described by approximate numerical methods. Preparing Bethe ansatz eigenstates directly on a quantum computer would allow straightforward extraction of these quantities via measurement. We present a quantum algorithm for preparing Bethe ansatz eigenstates of the XXZ spin chain that correspond to real-valued solutions of the Bethe equations. The algorithm is polynomial in the number of T gates and circuit depth, with modest constant prefactors. Although the algorithm is probabilistic, with a success rate that decreases with increasing eigenstate energy, we employ amplitude amplification to boost the success probability. The resource requirements for our approach are lower than other state-of-the-art quantum simulation algorithms for small error-corrected devices, and thus may offer an alternative and computationally less-demanding demonstration of quantum advantage for physically relevant problems.
We analyze the conditions for producing atomic number states in a one-dimensional optical box using the Bethe ansatz method. This approach provides a general framework, enabling the study of number state production over a wide range of realistic experimental parameters.
In this paper, we investigate the effect of different optical field initial states on the performance of Tavis-Cummings(T-C) quantum battery. In solving the dynamical evolution of the system, we found a fast way to solve the Bethe ansatz equation. We
find that the stored energy and the average charging power of the T-C quantum battery are closely related to the probability distribution of the optical field initial state in the number states. We define a quantity called the number state stored energy. With this prescribed quantity, we only need to know the probability distribution of the optical field initial state in the number states to obtain the stored energy and the average charging power of the T-C quantum battery at any moment. We propose an equal probability and equal expected value allocation method by which we can obtain two inequalities, and the two inequalities can be reduced to Jensens inequalities. By this method, we found the optimal initial state of the optical field. We found that the maximum stored energy and the maximum average charging power of the T-C quantum battery are proportional to the initial average photon number. The quantum battery can be fully charged when the initial average photon number is large enough. We found two novel phenomena, which can be described by two empirical inequalities. These two novel phenomena reflect the hypersensitivity of the stored energy of the T-C quantum battery to the number-state cavity field.
We establish the method of Bethe ansatz for the XXZ type model obtained from the R-matrix associated to quantum toroidal gl(1). We do that by using shuffle realizations of the modules and by showing that the Hamiltonian of the model is obtained from
a simple multiplication operator by taking an appropriate quotient. We expect this approach to be applicable to a wide variety of models.
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are significant
because they are the first to have time-complexities that are comparable to the best known methods for simulating time-independent Hamiltonian evolution, given appropriate smoothness criteria on the Hamiltonian are satisfied. We provide a thorough cost analysis of these algorithms that considers discretizion errors in both the time and the representation of the Hamiltonian. In addition, we provide the first upper bounds for the error in Lie-Trotter-Suzuki approximations to unitary evolution operators, that use adaptively chosen time steps.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
