Quick Navigation
Topics
Trapped Ion Quantum Computing
Learning the structure of any Hamiltonian from minimal assumptions
arXiv
Authors: Andrew Zhao
Year
2024
Paper ID
37547
Status
Preprint
Abstract Read
~2 min
Abstract Words
225
Citations
N/A
Abstract
We study the problem of learning an unknown quantum many-body Hamiltonian H from black-box queries to its time evolution e-i H t. Prior proposals for solving this task either impose some assumptions on H, such as its interaction structure or locality, or otherwise use an exponential amount of computational postprocessing. In this paper, we present algorithms to learn any n-qubit Hamiltonian, which do not need to know the Hamiltonian terms in advance, nor are they restricted to local interactions. Our algorithms are efficient as long as the number of terms m is polynomially bounded in the system size n. We consider two models of control over the time evolution: the first has access to time reversal (t < 0), enabling an algorithm that outputs an ε-accurate classical description of H after querying its dynamics for a total of widetilde{mathcal{O}}(m/ε) evolution time. The second access model is more conventional, allowing only forward-time evolutions; our algorithm requires widetilde{mathcal{O}}\(\|H\|3/ε4\) evolution time in this setting. Central to our results is the recently introduced concept of a pseudo-Choi state of H. We extend the utility of this learning resource by showing how to use it to learn the Fourier spectrum of H, how to achieve nearly Heisenberg-limited scaling with it, and how to prepare it even under our more restricted access models.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2024 reference point for readers tracking recent quantum research.
- We study the problem of learning an unknown quantum many-body Hamiltonian H from black-box queries to its time evolution e^-i H t.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.