Back to Explorer
Research PaperResearchia:202604.01078[Quantum Computing > Quantum Physics]

Certifying and learning local quantum Hamiltonians

Andreas Bluhm

Abstract

In this work, we study the problems of certifying and learning quantum kk-local Hamiltonians, for a constant kk. Our main contributions are as follows: - Certification of Hamiltonians. We show that certifying a local Hamiltonian in normalized Frobenius norm via access to its time-evolution operator can be achieved with only O(1/ε)O(1/\varepsilon) evolution time. This is optimal, as it matches the Heisenberg-scaling lower bound of Ω(1/ε)Ω(1/\varepsilon). To our knowledge, this is the first optimal algorithm for testing a Hamiltonian property. A key ingredient in our analysis is the Bonami Hypercontractivity Lemma from Fourier analysis. - Learning Gibbs states. We design an algorithm for learning Gibbs states of local Hamiltonians in trace norm that is sample-efficient in all relevant parameters. In contrast, previous approaches learned the underlying Hamiltonian (which implies learning the Gibbs state), and thus inevitably suffered from exponential sample complexity scaling in the inverse temperature. - Certification of Gibbs states. We give an algorithm for certifying Gibbs states of local Hamiltonians in trace norm that is both sample and time-efficient in all relevant parameters, thereby solving a question posed by Anshu (Harvard Data Science Review, 2022).


Source: arXiv:2603.29809v1 - http://arxiv.org/abs/2603.29809v1 PDF: https://arxiv.org/pdf/2603.29809v1 Original Link: http://arxiv.org/abs/2603.29809v1

Submission:4/1/2026
Comments:0 comments
Subjects:Quantum Physics; Quantum Computing
Original Source:
View Original PDF
arXiv: This paper is hosted on arXiv, an open-access repository
Was this helpful?

Discussion (0)

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!