Given a large number N of copies of a qubit state of which we wish to estimate its purity, we prove that separable-measurement protocols can be as efficient as the optimal joint-measurement one if classical communication is used. This shows that the optimal estimation of the entanglement of a two-qubit state can also be achieved asymptotically with fully separable measurements. Thus, quantum memories provide no advantage in this situation. The relationship between our global Bayesian approach and the quantum Cramér-Rao bound is discussed.
Given a large number N of copies of a qubit state of which we wish to estimate its purity, we prove that separable-measurement protocols can be as efficient as the optimal joint-measurement one if classical communication is used. This shows that the optimal estimation of the entanglement of a two-qubit state can also be achieved asymptotically with fully separable measurements. Thus, quantum memories provide no advantage in this situation. The relationship between our global Bayesian approach and the quantum Cramér-Rao bound is discussed.
We consider the problem of estimating the state of a large but finite number N of identical quantum systems. As N becomes large the problem simplifies dramatically. The only relevant measure of the quality of estimation becomes the mean quadratic error matrix. Here we present a bound on this quantity: a quantum Cram\'er-Rao inequality. This bound succinctly expresses how in the quantum case one can trade information about one parameter for information about another. The bound holds for arbitrary measurements on pure states, but only for separable measurements on mixed states---a striking example of nonlocality without entanglement for mixed but not for pure states. Cram\'er-Rao bounds are generally only derived for unbiased estimators. Here we give a version of our bound for biased estimators, and a simple asymptotic version for large N. Finally we prove that when the unknown state belongs to a two-dimensional Hilbert space our quantum Cram\'er-Rao bound can always be attained, and we provide an explicit measurement strategy that attains it. Thus we have a complete solution to the problem of estimating as efficiently as possible the unknown state of a large ensemble of qubits in the same pure state. The same is true for qubits in the same mixed state if one restricts oneself to separable measurements, but nonseparable measurements allow dramatic increase of efficiency. Exactly how much increase is possible is a major open problem.
We address the "major open problem" of evaluating how much increased efficiency in estimation is possible using non-separable measurements, rather than separable ones, of N copies of two-level quantum systems. To proceed, we compute the the 3 x 3 Fisher information matrices for the optimal measurements recently devised by Vidal et al (quant-ph/9812068) for N = 2,...,7. We obtain simple polynomial expressions for the traces of the products of the inverse of the quantum Helstrom information matrix and the computed Fisher information matrices. These traces all have minima of 2 N - 1 in the pure state limit, while for separable measurements, as established by Gill and Massar (quant-ph/9902063), they are bound above by N. This indicates both that there is a large discontinuity at the pure states (where the computed Fisher information matrices are indeterminate) and that the gain in using joint measurements over separate measurements is substantial for all impure states. In seeking to extend our results to N > 7, we investigate possible relationships between the Fisher information matrices generated here and the class of monotone Riemannian metrics, studied by Petz and Sudar as well as others.
Given N identical copies of the state of a quantum two-level system, we analyze its optimal estimation. We consider two situations: general pure states and (pure) states restricted to lie on the equator of the Bloch sphere. We perform a complete and comprehensive analysis of the optimal schemes based on local measurements, and give results (optimal measurements, maximum fidelity, etc.) for arbitrary N, not necessarily large, within the Bayesian framework. We also make a comparative analysis of the asymptotic limit of these results with those derived from a (pointwise) Cram\'er-Rao type of approach. We give explicit schemes based on local measurements and no classical communication that saturate the fidelity bounds of the most general collective schemes.
We investigate the asymptotic relationship between quantum cloning and quantum estimation from the global point of view where all the copies produced by the cloner are considered jointly. For an N-to-M cloner, we consider the overall fidelity between the state of the M output systems and the state of M ideal copies, and we ask whether the optimal fidelity is attained by a measure and-prepare protocol in the limit M -> \infty. In order to gain intuition into the general problem, we analyze two concrete examples: i) cloning qubit states on the equator of the Bloch sphere and ii) cloning two-qubit maximally entangled states. In the first case, we show that the optimal measure-and-prepare fidelity converges to the fidelity of the optimal cloner in the limit M -> \infty. In the second case, we restrict our attention to economical covariant cloners, and again, we exhibit a measure-and-prepare protocol that achieves asymptotically the optimal fidelity. Quite counterintuitively, in both cases the optimal states that have to be prepared in order to maximize the overall fidelity are not product states corresponding to M identical copies, but instead suitable M-partite entangled states.
We study the sample complexity of the prototypical tasks and . The former has been a key subroutine for experimental benchmarking and entropy estimation, while the latter is a core task for cross-platform validation that compares the unknown quantum states produced by different physical platforms. In purity estimation, we are to estimate tr ( ρ 2 ) of an unknown quantum state ρ to additive error ɛ . Meanwhile, for quantum inner product estimation, Alice and Bob are to estimate tr ( ρ σ ) to additive error ɛ , given copies of the unknown quantum states ρ and σ using classical communication and restricted quantum communication. We propose a protocol that solves quantum inner product estimation with k -qubit quantum communication and unentangled local measurements using O ( median { 1 / ɛ 2 , 2 n / 2 / ɛ , 2 n − k / ɛ 2 } ) copies of ρ and σ . Our protocol can be modified to estimate the purity of an unknown quantum state ρ using k -qubit quantum memory with the same sample complexity. We also prove that arbitrary protocols with k -qubit quantum memory that estimate purity to error ɛ require Ω ( median { 1 / ɛ 2 , 2 n / 2 / ɛ , 2 n − k / ɛ 2 } ) copies of ρ . This indicates the same sample complexity lower bound for quantum inner product estimation with k -qubit quantum communication and classical communication, and unentangled local measurements. We further improve the sample complexity lower bound for any purity estimation protocols using an identical single-copy projection-valued measurement. Last, we investigate a decisional variant of quantum distributed inner product estimation without quantum communication for mixed states and provide a sample complexity lower bound.
Quantum resources, such as entanglement, can decrease the uncertainty of a parameter-estimation procedure beyond what is classically possible. This phenomenon is well described for noiseless systems with asymptotically many measurement resources by the Quantum Cramer-Rao Bound, but no general description exists for the regime of limited measurement resources. We address this problem by defining a Bayesian quantifier for uncertainty suitable for the regime of limited resources, and by developing a mathematical description for a parameter-estimation procedure which uses qubit probes to estimate a rotation angle induced on them. We simulate the qubit estimation scheme in the regime of limited resources using a single class of probe states. We find that, in noiseless systems, entanglement between qubits always decreases the uncertainty of the estimation; however, the quantum advantage decreases as fewer qubits are used in the estimation. We also find that the presence of strong dephasing noise removes the quantum advantage completely, regardless of the number of qubit probes used.