Estimation of low rank density matrices: bounds in Schatten norms and other distances
DOI10.1214/16-EJS1192zbMATH Open1403.62104arXiv1604.04600OpenAlexW2963930581MaRDI QIDQ315410FDOQ315410
Authors: Dong Xia, Vladimir Koltchinskii
Publication date: 21 September 2016
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.04600
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
Kullback-Leibler divergencedensity matrixquantum state tomographyvon Neumann entropylow rankSchatten \(p\)-normstrace regression model
Estimation in multivariate analysis (62H12) Measures of information, entropy (94A17) Quantum state estimation, approximate cloning (81P50)
Cites Work
- A Singular Value Thresholding Algorithm for Matrix Completion
- Title not available (Why is that?)
- Noisy low-rank matrix completion with general sampling distribution
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- User-friendly tail bounds for sums of random matrices
- Matrix computations.
- Title not available (Why is that?)
- Von Neumann entropy penalization and low-rank matrix estimation
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms
- Continuity bounds on the quantum relative entropy. II
- Efficient learning of label ranking by soft projections onto polyhedra
- Interaction in Quantum Communication
- Stable low-rank matrix recovery via null space properties
- Sharp oracle inequalities in low rank estimation
- Title not available (Why is that?)
- A remark on low rank matrix recovery and noncommutative Bernstein type inequalities
- Optimal estimation of low rank density matrices
Cited In (8)
- Optimal Kullback-Leibler aggregation in mixture density estimation by maximum likelihood
- Confidence regions and minimax rates in outlier-robust estimation on the probability simplex
- Fast state tomography with optimal error bounds
- Estimation of low rank density matrices by Pauli measurements
- Matrix factorization for multivariate time series analysis
- Relations between convergence rates in Schatten p-norms
- Optimal estimation of low rank density matrices
- Statistical analysis of compressive low rank tomography with random measurements
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)