Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTight bounds on the simultaneous estimation of incompatible parameters
57
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The estimation of multiple parameters in quantum metrology is important for a vast array of applications in quantum information processing. However, the unattainability of fundamental precision bounds for incompatible observables has greatly diminished the applicability of estimation theory in many practical implementations. The Holevo Cramer-Rao bound (HCRB) provides the most fundamental, simultaneously attainable bound for multi-parameter estimation problems. A general closed form for the HCRB is not known given that it requires a complex optimisation over multiple variables. In this work, we develop an analytic approach to solving the HCRB for two parameters. Our analysis reveals the role of the HCRB and its interplay with alternative bounds in estimation theory. For more parameters, we generate a lower bound to the HCRB. Our work greatly reduces the complexity of determining the HCRB to solving a set of linear equations that even numerically permits a quadratic speedup over previous state-of-the-art approaches. We apply our results to compare the performance of different probe states in magnetic field sensing, and characterise the performance of state tomography on the codespace of noisy bosonic error-correcting codes. The sensitivity of state tomography on noisy binomial codestates can be improved by tuning two coding parameters that relate to the number of correctable phase and amplitude damping errors. Our work provides fundamental insights and makes significant progress towards the estimation of multiple incompatible observables.
rate research
Read More
Simultaneous estimation of multiple parameters is required in many practical applications. A lower bound on the variance of simultaneous estimation is given by the quantum Fisher information matrix. This lower bound is, however, not necessarily achievable. There exists a necessary and sufficient condition for its achievability. It is unknown how many parameters can be estimated while satisfying this condition. In this paper, we analyse an upper bound on the number of such parameters through linear-algebraic techniques. This upper bound depends on the algebraic structure of the quantum system used as a probe. We explicitly calculate this bound for two quantum systems: single qubit and two-qubit X-states.
The entanglement content of superpositions of quantum states is investigated based on a measure called {it concurrence}. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we find simple inequalities relating the concurrence of the state to that of its components. We derive an exact expression for the concurrence when the component states are biorthogonal, and provide elegant upper and lower bounds in all other cases. For quantum bits, our upper bound is tighter than the previously derived bound in [Phys. Rev. Lett. 97, 100502 (2006).]
The quantification of the measurement uncertainty aspect of Heisenbergs Uncertainty Principle---that is, the study of trade-offs between accuracy and disturbance, or between accuracies in an approximate joint measurement on two incompatible observables---has regained a lot of interest recently. Several approaches have been proposed and debated. In this paper we consider Ozawas definitions for inaccuracies (as root-mean-square errors) in approximate joint measurements, and study how these are constrained in different cases, whether one specifies certain properties of the approximations---namely their standard deviations and/or their bias---or not. Extending our previous work [C. Branciard, Proc. Natl. Acad. Sci. U.S.A. 110, 6742 (2013)], we derive new error-trade-off relations, which we prove to be tight for pure states. We show explicitly how all previously known relations for Ozawas inaccuracies follow from ours. While our relations are in general not tight for mixed states, we show how these can be strengthened and how tight relations can still be obtained in that case.
Being one of the centroidal concepts in quantum theory, the fundamental constraint imposed by Heisenberg uncertainty relations has always been a subject of immense attention and challenging in the context of joint measurements of general quantum mechanical observables. In particular, the recent extension of the original uncertainty relations has grabbed a distinct research focus and set a new ascendent target in quantum mechanics and quantum information processing. In the present work we explore the joint measurements of three incompatible observables, following the basic idea of a newly proposed error trade-off relation. In comparison to the counterpart of two incompatible observables, the joint measurements of three incompatible observables are more complex and of more primal interest in understanding quantum mechanical measurements. Attributed to the pristine idea proposed by Heisenberg in 1927, we develop the error trade-off relations for compatible observables to categorically approximate the three incompatible observables. Implementing these relations we demonstrate the first experimental witness of the joint measurements for three incompatible observables using a single ultracold $^{40}Ca^{+}$ ion in a harmonic potential. We anticipate that our inquisition would be of vital importance for quantum precision measurement and other allied quantum information technologies.
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many equivalent formulations, and has natural connections to classical lower bounds. A further nice property of the adversary method is that it behaves very well with respect to composition of functions. We generalize the adversary method to include costs--each bit of the input can be given an arbitrary positive cost representing the difficulty of querying that bit. We use this generalization to exactly capture the adversary bound of a composite function in terms of the adversary bounds of its component functions. Our results generalize and unify previously known composition properties of adversary methods, and yield as a simple corollary the Omega(sqrt{n}) bound of Barnum and Saks on the quantum query complexity of read-once functions.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
