اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEntanglement and the truncated moment problem
315
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The algorithm always gives a certificate of entanglement if the state is entangled. If the state is separable, typically a certificate of separability is obtained in a finite number of steps and an explicit decomposition into separable pure states can be extracted.
قيم البحث
اقرأ أيضاً
Entanglement is closely related to some fundamental features of the dynamics of composite quantum systems: quantum entanglement enhances the speed of evolution of certain quantum states, as measured by the time required to reach an orthogonal state.
The concept of speed of quantum evolution constitutes an important ingredient in any attempt to determine the fundamental limits that basic physical laws impose on how fast a physical system can process or transmit information. Here we explore the relationship between entanglement and the speed of quantum evolution in the context of the quantum brachistochrone problem. Given an initial and a final state of a composite system we consider the amount of entanglement associated with the brachistochrone evolution between those states, showing that entanglement is an essential resource to achieve the alluded time-optimal quantum evolution.
We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and introduce some e
ntanglement measures. We also provide a classification of entangled states with respect to their usefulness in quantum dense coding, and present some aspects of multipartite entanglement.
We consider the transformation properties of integer sequences arising from the normal ordering of exponentiated boson ([a,a*]=1) monomials of the form exp(x (a*)^r a), r=1,2,..., under the composition of their exponential generating functions (egf).
They turn out to be of Sheffer-type. We demonstrate that two key properties of these sequences remain preserved under substitutional composition: (a)the property of being the solution of the Stieltjes moment problem; and (b) the representation of these sequences through infinite series (Dobinski-type relations). We present a number of examples of such composition satisfying properties (a) and (b). We obtain new Dobinski-type formulas and solve the associated moment problem for several hierarchically defined combinatorial families of sequences.
We study the quantum moment problem: Given a conditional probability distribution together with some polynomial constraints, does there exist a quantum state rho and a collection of measurement operators such that (i) the probability of obtaining a p
articular outcome when a particular measurement is performed on rho is specified by the conditional probability distribution, and (ii) the measurement operators satisfy the constraints. For example, the constraints might specify that some measurement operators must commute. We show that if an instance of the quantum moment problem is unsatisfiable, then there exists a certificate of a particular form proving this. Our proof is based on a recent result in algebraic geometry, the noncommutative Positivstellensatz of Helton and McCullough [Trans. Amer. Math. Soc., 356(9):3721, 2004]. A special case of the quantum moment problem is to compute the value of one-round multi-prover games with entangled provers. Under the conjecture that the provers need only share states in finite-dimensional Hilbert spaces, we prove that a hierarchy of semidefinite programs similar to the one given by Navascues, Pironio and Acin [Phys. Rev. Lett., 98:010401, 2007] converges to the entangled value of the game. It follows that the class of languages recognized by a multi-prover interactive proof system where the provers share entanglement is recursive.
The theory of holomorphic functions of several complex variables is applied in proving a multidimensional variant of a theorem involving an exponential boundedness criterion for the classical moment problem. A theorem of Petersen concerning the relat
ion between the multidimensional and one-dimensional moment problems is extended for half-lines and compact subsets of the real line. These results are used to solve the moment problem for the quantum phase space observables generated by the number states.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
