Hybrid reconstruction of quantum density matrix: when low-rank meets sparsity
From MaRDI portal
Publication:1698802
DOI10.1007/s11128-017-1720-xzbMath1382.81054OpenAlexW2766718206MaRDI QIDQ1698802
Publication date: 16 February 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-017-1720-x
Point estimation (62F10) Quantum measurement theory, state operations, state preparations (81P15) Quantum state estimation, approximate cloning (81P50)
Related Items (1)
Cites Work
- Unnamed Item
- An improved robust ADMM algorithm for quantum state tomography
- The restricted isometry property and its implications for compressed sensing
- Self-protected quantum algorithms based on quantum state tomography
- Quantum error correction via convex optimization
- Quantum tomography under prior information
- Partial standard quantum process tomography
- Robust principal component analysis?
- Decoding by Linear Programming
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Generating random density matrices
- Compressed sensing
This page was built for publication: Hybrid reconstruction of quantum density matrix: when low-rank meets sparsity