We introduce a new method to reconstruct unknown quantum states out of incomplete and noisy information. The method is a linear convex optimization problem, therefore with a unique minimum, which can be efficiently solved with Semidefinite Programs. Numerical simulations indicate that the estimated state does not overestimate purity, and neither the expectation value of optimal entanglement witnesses. The convergence properties of the method are similar to compressed sensing approaches, in the sense that, in order to reconstruct low rank states, it needs just a fraction of the effort corresponding to an informationally complete measurement.
We introduce a new method to reconstruct unknown quantum states out of incomplete and noisy information. The method is a linear convex optimization problem, therefore with a unique minimum, which can be efficiently solved with Semidefinite Programs. Numerical simulations indicate that the estimated state does not overestimate purity, and neither the expectation value of optimal entanglement witnesses. The convergence properties of the method are similar to compressed sensing approaches, in the sense that, in order to reconstruct low rank states, it needs just a fraction of the effort corresponding to an informationally complete measurement.
It is assumed partial knowledge about the state of a quantum system. This knowledge is represented by the results of some measurements, spanning a certain subspace. We refer to this subspace as the known subspace, and to its complement as the unknown one. Then we introduce a variational method to estimate the expectation value of every observable. This estimate is optimal and reliable, in the sense that it is always smaller, in absolute value, than the true expectation value (the one that would be obtained if directly measured, of if the quantum state were known exactly). As a by-product of this approach, we obtain a method of reconstruction of the quantum state, using incomplete information. Our results make clear that it is typically not necessary to perform an informationally complete set of measurements, which grows exponentially with the Hilbert space size, in order to obtain certified optimal lower bounds to properties of a quantum system. The algorithm that implements our method is a linear convex problem, which has exact solution in terms of well known semidefinite programs.
There exists, in general, a convex set of quantum state estimators that maximize the likelihood for informationally incomplete data. We propose an estimation scheme, catered to measurement data of this kind, to search for the exact maximum-likelihood-maximum-entropy estimator using semidefinite programming and a standard multi-dimensional function optimization routine. This scheme can be used to infer the expectation values of a set of entanglement witnesses that can be used to verify the entanglement of the unknown quantum state for composite systems. Next, we establish an alternative numerical scheme that is more computationally robust for the sole purpose of maximizing the likelihood and entropy.
There exists, in general, a convex set of quantum state estimators that maximize the likelihood for informationally incomplete data. We propose an estimation scheme, catered to measurement data of this kind, to search for the exact maximum-likelihood-maximum-entropy estimator using semidefinite programming and a standard multi-dimensional function optimization routine. This scheme can be used to infer the expectation values of a set of entanglement witnesses that can be used to verify the entanglement of the unknown quantum state for composite systems. Next, we establish an alternative numerical scheme that is more computationally robust for the sole purpose of maximizing the likelihood and entropy.
Whenever we do not have an informationally complete set of measurements, the estimate of a quantum state cannot be uniquely determined. In this case, among the density matrices compatible with the available data, the one commonly preferred is the one which is the most uncommitted to the missing information. This is the purpose of the maximum entropy estimation (MaxEnt) and the variational quantum tomography (VQT). Here, we propose a variant of VQT and show its relationship with MaxEnt methods in quantum tomographies with an incomplete set of measurements. We prove their equivalence in the case of eigenbasis measurements, and through numerical simulations we stress their similar behavior. Hence, in the modified VQT formulation we have an estimate of a quantum state as unbiased as in MaxEnt and with the benefit that VQT can be more efficiently solved by means of linear semidefinite programs.
Abstract With nowadays steadily growing quantum processors, it is required to develop new quantum tomography tools that are tailored for high-dimensional systems. In this work, we describe such a computational tool, based on recent ideas from non-convex optimization. The algorithm excels in the compressed sensing setting, where only a few data points are measured from a low-rank or highly-pure quantum state of a high-dimensional system. We show that the algorithm can practically be used in quantum tomography problems that are beyond the reach of convex solvers, and, moreover, is faster and more accurate than other state-of-the-art non-convex approaches. Crucially, we prove that, despite being a non-convex program, under mild conditions, the algorithm is guaranteed to converge to the global minimum of the quantum state tomography problem; thus, it constitutes a provable quantum state tomography protocol.
With nowadays steadily growing quantum processors, it is required to develop new quantum tomography tools that are tailored for high-dimensional systems. In this work, we describe such a computational tool, based on recent ideas from non-convex optimization. The algorithm excels in the compressed-sensing-like setting, where only a few data points are measured from a low-rank or highly-pure quantum state of a high-dimensional system. We show that the algorithm can practically be used in quantum tomography problems that are beyond the reach of convex solvers, and, moreover, is faster than other state-of-the-art non-convex approaches. Crucially, we prove that, despite being a non-convex program, under mild conditions, the algorithm is guaranteed to converge to the global minimum of the problem; thus, it constitutes a provable quantum state tomography protocol.