Online Quantum State Tomography via Stochastic Gradient Descent
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916837025906688 |
|---|---|
| author | Cai, Jian-Feng Jiao, Yuling Li, Yinan Lu, Xiliang Yang, Jerry Zhijian You, Juntao |
| author_facet | Cai, Jian-Feng Jiao, Yuling Li, Yinan Lu, Xiliang Yang, Jerry Zhijian You, Juntao |
| contents | We initiate the study of online quantum state tomography (QST), where the matrix representation of an unknown quantum state is reconstructed by sequentially performing a batch of measurements and updating the state estimate using only the measurement statistics from the current round. Motivated by recent advances in non-convex optimization algorithms for solving low-rank QST, we propose non-convex mini-batch stochastic gradient descent (SGD) algorithms to tackle online QST, which leverage the low-rank structure of the unknown quantum state and are well-suited for practical applications. Our main technical contribution is a rigorous convergence analysis of these algorithms. With proper initialization, we demonstrate that the SGD algorithms for online low-rank QST achieve linear convergence both in expectation and with high probability. Our algorithms achieve nearly optimal sample complexity while remaining highly memory-efficient. In particular, their time complexities are better than the state-of-the-art non-convex QST algorithms, in terms of the rank and the logarithm of the dimension of the unknown quantum state. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_07601 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Online Quantum State Tomography via Stochastic Gradient Descent Cai, Jian-Feng Jiao, Yuling Li, Yinan Lu, Xiliang Yang, Jerry Zhijian You, Juntao Quantum Physics We initiate the study of online quantum state tomography (QST), where the matrix representation of an unknown quantum state is reconstructed by sequentially performing a batch of measurements and updating the state estimate using only the measurement statistics from the current round. Motivated by recent advances in non-convex optimization algorithms for solving low-rank QST, we propose non-convex mini-batch stochastic gradient descent (SGD) algorithms to tackle online QST, which leverage the low-rank structure of the unknown quantum state and are well-suited for practical applications. Our main technical contribution is a rigorous convergence analysis of these algorithms. With proper initialization, we demonstrate that the SGD algorithms for online low-rank QST achieve linear convergence both in expectation and with high probability. Our algorithms achieve nearly optimal sample complexity while remaining highly memory-efficient. In particular, their time complexities are better than the state-of-the-art non-convex QST algorithms, in terms of the rank and the logarithm of the dimension of the unknown quantum state. |
| title | Online Quantum State Tomography via Stochastic Gradient Descent |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2507.07601 |