Asymptotic equivalence of quantum state tomography and noisy matrix completion
DOI10.1214/13-AOS1156zbMath1294.62006arXiv1311.4976MaRDI QIDQ2438759
Publication date: 6 March 2014
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.4976
observabledensity matrixsparse matrixquantum statisticsquantum probabilitycompressed sensingdeficiency distancequantum measurementPauli matricestrace regressionlow rank matrixfine scale trace regression
Theory of statistical experiments (62B15) Linear inference, regression (62J99) Applications of statistics to physics (62P35) Iterative numerical methods for linear systems (65F10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum state estimation, approximate cloning (81P50)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum computation and quantum information
- Von Neumann entropy penalization and low-rank matrix estimation
- Estimation of high-dimensional low-rank matrices
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Optimal selection of reduced rank estimators of high-dimensional matrices
- Quantum Monte Carlo simulation
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Minimax and adaptive estimation of the Wigner function in quantum homodyne tomography with noisy data
- Asymptotic methods in statistical decision theory
- Asymptotics in statistics. Some basic concepts.
- Deficiency distance between multinomial and multivariate normal experiments
- Asymptotic nonequivalence of GARCH models and diffusions
- Rank penalized estimators for high-dimensional matrices
- Exact matrix completion via convex optimization
- On Quantum Statistical Inference
- An Invitation to Quantum Tomography
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Modern Quantum Mechanics
- A Simpler Approach to Matrix Completion
- Compressed sensing
This page was built for publication: Asymptotic equivalence of quantum state tomography and noisy matrix completion