In this paper I show that any $m$th-degree polynomial function of the elements of the density matrix $\rho$ can be determined by finding the expectation value of an observable on $m$ copies of $\rho$, without performing state tomography. Since a circuit exists which can approximate the measurement of any observable, in principle one can find a circuit which will estimate any such polynomial function by averaging over many runs. I construct some simple examples and compare these results to existing procedures.
In this paper I show that any mth-degree polynomial function of the elements of the density matrix ρ can be determined by finding the expectation value of an observable on m copies of ρ, without performing state tomography. Since a circuit exists which can approximate the measurement of any observable, in principle one can find a circuit which will estimate any such polynomial function by averaging over many runs. I construct some simple examples and compare these results to existing procedures.
In this presentation I show that any mth‐degree polynomial function of the elements of the density matrix ρ can be estimated by finding the expectation value of two observables on m copies of ρ, without performing state tomography. Many important quantities in quantum information theory—such as the concurrence, three‐tangle, negativity, purity, and Renyi entropy—are either polynomials or simple functions of polynomials. Since circuits exists which can approximate the measurement of any observable, in principle one can find a circuit which will estimate any such polynomial function by averaging over many runs. Some simple examples are presented and compared to existing approaches, and the efficiency is discussed.
Abstract The observables associated with a quantum system S form a non-commutative algebra A S . It is assumed that a density matrix ρ can be determined from the expectation values of observables. But A S admits inner automorphisms a ↦ u a u − 1 , a , u ∈ A S , u * u = u u * = 1 , so that its individual elements can be identified only up to unitary transformations. So since Tr ρ ( uau *) = Tr( u * ρu ) a , only the spectrum of ρ , or its characteristic polynomial, can be determined in quantum mechanics. In local quantum field theory, ρ cannot be determined at all, as we shall explain. However, abelian algebras do not have inner automorphisms, so the measurement apparatus can determine mean values of observables in abelian algebras A M ⊂ A S ( M for measurement, S for system). We study the uncertainties in extending ρ | A M to ρ | A S (the determination of which means measurement of A S ) and devise a protocol to determine ρ
We introduce the problem of shadow tomography: given an unknown D-dimensional quantum mixed state ρ, as well as known two-outcome measurements E1,…,EM, estimate the probability that Ei accepts ρ, to within additive error ε, for each of the M measurements. How many copies of ρ are needed to achieve this, with high probability? Surprisingly, we give a procedure that solves the problem by measuring only O(ε−4⋅log4M⋅logD) copies. This means, for example, that we can learn the behavior of an arbitrary n-qubit state, on all accepting/rejecting circuits of some fixed polynomial size, by measuring only nO(1) copies of the state. This resolves an open problem of the author, which arose from his work on private-key quantum money schemes, but which also has applications to quantum copy-protected software, quantum advice, and quantum one-way communication. Recently, building on this work, Branda͂o et al. have given a different approach to shadow tomography using semidefinite programming, which achieves a savings in computation time.
We introduce a measure Q of bipartite quantum correlations for arbitrary two-qubit states, expressed as a state-independent function of the density matrix elements. The amount of quantum correlations can be quantified experimentally by measuring the expectation value of a small set of observables on up to four copies of the state, without the need for a full tomography. We extend the measure to 2×d systems, providing its explicit form in terms of observables and applying it to the relevant class of multiqubit states employed in the deterministic quantum computation with one quantum bit model. The number of required measurements to determine Q in our scheme does not increase with d. Our results provide an experimentally friendly framework to estimate quantitatively the degree of general quantum correlations in composite systems.
We give a shadow tomography algorithm that uses O(log(m)log(m/δ)/ε2) copies of the input state. Specifically, given a quantum state ρ and observables O1,…,Om, the algorithm outputs estimates of tr(Oiρ) for all i∈[m] that are all accurate to within ±ε, except with probability at most δ. The key idea is to work in the average-case setting: for a random state drawn from a known prior, a pretty good measurement on O(log(m)/ε2) copies gives a constant-error guarantee on all but a small fraction of the prior. Boosting this guarantee gives an average-case shadow tomography algorithm, and the minimax principle then (non-constructively) implies the existence of a measurement with the same worst-case guarantee.
We also identify an obstruction to further improvement with this approach. While pretty good measurements amplify success over the randomness of the prior, they do not amplify success over the randomness of measurement. This issue appears to be inherent, and gives rise to the remaining log(m) factor separating the complexity of the quantum problem from its classical counterpart.
While it is known that $\mathrm{Tr}{\ensuremath{\rho}}^{n}$ can be measured directly (i.e., without first reconstructing the density matrix) by performing joint measurements on n copies of the same state $\ensuremath{\rho}$, it is shown here that random measurements on single copies suffice, too. Averaging over the random measurements directly yields estimates of $\mathrm{Tr}{\ensuremath{\rho}}^{n}$, even when it is not known what measurements were actually performed (so that $\ensuremath{\rho}$ cannot be reconstructed).