mlsanityData to 14 Oct 2026

Unrolling SVT to obtain computationally efficient SVT for n-qubit quantum state tomography

arXiv 2212.08852 ↗First posted 17 Dec 2022quant-ph cs.LG eess.SPcited by 0

Not on the map. Why?

Abstract (arXiv)

Quantum state tomography aims to estimate the state of a quantum mechanical system which is described by a trace one, Hermitian positive semidefinite complex matrix, given a set of measurements of the state. Existing works focus on estimating the density matrix that represents the state, using a compressive sensing approach, with only fewer measurements than that required for a tomographically complete set, with the assumption that the true state has a low rank. One very popular method to estimate the state is the use of the Singular Value Thresholding (SVT) algorithm. In this work, we present a machine learning approach to estimate the quantum state of n-qubit systems by unrolling the iterations of SVT which we call Learned Quantum State Tomography (LQST). As merely unrolling SVT may not ensure that the output of the network meets the constraints required for a quantum state, we design and train a custom neural network whose architecture is inspired from the iterations of SVT with additional layers to meet the required constraints. We show that our proposed LQST with very few layers reconstructs the density matrix with much better fidelity than the SVT algorithm which takes many hundreds of iterations to converge. We also demonstrate the reconstruction of the quantum Bell state from an informationally incomplete set of noisy measurements.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 30 references that are in the map. First posted on arXiv 17 Dec 2022.

Builds on

7 of 30 references.

References · 7

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2021Convex optimizationcited by 2,515
  3. 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 421
  4. 2018Deep Unfolded Robust PCA with Application to Clutter Suppression in Ultrasoundcited by 44
  5. 2015A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurementscited by 34
  6. 2020Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Numbercited by 28
  7. 2020Positive Semidefinite Matrix Factorization: A Connection with Phase Retrieval and Affine Rank Minimizationcited by 3

Built on by

Not cited yet.