We propose an error-disturbance relation for general observables on finite dimensional Hilbert spaces based on operational notions of error and disturbance. For two-dimensional systems we derive tight inequalities expressing the trade-off between accuracy and disturbance.
In order to discuss Ozawa's uncertainty relation @cite_6 @cite_0 @cite_13 @cite_15 , we need to introduce an auxiliary Hilbert space @math and a fixed state @math on @math . The measurement apparatus is then described by two observables One usually writes @math (and similarly for @math ), where @math is an observable on @math and @math is a unitary describing some interaction between the system of interest and the auxiliary system. @math @math on @math . Define the errors (the @math is part of the name, not an index) ^2_ O, = ( -A aux )^2 aux , ^2_ O, = ( - A aux )^2 aux , and the standard deviations ^2_ = (A- A )^2 , ^2_ = ( A- A )^2 . One can then derive the following error-disturbance relation In Ref. @cite_13 Hall derives a very similar inequality, but with @math ( @math ) defined in terms of @math ( @math ). A tight variant of is given by Branciard @cite_15 . See also @cite_17 and @cite_8 for related inequalities. @cite_0 O, O, + O, + O, 1 2 | [A, A] |.
@cite_8 @cite_6 @cite_0 @cite_15 @cite_13 @cite_17
1988342708 2077306951 1514676086 2807350215
By introducing a quantitative degree of commutativity'' in terms of the angle between spin observables we present two tight quantitative trade-off relations in the case of two qubits. First, for entangled states, between the degree of commutativity of local observables and the maximal amount of violation of the Bell inequality: if both local angles increase from zero to @math (i.e., the degree of local commutativity decreases), the maximum violation of the Bell inequality increases. Secondly, a converse trade-off relation holds for separable states: if both local angles approach @math the maximal value obtainable for the correlations in the Bell inequality decreases and thus the non-violation increases. As expected, the extremes of these relations are found in the case of anticommuting local observables where, respectively, the bounds of @math and @math hold for the expectation value of the Bell operator. The trade-off relations show that noncommmutativity gives a more than classical result'' for entangled states, whereas a less than classical result'' is obtained for separable states. The experimental relevance of the trade-off relation for separable states is that it provides an experimental test for two qubit entanglement. Its advantages are twofold: in comparison to violations of Bell inequalities it is a stronger criterion and in comparison to entanglement witnesses it needs to make less strong assumptions about the observables implemented in the experiment. We consider the problem of estimating an unknown signal @math from noisy linear observations @math . In many practical instances, @math has a certain structure that can be captured by a structure inducing convex function @math . For example, @math norm can be used to encourage a sparse solution. To estimate @math with the aid of @math , we consider the well-known LASSO method and provide sharp characterization of its performance. We assume the entries of the measurement matrix @math and the noise vector @math have zero-mean normal distributions with variances @math and @math respectively. For the LASSO estimator @math , we attempt to calculate the Normalized Square Error (NSE) defined as @math as a function of the noise level @math , the number of observations @math and the structure of the signal. We show that, the structure of the signal @math and choice of the function @math enter the error formulae through the summary parameters @math and @math , which are defined as the Gaussian squared-distances to the subdifferential cone and to the @math -scaled subdifferential, respectively. The first LASSO estimator assumes a-priori knowledge of @math and is given by @math . We prove that its worst case NSE is achieved when @math and concentrates around @math . Secondly, we consider @math , for some @math . This time the NSE formula depends on the choice of @math and is given by @math . We then establish a mapping between this and the third estimator @math . Finally, for a number of important structured signal classes, we translate our abstract formulae to closed-form upper bounds on the NSE. We critically revisit the definitions of mean-squared estimation error and disturbance recently used in error-disturbance inequalities derived by Ozawa, Hall, Branciard, and by expressing them in the reduced system space. The interpretation of the definitions as mean-squared deviations relies on a hidden assumption that is incompatible with the Bell-Kochen-Specker-Spekkens contextuality theorems, and which results in averaging the deviations over a non-positive-definite joint quasiprobability distribution. For unbiased measurements, the estimation error admits a concrete interpretation as the dispersion in the estimation of the mean induced by the measurement ambiguity. We demonstrate how to measure not only this dispersion but also every observable moment with the same experimental data, and thus demonstrate that perfect estimations can have nonzero estimation error according to this measure. We conclude that the inequalities using these definitions do not capture the spirit of Heisenberg's eponymous inequality, but do indicate a qualitatively different relationship between dispersion and disturbance that applies to ensembles of measurements. To reconnect with the discussion of Heisenberg, we suggest alternate definitions of error and disturbance that are intrinsic to a single apparatus outcome. These definitions naturally involve the retrodictive and interdictive states for that outcome, and produce complementarity and error-disturbance inequalities that have the same form as the traditional Heisenberg relation. We show that any language in nondeterministic time @math , where the number of iterated exponentials is an arbitrary function @math , can be decided by a multiprover interactive proof system with a classical polynomial-time verifier and a constant number of quantum entangled provers, with completeness @math and soundness @math , where the number of iterated exponentials is @math and @math is a universal constant. The result was previously known for @math and @math ; we obtain it for any time-constructible function @math . The result is based on a compression technique for interactive proof systems with entangled provers that significantly simplifies and strengthens a protocol compression result of Ji (STOC'17). As a separate consequence of this technique we obtain a different proof of Slofstra's recent result (unpublished) on the uncomputability of the entangled value of multiprover games. Finally, we show that even minor improvements to our compression result would yield remarkable consequences in computational complexity theory and the foundations of quantum mechanics: first, it would imply that the class MIP* contains all computable languages; second, it would provide a negative resolution to a multipartite version of Tsirelson's problem on the relation between the commuting operator and tensor product models for quantum correlations.