اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBounding the set of finite dimensional quantum correlations
133
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We describe a simple method to derive high performance semidefinite programming relaxations for optimizations over complex and real operator algebras in finite dimensional Hilbert spaces. The method is very flexible, easy to program and allows the user to assess the behavior of finite dimensional quantum systems in a number of interesting setups. We use this method to bound the strength of quantum nonlocality in bipartite and tripartite Bell scenarios where the dimension of a subset of the parties is bounded from above. We derive new results in quantum communication complexity and prove the soundness of the prepare-and-measure dimension witnesses introduced in [Phys. Rev. Lett. 105, 230501 (2010)]. Finally, we propose a new dimension witness that can distinguish between classical, real and complex two-level systems.
قيم البحث
اقرأ أيضاً
We present a method to certify the presence of Bell correlations in experimentally observed statistics, and to obtain new Bell inequalities. Our approach is based on relaxing the conditions defining the set of correlations obeying a local hidden vari
able model, yielding a convergent hierarchy of semidefinite programs (SdPs). Because the size of these SdPs is independent of the number of parties involved, this technique allows to characterize correlations in many-body systems. As an example, we illustrate our method with the experimental data presented in [Science 352, 441 (2016)]
We construct a linear system non-local game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert space, or even with any tensor-product strategy.
In particular, this shows that the set of (tensor-product) quantum correlations is not closed. The constructed non-local game provides another counterexample to the middle Tsirelson problem, with a shorter proof than our previous paper (though at the loss of the universal embedding theorem). We also show that it is undecidable to determine if a linear system game can be played perfectly with a finite-dimensional strategy, or a limit of finite-dimensional quantum strategies.
Finite-size error (FSE), the discrepancy between an observable in a finite system and in the thermodynamic limit, is ubiquitous in numerical simulations of quantum many body systems. Although a rough estimate of these errors can be obtained from a se
quence of finite-size results, a strict, quantitative bound on the magnitude of FSE is still missing. Here we derive rigorous upper bounds on the FSE of local observables in real time quantum dynamics simulations initialized from a product state. In $d$-dimensional locally interacting systems with a finite local Hilbert space, our bound implies $ |langle hat{S}(t)rangle_L-langle hat{S}(t)rangle_infty|leq C(2v t/L)^{cL-mu}$, with $v$, $C$, $c$, $mu $ constants independent of $L$ and $t$, which we compute explicitly. For periodic boundary conditions (PBC), the constant $c$ is twice as large as that for open boundary conditions (OBC), suggesting that PBC have smaller FSE than OBC at early times. The bound can be generalized to a large class of correlated initial states as well. As a byproduct, we prove that the FSE of local observables in ground state simulations decays exponentially with $L$, under a suitable spectral gap condition. Our bounds are practically useful in determining the validity of finite-size results, as we demonstrate in simulations of the one-dimensional (1D) quantum Ising and Fermi-Hubbard models.
We study and extend the semidefinite programming (SDP) hierarchies introduced in [Phys. Rev. Lett. 115, 020501] for the characterization of the statistical correlations arising from finite dimensional quantum systems. First, we introduce the dimensio
n-constrained noncommutative polynomial optimization (NPO) paradigm, where a number of polynomial inequalities are defined and optimization is conducted over all feasible operator representations of bounded dimensionality. Important problems in device independent and semi-device independent quantum information science can be formulated (or almost formulated) in this framework. We present effective SDP hierarchies to attack the general dimension-constrained NPO problem (and related ones) and prove their asymptotic convergence. To illustrate the power of these relaxations, we use them to derive new dimension witnesses for temporal and Bell-type correlation scenarios, and also to bound the probability of success of quantum random access codes.
We introduce various measures of forward classical communication for bipartite quantum channels. Since a point-to-point channel is a special case of a bipartite channel, the measures reduce to measures of classical communication for point-to-point ch
annels. As it turns out, these reduced measures have been reported in prior work of Wang et al. on bounding the classical capacity of a quantum channel. As applications, we show that the measures are upper bounds on the forward classical capacity of a bipartite channel. The reduced measures are upper bounds on the classical capacity of a point-to-point quantum channel assisted by a classical feedback channel. Some of the various measures can be computed by semi-definite programming.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
