dc.contributor.author
Flammia, Steven T.
dc.contributor.author
Gross, David
dc.contributor.author
Liu, Yi-Kai
dc.contributor.author
Eisert, Jens
dc.date.accessioned
2018-06-08T03:02:59Z
dc.date.available
2014-01-29T14:08:53.290Z
dc.identifier.uri
https://refubium.fu-berlin.de/handle/fub188/14397
dc.identifier.uri
http://dx.doi.org/10.17169/refubium-18591
dc.description.abstract
Intuitively, if a density operator has small rank, then it should be easier to
estimate from experimental data, since in this case only a few eigenvectors
need to be learned. We prove two complementary results that confirm this
intuition. Firstly, we show that a low-rank density matrix can be estimated
using fewer copies of the state, i.e. the sample complexity of tomography
decreases with the rank. Secondly, we show that unknown low-rank states can be
reconstructed from an incomplete set of measurements, using techniques from
compressed sensing and matrix completion. These techniques use simple Pauli
measurements, and their output can be certified without making any assumptions
about the unknown state. In this paper, we present a new theoretical analysis
of compressed tomography, based on the restricted isometry property for low-
rank matrices. Using these tools, we obtain near-optimal error bounds for the
realistic situation where the data contain noise due to finite statistics, and
the density matrix is full-rank with decaying eigenvalues. We also obtain
upper bounds on the sample complexity of compressed tomography, and almost-
matching lower bounds on the sample complexity of any procedure using adaptive
sequences of Pauli measurements. Using numerical simulations, we compare the
performance of two compressed sensing estimators ‒ the matrix Dantzig selector
and the matrix Lasso ‒ with standard maximum-likelihood estimation (MLE). We
find that, given comparable experimental resources, the compressed sensing
estimators consistently produce higher fidelity state reconstructions than
MLE. In addition, the use of an incomplete set of measurements leads to faster
classical processing with no loss of accuracy. Finally, we show how to certify
the accuracy of a low-rank estimate using direct fidelity estimation, and
describe a method for compressed quantum process tomography that works for
processes with small Kraus rank and requires only Pauli eigenstate
preparations and Pauli measurements.
de
dc.rights.uri
http://creativecommons.org/licenses/by-nc-sa/3.0/
dc.subject.ddc
500 Naturwissenschaften und Mathematik::530 Physik
dc.title
Quantum tomography via compressed sensing: error bounds, sample complexity and
efficient estimators
dc.type
Wissenschaftlicher Artikel
dcterms.bibliographicCitation
New Journal of Physics. - 14 (2012), 9, S.095022/1-28
dc.identifier.sepid
24739
dcterms.bibliographicCitation.doi
10.1088/1367-2630/14/9/095022
dcterms.bibliographicCitation.url
http://dx.doi.org/10.1088/1367-2630/14/9/095022
refubium.affiliation
Physik
de
refubium.affiliation.other
Institut für Theoretische Physik
refubium.mycore.fudocsId
FUDOCS_document_000000019542
refubium.resourceType.isindependentpub
no
refubium.mycore.derivateId
FUDOCS_derivate_000000002982
dcterms.accessRights.openaire
open access