Recovering low-rank matrices from few coefficients in any basis

IEEE Transactions on Information Theory

Volumn 57, Issue 3, 2011, Pages 1548-1566

  Gross, David ^a,b  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

Compressed sensing; matrix completion; matrix recovery; operator large deviation bound; quantum state tomography

Indexed keywords

COMPRESSED SENSING; MATRIX COMPLETION; MATRIX RECOVERY; OPERATOR LARGE-DEVIATION BOUND; QUANTUM-STATE TOMOGRAPHY;

QUANTUM THEORY; SIGNAL RECONSTRUCTION; TOMOGRAPHY;

RECOVERY;

EID: 79951886985     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2104999     Document Type: Article

References (37)

1. B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization," SIAM Rev., vol. 52, pp. 471-501, 2010.
2. A. Singer and M. Cucuringu, "Uniqueness of low-rank matrix completion by rigidity theory," SIAM J. Matrix Anal. Appl., vol. 31, pp. 1621-1641, 2010.
3. E. J. Candes and T. Tao, "The power of convex relaxation: Near-Optimal matrix completion," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2053-2080, May 2010.
4. E. J. Candes and Y. Plan, "Matrix completion with noise," Proc. IEEE, submitted for publication.
5. A. Singer and M. Cucuringu, Uniqueness of low-rank matrix completion by rigidity theory 2009 [Online]. Available: http://arxiv.org/abs/ 0902.3846
6. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," IEEE Trans. Inf. Theory, 56, no. 6, pp. 2980-2998, Jun. 2010.
7. J. Wright, A. Ganesh, S. Rao, and Y. Ma, "Robust principal component analysis: Exact recovery of corrupted low-rank matrices," in Proc. Neural Information Processing Systems (NIPS), Dec. 2009.
8. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theor., vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
9. E. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
10. E. Candes and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006. (Pubitemid 46445381)
11. D. Gross, Y. Liu, S. T. Flammia, S. Becker, and J. Eisert, "Quantum state tomography via compressed sensing," Phys. Rev. Lett., vol. 105, no. 150401, 2010.
12. R. Bhatia, Matrix Analysis. New York: Springer, 1997.
13. Y. Liu, Notes Jun. 2009.
14. R. F.Werner, "All teleportation and dense coding schemes," J. Phys. A Math Gen., vol. 34, no. 35, pp. 7081-7094, 2001.
15. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information. Cambridge, U.K.: Cambridge University Press, 2000.
16. D. Gottesman, "Stabilizer codes and quantum error correction," Ph.D. dissertation, Caltech, Pasadena, CA, 1997.
17. A. Montanaro and T. J. Osborne, Quantum Boolean functions 2008 [Online]. Available: http://arxiv.org/abs/0810.2435
18. D. Gross, "Hudson's theorem for finite-dimensional quantum systems," J. Math. Phys. (NY ), vol. 47, no. 12, p. 122107, Dec. 2006.
19. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, no. 2, pp. 227-234, 1995.
20. M. Mesbahi and G. Papavassilopoulos, "On the rank minimization problem over a positive semidefinite linear matrix inequality," IEEE Trans. Autom. Control, vol. 42, no. 2, pp. 239-243, Feb. 1997. (Pubitemid 127760583)
21. M. Fazel, H. Hindi, and S. Boyd, "A rank minimization heuristic with application to minimum order system approximation," in Proc. Amer. Control Conf., 2001, vol. 6, pp. 4734-4739. (Pubitemid 32837075)
22. A. W. Marshall and I. Olkin, Inequalities. New York: Academic, 1979.
23. D. P. Bertsekas, A. Nedić, and A. E. Ozdaglar, Convex Analysis and Optimization. New York: Athena Scientific, 2003.
24. R. Ahlswede and A. Winter, "Strong converse for identification via quantum channels," IEEE Trans. Inf. Theor., vol. 48, no. 3, pp. 569-579, Mar. 2002. (Pubitemid 34239788)
25. B. Recht, A simpler approach to matrix completion 2009 [Online]. Available: http://arxiv.org/abs/0910.0651
26. S. Becker, S. T. Flammia, D. Gross, Y. Liu, and J. Eisert, 2009.
27. D. Gross and V. Nesme, "Note on sampling without replacing from a finite collection of matrices," [Online]. Available: arXiv:1001.2738
28. M. Rudelson, "Random vectors in the isotropic position," J. Funct. Anal., vol. 164, no. 1, pp. 60-72, 1999.
29. Petz, "A survey of certain trace inequalities," Funct. Anal. Oper. Theor., vol. 30, p. 287, 1994.
30. D. P. Dubhashi and A. Panconesi, Concentration of Measure For the Analysis of Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 2009.
31. T. Tao and V. Vu, Additive Combinatorics. Cambridge, U.K.: Cambridge Univ. Press, 2006.
32. M. Ledoux and M. Talagrand, Probability in Banach Spaces. New York: Springer, 1991.
33. McDiarmid, "Concentration," Probabil. Methods for Algorith. Discrete Math., vol. 16, pp. 195-248, 1998.
34. Yurinskii, "Exponential bounds for large deviations," Theor. Probab. Appl., vol. 19, p. 154, 1974.
35. D. Christofides and K. Markström, "Expansion properties of random cayley graphs and vertex transitive graphs via matrix martingales," Random Struct., Algorith., vol. 32, no. 1, pp. 88-100, 2007.
36. J. A. Tropp, User-Friendly tail bounds for matrix martingales 2010 [Online]. Available: http://arxiv.org/abs/1004.4389
37. M. Isaacs, Character Theory of Finite Groups. New York: Academic, 1976.