Given N quantum systems prepared according to the same density operator ρ, we propose a measurement on the N-fold system that approximately yields the spectrum of ρ. The projections of the proposed observable decompose the Hilbert space according to the irreducible representations of the permutations on N points, and are labeled by Young frames, whose relative row lengths estimate the eigenvalues of ρ in decreasing order. We show convergence of these estimates in the limit N → ∞, and that the probability for errors decreases exponentially with a rate we compute explicitly.
Given N quantum systems prepared according to the same density operator ρ, we propose a measurement on the N-fold system that approximately yields the spectrum of ρ. The projections of the proposed observable decompose the Hilbert space according to the irreducible representations of the permutations on N points, and are labeled by Young frames, whose relative row lengths estimate the eigenvalues of ρ in decreasing order. We show convergence of these estimates in the limit N → ∞, and that the probability for errors decreases exponentially with a rate we compute explicitly.
Given N quantum systems prepared according to the same density operator $\ensuremath{\rho},$ we propose a measurement on the N-fold system that approximately yields the spectrum of $\ensuremath{\rho}.$ The projections of the proposed observable decompose the Hilbert space according to the irreducible representations of the permutations on N points, and are labeled by Young frames, whose relative row lengths estimate the eigenvalues of $\ensuremath{\rho}$ in decreasing order. We show convergence of these estimates in the limit $\stackrel{\ensuremath{\rightarrow}}{N}\ensuremath{\infty},$ and that the probability for errors decreases exponentially with a rate we compute explicitly.
In this paper we propose a method to estimate the density matrix ρ of a d-level quantum system by measurements on the N-fold system in the joint state ρ⊗N. The scheme is based on covariant observables and representation theory of unitary groups and it extends previous results concerning pure states and the estimation of the spectrum of ρ. We show that it is consistent (i.e. the original input state ρ is recovered with certainty if N → ∞), analyze its large deviation behavior, and calculate explicitly the corresponding rate function which describes the exponential decrease of error probabilities in the limit N → ∞. Finally, we discuss the question whether the proposed scheme provides the fastest possible decay of error probabilities.
Given n qubits prepared according to the same unknown density operator, we propose a nondestructive measuring method which approximately yields the eigenstates. It is shown that, for any plane which passes through the center point of the Bloch sphere, there exists corresponding projective measurement. By performing these measurements, we can scan the whole Bloch sphere like radar to search for the orientation of and determine the eigenstates. We show the convergency of the measurements. This result actually reveals a mathematical structure of the n-fold Hilbert space .
Experimental characterizations of a quantum system involve the measurement of expectation values of observables for a preparable state $\ensuremath{\mid}\ensuremath{\psi}⟩$ of the quantum system. Such expectation values can be measured by repeatedly preparing $\ensuremath{\mid}\ensuremath{\psi}⟩$ and coupling the system to an apparatus. For this method, the precision of the measured value scales as N1 for N repetitions of the experiment. For the problem of estimating the parameter $\ensuremath{\phi}$ in an evolution ${e}^{\ensuremath{-}i\ensuremath{\phi}H}$, it is possible to achieve precision N1 [the quantum metrology limit; see Giovannetti et al., Phys. Rev. Lett. 96, 010401 (2006)] provided that sufficient information about H and its spectrum is available. We consider the more general problem of estimating expectations of operators A with minimal prior knowledge of A. We give explicit algorithms that approach precision N1 given a bound on the eigenvalues of A or on their tail distribution. These algorithms are particularly useful for simulating quantum systems on quantum computers because they enable efficient measurement of observables and correlation functions. Our algorithms are based on a method for efficiently measuring the complex overlap of $\ensuremath{\mid}\ensuremath{\psi}⟩$ and $U\ensuremath{\mid}\ensuremath{\psi}⟩$, where U is an implementable unitary operator. We explicitly consider the issue of confidence levels in measuring observables and overlaps and show that, as expected, confidence levels can be improved exponentially with linear overhead. We further show that the algorithms given here can typically be parallelized with minimal increase in resource usage.
Basing decisions and estimates on simultaneous approximate measurements of noncommuting observables in a quantum receiver is shown to be equivalent to measuring commuting projection operators on a larger Hilbert space than that of the receiver itself. The quantum-mechanical Cramér-Rao inequalities derived from right logarithmic derivatives and symmetrized logarithmic derivatives of the density operator are compared, and it is shown that the latter give superior lower bounds on the error variances of individual unbiased estimates of arrival time and carrier frequency of a coherent signal. For a suitably weighted sum of the error variances of simultaneous estimates of these, the former yield the superior lower bound under some conditions.