Testing and learning structured quantum Hamiltonians

DOI10.1007/S00220-025-05517-WMaRDI QIDQ6884268zbMATH OpenFDO

Authors Srinivasan Arunachalam, Arkopal Dutt, Francisco Gutierrez

Publication date 15 December 2025

Published in Communications in Mathematical Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/S00220-025-05517-W

zbMATH Keywords

\(n\)-qubit HamiltonianPauli channelssparse Hamiltonians

Mathematics Subject Classification ID

Computational learning theory (68Q32) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10)

Cites work

• A new proof for the existence of mutually unbiased bases
• Analysis of Boolean Functions
• Approximating the distance to monotonicity of Boolean functions
• Exponential separations between learning with and without quantum memory
• Fast Fourier sparsity testing
• Functions of Matrices
• scientific article; zbMATH DE number 6026126 (Why is no real title available?)
• Noncommutative Bohnenblust--Hille inequalities
• Optimal learning of quantum Hamiltonians from high-temperature Gibbs states
• Optimal quantum sample complexity of learning algorithms
• Optimizing quantum optimization algorithms via faster quantum gradient computation
• Property testing and its connection to learning and approximation
• Robust online Hamiltonian learning
• Testing and learning quantum juntas nearly optimally
• Testing Fourier dimensionality and sparsity
• Testing juntas nearly optimally
• The list-decoding size of Fourier-sparse Boolean functions
• Unitary property testing lower bounds by polynomials

This page was built for publication: Testing and learning structured quantum Hamiltonians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884268)