Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918139758903296 |
|---|---|
| author | Abbas, Amira Cerrato, Nunzia Gutiérrez, Francisco Escudero Grinko, Dmitry Mele, Francesco Anna Sinha, Pulkit |
| author_facet | Abbas, Amira Cerrato, Nunzia Gutiérrez, Francisco Escudero Grinko, Dmitry Mele, Francesco Anna Sinha, Pulkit |
| contents | We study the problem of learning Hamiltonians $H$ that are $s$-sparse in the Pauli basis, given access to their time evolution. Although Hamiltonian learning has been extensively investigated, two issues recur in much of the existing literature: the absence of matching lower bounds and the use of mathematically convenient but physically opaque error measures.
We address both challenges by introducing two physically motivated distances between Hamiltonians and designing a nearly optimal algorithm with respect to one of these metrics. The first, time-constrained distance, quantifies distinguishability through dynamical evolution up to a bounded time. The second, temperature-constrained distance, captures distinguishability through thermal states at bounded inverse temperatures.
We show that $s$-sparse Hamiltonians with bounded operator norm can be learned in both distances with $O(s \log(1/ε))$ experiments and $O(s^2/ε)$ evolution time. For the time-constrained distance, we further establish lower bounds of $Ω((s/n)\log(1/ε) + s)$ experiments and $Ω(\sqrt{s}/ε)$ evolution time, demonstrating near-optimality in the number of experiments.
As an intermediate result, we obtain an algorithm that learns every Pauli coefficient of $s$-sparse Hamiltonians up to error $ε$ in $O(s\log(1/ε))$ experiments and $O(s/ε)$ evolution time, improving upon several recent results.
The source of this improvement is a new isolation technique, inspired by the Valiant-Vazirani theorem (STOC'85), which shows that NP is as easy as detecting unique solutions. This isolation technique allows us to query the time evolution of a single Pauli coefficient of a sparse Hamiltonian--even when the Pauli support of the Hamiltonian is unknown--ultimately enabling us to recover the Pauli support itself. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_09813 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances Abbas, Amira Cerrato, Nunzia Gutiérrez, Francisco Escudero Grinko, Dmitry Mele, Francesco Anna Sinha, Pulkit Quantum Physics Computational Complexity Data Structures and Algorithms We study the problem of learning Hamiltonians $H$ that are $s$-sparse in the Pauli basis, given access to their time evolution. Although Hamiltonian learning has been extensively investigated, two issues recur in much of the existing literature: the absence of matching lower bounds and the use of mathematically convenient but physically opaque error measures. We address both challenges by introducing two physically motivated distances between Hamiltonians and designing a nearly optimal algorithm with respect to one of these metrics. The first, time-constrained distance, quantifies distinguishability through dynamical evolution up to a bounded time. The second, temperature-constrained distance, captures distinguishability through thermal states at bounded inverse temperatures. We show that $s$-sparse Hamiltonians with bounded operator norm can be learned in both distances with $O(s \log(1/ε))$ experiments and $O(s^2/ε)$ evolution time. For the time-constrained distance, we further establish lower bounds of $Ω((s/n)\log(1/ε) + s)$ experiments and $Ω(\sqrt{s}/ε)$ evolution time, demonstrating near-optimality in the number of experiments. As an intermediate result, we obtain an algorithm that learns every Pauli coefficient of $s$-sparse Hamiltonians up to error $ε$ in $O(s\log(1/ε))$ experiments and $O(s/ε)$ evolution time, improving upon several recent results. The source of this improvement is a new isolation technique, inspired by the Valiant-Vazirani theorem (STOC'85), which shows that NP is as easy as detecting unique solutions. This isolation technique allows us to query the time evolution of a single Pauli coefficient of a sparse Hamiltonian--even when the Pauli support of the Hamiltonian is unknown--ultimately enabling us to recover the Pauli support itself. |
| title | Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances |
| topic | Quantum Physics Computational Complexity Data Structures and Algorithms |
| url | https://arxiv.org/abs/2509.09813 |