Uncertainty Quantification for Matrix Compressed Sensing and Quantum Tomography Problems

Abstract

We construct minimax optimal non-asymptotic confidence sets for low rank matrix recovery algorithms such as the Matrix Lasso or Dantzig selector. These are employed to devise adaptive sequential sampling procedures that guarantee recovery of the true matrix in Frobenius norm after a data-driven stopping time $\hat{n}$ for the number of measurements that have to be taken. With high probability, this stopping time is minimax optimal. We detail applications to quantum tomography problems where measurements arise from Pauli observables. We also give a theoretical construction of a confidence set for the density matrix of a quantum state that has optimal diameter in nuclear norm. The non-asymptotic properties of our confidence sets are further investigated in a simulation study.

References in corpus (9)

• Scalable multi-particle entanglement of trapped ions
• Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
• Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
• Can one estimate the conditional distribution of post-model-selection estimators?
• Confidence bands in density estimation
• On adaptive inference and confidence bands
• Quantum state tomography by continuous measurement and compressed sensing
• Rank-based model selection for multiple ions quantum tomography
• Robust error bars for quantum tomography

Cited by in corpus (8)

• Experimental quantum compressed sensing for a seven-qubit system
• Inference and Uncertainty Quantification for Noisy Matrix Completion
• Error regions in quantum state tomography: computational complexity caused by geometry of quantum states
• Statistical Inferences of Linear Forms for Noisy Matrix Completion
• Confidence Region of Singular Subspaces for Low-rank Matrix Regression
• Tackling small eigen-gaps: Fine-grained eigenvector estimation and inference under heteroscedastic noise
• Online Tensor Inference
• Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise