اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSimulation of multiple-quantum NMR dynamics of spin dimer on quantum computer
117
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Dymanics of spin dimers in multiple quantum NMR experiment is studied on the 5-qubit superconducting quantum processor of IBM {Quantum Experience} for the both {pure} ground and thermodynamic equilibrium (mixed) initial states. The work can be considered as a first step towards an application of quantum computers to solving problems of magnetic resonance. This article is dedicated to Prof. Klaus Mobius and Prof. Kev Salikhov on the occasion of their 85th birthdays.
قيم البحث
اقرأ أيضاً
Dynamics of entanglement is investigated on the basis of exactly solvable models of multiple-quantum (MQ) NMR spin dynamics. It is shown that the time evolution of MQ coherences of systems of coupled nuclear spins in solids is directly connected with
dynamics of the quantum entanglement. We studied analytically dynamics of entangled states for two- and three-spin systems coupled by the dipole-dipole interaction. In this case dynamics of the quantum entanglement is uniquely determined by the time evolution of MQ coherences of the second order. The real part of the density matrix describing MQ dynamics in solids is responsible for MQ coherences of the zeroth order while its imaginary part is responsible for the second order. Thus, one can conclude that dynamics of the entanglement is connected with transitions from the real part of the density matrix to the imaginary one and vice versa. A pure state which generalizes the GHZ and W states is found. Different measures of the entanglement of this state are analyzed for three-partite systems.
We point out that superconducting quantum computers are prospective for the simulation of the dynamics of spin models far from equilibrium, including nonadiabatic phenomena and quenches. The important advantage of these machines is that they are prog
rammable, so that different spin models can be simulated in the same chip, as well as various initial states can be encoded into it in a controllable way. This opens an opportunity to use superconducting quantum computers in studies of fundamental problems of statistical physics such as the absence or presence of thermalization in the free evolution of a closed quantum system depending on the choice of the initial state as well as on the integrability of the model. In the present paper, we performed proof-of-principle digital simulations of two spin models, which are the central spin model and the transverse-field Ising model, using 5- and 16-qubit superconducting quantum computers of the IBM Quantum Experience. We found that these devices are able to reproduce some important consequences of the symmetry of the initial state for the systems subsequent dynamics, such as the excitation blockade. However, lengths of algorithms are currently limited due to quantum gate errors. We also discuss some heuristic methods which can be used to extract valuable information from the imperfect experimental data.
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.
One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report the first experimental realization of the complete process of deterministic one-way quantum Deut
sch-Josza algorithm in NMR, including graph state preparation, single-qubit measurements and feed-forward corrections. The findings in our experiment may shed light on the future scalable one-way quantum computation.
Using nuclear magnetic resonance (NMR) techniques with three-qubit sample, we have experimentally implemented the highly structured algorithm for the 1-SAT problem proposed by Hogg. A simplified temporal averaging procedure was employed to the three-
qubit spin pseudo-pure state. The algorithm was completed with only a single evaluation of structure of the problem and the solutions were found with probability 100%, which outperform both unstructured quantum and the best classical search algorithm.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
