اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLower bound of quantum uncertainty from extractable classical information
167
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The sum of entropic uncertainties for the measurement of two non-commuting observables is not always reduced by the amount of entanglement (quantum memory) between two parties, and in certain cases may be impacted by quantum correlations beyond entanglement (discord). An optimal lower bound of entropic uncertainty in the presence of any correlations may be determined by fine-graining. Here we express the uncertainty relation in a new form where the maximum possible reduction of uncertainty is shown to be given by the extractable classical information. We show that the lower bound of uncertainty matches with that using fine-graining for several examples of two-qubit pure and mixed entangled states, and also separable states with non-vanishing discord. Using our uncertainty relation we further show that even in the absence of any quantum correlations between the two parties, the sum of uncertainties may be reduced with the help of classical correlations.
قيم البحث
اقرأ أيضاً
The uncertainty principle sets lower bound on the uncertainties of two incompatible observables measured on a particle. The uncertainty lower bound can be reduced by considering a particle as a quantum memory entangled with the measured particle. In
this paper, we consider a tripartite scenario in which a quantum state has been shared between Alice, Bob, and Charlie. The aim of Bob and Charlie is to minimize Charlies lower bound about Alices measurement outcomes. To this aim, they concentrate their correlation with Alice in Charlies side via a cooperative strategy based on local operations and classical communication. We obtain lower bound for Charlies uncertainty about Alices measurement outcomes after concentrating information and compare it with the lower bound without concentrating information in some examples. We also provide a physical interpretation of the entropic uncertainty lower bound based on the dense coding capacity.
In order to provide a guaranteed precision and a more accurate judgement about the true value of the Cram{e}r-Rao bound and its scaling behavior, an upper bound (equivalently a lower bound on the quantum Fisher information) for precision of estimatio
n is introduced. Unlike the bounds previously introduced in the literature, the upper bound is saturable and yields a practical instruction to estimate the parameter through preparing the optimal initial state and optimal measurement. The bound is based on the underling dynamics and its calculation is straightforward and requires only the matrix representation of the quantum maps responsible for encoding the parameter. This allows us to apply the bound to open quantum systems whose dynamics are described by either semigroup or non-semigroup maps. Reliability and efficiency of the method to predict the ultimate precision limit are demonstrated by {three} main examples.
Quantum uncertainty is a well-known property of quantum mechanics that states the impossibility of predicting measurement outcomes of multiple incompatible observables simultaneously. In contrast, the uncertainty in the classical domain comes from th
e lack of information about the exact state of the system. One may naturally ask, whether the quantum uncertainty is indeed a fully intrinsic property of the quantum theory, or whether similar to the classical domain lack of knowledge about specific parts of the physical system might be the source of this uncertainty. This question has been addressed in [New J. Phys.19 023038 (2017)] where the authors argue that in the entropic formulation of the uncertainty principle that can be illustrated using the so-called, guessing games, indeed such lack of information has a significant contribution to the arising quantum uncertainty. Here we investigate this issue experimentally by implementing the corresponding two-dimensional and three-dimensional guessing games. Our results confirm that within the guessing-game framework, the quantum uncertainty to a large extent relies on the fact that quantum information determining the key properties of the game is stored in the degrees of freedom that remain inaccessible to the guessing party.
We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access
to a graph $(V,E)$ and access to a function $f:Vrightarrow {0,1}$ as a black box. We are asked to determine if there exist $(u,v) in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds are trivial ($Omega(sqrt{n})$ and $Omega(n)$, respectively) and there is no known matching upper bound.
The uncertainty principle is one of the most important issues that clarify the distinction between classical and quantum theory. This principle sets a bound on our ability to predict the measurement outcome of two incompatible observables precisely.
Uncertainty principle can be formulated via Shannon entropies of the probability distributions of measurement outcome of the two observables. It has shown that the entopic uncertainty bound can be improved by considering an additional particle as the quantum memory $B$ which has correlation with the measured particle $A$. In this work we consider the memory assisted entropic uncertainty for the case in which the quantum memory and measured particle are topological qubits. In our scenario the topological quantum memory $B$, is considered as an open quantum system which interacts with its surrounding. The motivation for this model is associated with the fact that the basis of the memory-assisted entropic uncertainty relation is constructed on the correlation between quantum memory $B$ and measured particle $A$. In the sense that, Bob who holds the quantum memory $B$ can predict Alices measurement results on particle $A$ more accurately, when the amount of correlation between $A$ and $B$ is great. Here, we want to find the influence of environmental effects on uncertainty bound while the quantum memory interacts with its surrounding. In this work we will consider Ohmic-like Fermionic and Bosonic environment. We have also investigate the effect of the Fermionic and Bosonic environment on the lower bounds of the amount of the key that can be extracted per state by Alice and Bob for quantum key distribution protocols.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
