Estimation of low rank density matrices: bounds in Schatten norms and other distances
From MaRDI portal
(Redirected from Publication:315410)
Abstract: Let be the set of all density matrices (Hermitian positively semi-definite matrices of unit trace). Consider a problem of estimation of an unknown density matrix based on outcomes of measurements of observables ( being the space of Hermitian matrices) for a quantum system identically prepared times in state Outcomes of such measurements could be described by a trace regression model in which The design variables are often sampled at random from the uniform distribution in an orthonormal basis of (such as Pauli basis). The goal is to estimate the unknown density matrix based on the data Let hat Z:=frac{m^2}{n}sum_{j=1}^n Y_j X_j and let be the projection of onto the convex set of density matrices. It is shown that for estimator the minimax lower bounds in classes of low rank density matrices (established earlier) are attained up logarithmic factors for all Schatten -norm distances, and for Bures version of quantum Hellinger distance. Moreover, for a slightly modified version of estimator the same property holds also for quantum relative entropy (Kullback-Leibler) distance between density matrices.
Recommendations
- Optimal estimation of low rank density matrices
- Estimation of low rank density matrices by Pauli measurements
- Optimal sparse eigenspace and low-rank density matrix estimation for quantum systems
- Estimating the Rank of the Spectral Density Matrix
- Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices
- Density matrix minimization with \({\ell}_1\) regularization
- Hybrid reconstruction of quantum density matrix: when low-rank meets sparsity
- Low-rank approximation to entangled multipartite quantum systems
- scientific article; zbMATH DE number 5666889
- Localized density matrix minimization and linear-scaling algorithms
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5174522 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A remark on low rank matrix recovery and noncommutative Bernstein type inequalities
- Continuity bounds on the quantum relative entropy. II
- Efficient learning of label ranking by soft projections onto polyhedra
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Interaction in Quantum Communication
- Matrix computations.
- Noisy low-rank matrix completion with general sampling distribution
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Optimal estimation of low rank density matrices
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Sharp oracle inequalities in low rank estimation
- Stable low-rank matrix recovery via null space properties
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- User-friendly tail bounds for sums of random matrices
- Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms
- Von Neumann entropy penalization and low-rank matrix estimation
Cited in
(8)- Statistical analysis of compressive low rank tomography with random measurements
- Optimal estimation of low rank density matrices
- Relations between convergence rates in Schatten p-norms
- Estimation of low rank density matrices by Pauli measurements
- Matrix factorization for multivariate time series analysis
- Confidence regions and minimax rates in outlier-robust estimation on the probability simplex
- Fast state tomography with optimal error bounds
- Optimal Kullback-Leibler aggregation in mixture density estimation by maximum likelihood
This page was built for publication: Estimation of low rank density matrices: bounds in Schatten norms and other distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q315410)