اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLower bounds for the mean dissipated heat in an open quantum system
126
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Landauers principle provides a perspective on the physical meaning of information as well as on the minimum working cost of information processing. Whereas most studies have related the decrease in entropy during a computationally irreversible process to a lower bound of dissipated heat, recent efforts have also provided another lower bound associated with the thermodynamic fluctuation of heat. The coexistence of the two conceptually independent bounds has stimulated comparative studies of their close relationship or tightness; however, these studies were concerned with finite quantum systems that allowed the revival of erased information because of a finite recurrence time. We broaden these comparative studies further to open quantum systems with infinite recurrence times. By examining their dependence on the initial state, we find the independence of the thermodynamic bound from the initial coherence, whereas the entropic bound depends on both the initial coherence and population. A crucial role is indicated by the purity of the initial state: the entropic bound is tighter when the initial condition is sufficiently mixed, whereas the thermodynamic bound is tighter when the initial state is close to a pure state. These trends are consistent with previous results obtained for finite systems.
قيم البحث
اقرأ أيضاً
We state and prove four types of Lieb-Robinson bounds valid for many-body open quantum systems with power law decaying interactions undergoing out of equilibrium dynamics. We also provide an introductory and self-contained discussion of the setting a
nd tools necessary to prove these results. The results found here apply to physical systems in which both long-ranged interactions and dissipation are present, as commonly encountered in certain quantum simulators, such as Rydberg systems or Coulomb crystals formed by ions.
We derive upper and lower bounds on the fidelity susceptibility in terms of macroscopic thermodynamical quantities, like susceptibilities and thermal average values. The quality of the bounds is checked by the exact expressions for a single spin in a
n external magnetic field. Their usefulness is illustrated by two examples of many-particle models which are exactly solved in the thermodynamic limit: the Dicke superradiance model and the single impurity Kondo model. It is shown that as far as divergent behavior is considered, the fidelity susceptibility and the thermodynamic susceptibility are equivalent for a large class of models exhibiting critical behavior.
A Markovian process of a system is defined classically as a process in which the future state of the system is fully determined by only its present state, not by its previous history. There have been several measures of non-Markovianity to quantify t
he degrees of non-Markovian effect in a process of an open quantum system based on information backflow from the environment to the system. However, the condition for the witness of the system information backflow does not coincide with the classical definition of a Markovian process. Recently, a new measure with a condition that coincides with the classical definition in the relevant limit has been proposed. Here, we focus on the new definition (measure) for quantum non-Markovian processes, and characterize the Markovian condition as a quantum process that has no information backflow through the reduced environment state (IBTRES) and no system-environment correlation effect (SECE). The action of IBTRES produces non-Markovian effects by flowing the information of quantum operations performed by an experimenter at earlier times back to the system through the environment, while the SECE can produce non-Markovian effect without carrying any earlier quantum operation information. We give the necessary and sufficient conditions for no IBTRES and no SECE, respectively, and show that a process is Markovian if and only if it has no IBTRES and no SECE. The quantitative measures and algorithms for calculating non-Markovianity, IBTRES and soly-SECE are explicitly presented.
A universal definition of non-Markovianity for open systems dynamics is proposed. It is extended from the classical definition to the quantum realm by showing that a `transition from the Markov to the non-Markov regime occurs when the correlations be
tween the system and the environment, generated by their joint evolution, can no longer be neglected. The suggested definition is based on the comparison between measured correlation functions and those built by assuming that the system is in a Markov regime thus giving a figure of merit of the error coming from this assumption. It is shown that the knowledge of the dynamical map and initial condition of the system is not enough to fully characterise the non-Markovian dynamics of the reduced system. The example of three exactly solvable models, i.e. decoherence and spontaneous emission of the qubit in a bosonic bath and decoherence of the photons polarization induced by interaction with its spacial degrees of freedom, reveals that previously proposed Markovianity criteria and measures which are based on dynamical map analysis fail to recognise non-Markov behaviour.
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In particular, if T=O(sqrt{N}) then the error is lower bounded by a constant.
If we want error <1/2^N then we need T=Omega(N) queries. We apply this to show that a quantum computer cannot do much better than a classical computer when amplifying the success probability of an RP-machine. A classical computer can achieve error <=1/2^k using k applications of the RP-machine, a quantum computer still needs at least ck applications for this (when treating the machine as a black-box), where c>0 is a constant independent of k. Furthermore, we prove a lower bound of Omega(sqrt{log N}/loglog N) queries for quantum bounded-error search of an ordered list of N items.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
