mlsanityData to 13 Oct 2026

Fast quantum state reconstruction via accelerated non-convex programming

arXiv 2104.07006 ↗First posted 14 Apr 2021quant-ph cs.IT cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

We propose a new quantum state reconstruction method that combines ideas from compressed sensing, non-convex optimization, and acceleration methods. The algorithm, called Momentum-Inspired Factored Gradient Descent (textttMiFGD), extends the applicability of quantum tomography for larger systems. Despite being a non-convex method, textttMiFGD converges provably close to the true density matrix at an accelerated linear rate, in the absence of experimental and statistical noise, and under common assumptions. With this manuscript, we present the method, prove its convergence property and provide Frobenius norm bound guarantees with respect to the true density matrix. From a practical point of view, we benchmark the algorithm performance with respect to other existing methods, in both synthetic and real experiments performed on an IBM's quantum processing unit. We find that the proposed algorithm performs orders of magnitude faster than state of the art approaches, with the same or better accuracy. In both synthetic and real experiments, we observed accurate and robust reconstruction, despite experimental and statistical noise in the tomographic data. Finally, we provide a ready-to-use code for state tomography of multi-qubit systems.

Key facts. Cited by 5 papers in the map (data through 13 Oct 2026). Builds on 27 of its 107 references that are in the map. First posted on arXiv 14 Apr 2021.

Builds on

27 of 107 references.

References · 27

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,093
  2. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 718
  3. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 635
  4. 2020Predicting Many Properties of a Quantum System from Very Few Measurementscited by 233
  5. 2017A Rewriting System for Convex Optimization Problemscited by 179
  6. 2017No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysiscited by 127
  7. 2015Low-rank Solutions of Linear Matrix Equations via Procrustes Flowcited by 97
  8. 2014Guaranteed Matrix Completion via Non-convex Factorizationcited by 82
  9. 2016Global Optimality of Local Search for Low Rank Matrix Recoverycited by 81
  10. 2015Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guaranteescited by 68
  11. 2016Efficient quantum tomography IIcited by 54
  12. 2020Quantum State Tomography with Conditional Generative Adversarial Networkscited by 41
15 more
  1. 2015Dropping Convexity for Faster Semi-definite Optimizationcited by 40
  2. 2016Non-square matrix sensing without spurious local minima via the Burer-Monteiro approachcited by 38
  3. 2015A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurementscited by 34
  4. 2013Provable Inductive Matrix Completioncited by 31
  5. 2015A geometric alternative to Nesterov's accelerated gradient descentcited by 22
  6. 2017Accelerated Stochastic Power Iterationcited by 22
  7. 2020Operator splitting for a homogeneous embedding of the linear complementarity problemcited by 21
  8. 2016Accelerated Methods for Non-Convex Optimizationcited by 20
  9. 2020Classification and reconstruction of optical quantum states with deep neural networkscited by 17
  10. 2018Nonconvex Matrix Factorization from Rank-One Measurementscited by 13
  11. 2017IHT dies hard: Provable accelerated Iterative Hard Thresholdingcited by 10
  12. 2016Finding Approximate Local Minima Faster than Gradient Descentcited by 8
  13. 2016Provable Burer-Monteiro factorization for a class of norm-constrained matrix problemscited by 2
  14. 2017Provable quantum state tomography via non-convex methodscited by 2
  15. 2020Estimating expectation values using approximate quantum statescited by 2

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 2; 2026: 2.

5 papers.