Beating full state tomography for unentangled spectrum estimation
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_ | 1866916673275035648 |
|---|---|
| author | Pelecanos, Angelos Tan, Xinyu Tang, Ewin Wright, John |
| author_facet | Pelecanos, Angelos Tan, Xinyu Tang, Ewin Wright, John |
| contents | How many copies of a mixed state $ρ\in \mathbb{C}^{d \times d}$ are needed to learn its spectrum? To date, the best known algorithms for spectrum estimation require as many copies as full state tomography, suggesting the possibility that learning a state's spectrum might be as difficult as learning the entire state. We show that this is not the case in the setting of unentangled measurements, by giving a spectrum estimation algorithm that uses $n = O(d^3\cdot (\log\log(d) / \log(d))^4 )$ copies of $ρ$, which is asymptotically fewer than the $n = Ω(d^3)$ copies necessary for full state tomography. Our algorithm is inspired by the technique of local moment matching from classical statistics, and shows how it can be applied in the quantum setting.
As an important subroutine in our spectrum estimation algorithm, we give an estimator of the $k$-th moment $\operatorname{tr}(ρ^k)$ which performs unentangled measurements and uses $O(d^{3-2/k})$ copies of $ρ$ in order to achieve a constant multiplicative error. This directly translates to an additive-error estimator of quantum Renyi entropy of order $k$ with the same number of copies.
Finally, we present numerical evidence that the sample complexity of spectrum estimation can only improve over full state tomography by a sub-polynomial factor. Specifically, for spectrum learning with fully entangled measurements, we run simulations which suggest a lower bound of $Ω(d^{2 - γ})$ copies for any constant $γ> 0$. From this, we conclude the current best lower bound of $Ω(d)$ is likely not tight. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_02785 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Beating full state tomography for unentangled spectrum estimation Pelecanos, Angelos Tan, Xinyu Tang, Ewin Wright, John Quantum Physics Computational Complexity Data Structures and Algorithms How many copies of a mixed state $ρ\in \mathbb{C}^{d \times d}$ are needed to learn its spectrum? To date, the best known algorithms for spectrum estimation require as many copies as full state tomography, suggesting the possibility that learning a state's spectrum might be as difficult as learning the entire state. We show that this is not the case in the setting of unentangled measurements, by giving a spectrum estimation algorithm that uses $n = O(d^3\cdot (\log\log(d) / \log(d))^4 )$ copies of $ρ$, which is asymptotically fewer than the $n = Ω(d^3)$ copies necessary for full state tomography. Our algorithm is inspired by the technique of local moment matching from classical statistics, and shows how it can be applied in the quantum setting. As an important subroutine in our spectrum estimation algorithm, we give an estimator of the $k$-th moment $\operatorname{tr}(ρ^k)$ which performs unentangled measurements and uses $O(d^{3-2/k})$ copies of $ρ$ in order to achieve a constant multiplicative error. This directly translates to an additive-error estimator of quantum Renyi entropy of order $k$ with the same number of copies. Finally, we present numerical evidence that the sample complexity of spectrum estimation can only improve over full state tomography by a sub-polynomial factor. Specifically, for spectrum learning with fully entangled measurements, we run simulations which suggest a lower bound of $Ω(d^{2 - γ})$ copies for any constant $γ> 0$. From this, we conclude the current best lower bound of $Ω(d)$ is likely not tight. |
| title | Beating full state tomography for unentangled spectrum estimation |
| topic | Quantum Physics Computational Complexity Data Structures and Algorithms |
| url | https://arxiv.org/abs/2504.02785 |