An Efficient and Fast Quantum State Estimator With Sparse Disturbance

被引:18
作者
Zhang, Jiaojiao [1 ]
Cong, Shuang [1 ]
Ling, Qing [2 ]
Li, Kezhi [3 ]
机构
[1] Univ Sci & Technol China, Dept Automat, Hefei 230027, Anhui, Peoples R China
[2] Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
[3] Imperial Coll London, Dept Elect & Elect Engn, London SW5 7AZ, England
基金
中国国家自然科学基金;
关键词
Alternating direction method of multipliers (ADMM); quantum state estimation (QSE); robust principal component analysis (RPCA); THRESHOLDING ALGORITHM; MATRICES; RANK;
D O I
10.1109/TCYB.2018.2828498
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A pure or nearly pure quantum state can be described as a low-rank density matrix, which is a positive semidefinite and unit-trace Hermitian. We consider the problem of recovering such a low-rank density matrix contaminated by sparse components, from a small set of linear measurements. This quantum state estimation task can be formulated as a robust principal component analysis (RPCA) problem subject to positive semidefinite and unit-trace Hermitian constraints. We propose an efficient and fast inexact alternating direction method of multipliers (I-ADMM), in which the subproblems are solved inexactly and hence have closed-form solutions. We prove global convergence of the proposed I-ADMM, and the theoretical result provides a guideline for parameter setting. Numerical experiments show that the proposed I-ADMM can recover state density matrices of 5 qubits on a laptop in 0.69 s, with 6 x 10(-4) accuracy (99.38% fidelity) using 30% compressive sensing measurements, which outperforms existing algorithms.
引用
收藏
页码:2546 / 2555
页数:10
相关论文
共 42 条
[1]  
[Anonymous], FOUND TRENDS MACH LE
[2]  
[Anonymous], IFAC PAPERSONLINE
[3]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[4]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)
[5]   RANK-SPARSITY INCOHERENCE FOR MATRIX DECOMPOSITION [J].
Chandrasekaran, Venkat ;
Sanghavi, Sujay ;
Parrilo, Pablo A. ;
Willsky, Alan S. .
SIAM JOURNAL ON OPTIMIZATION, 2011, 21 (02) :572-596
[6]   An iterative thresholding algorithm for linear inverse problems with a sparsity constraint [J].
Daubechies, I ;
Defrise, M ;
De Mol, C .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2004, 57 (11) :1413-1457
[7]   On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers [J].
Deng, Wei ;
Yin, Wotao .
JOURNAL OF SCIENTIFIC COMPUTING, 2016, 66 (03) :889-916
[8]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[9]   Direct Fidelity Estimation from Few Pauli Measurements [J].
Flammia, Steven T. ;
Liu, Yi-Kai .
PHYSICAL REVIEW LETTERS, 2011, 106 (23)
[10]  
Gabay D., 1976, Computers & Mathematics with Applications, V2, P17, DOI 10.1016/0898-1221(76)90003-1