3 papers
quant-ph2025
Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
Amira Abbas, Nunzia Cerrato, Francisco Escudero Gutiérrez +3
We study the problem of learning Hamiltonians that are -sparse in the Pauli basis, given access to their time evolution. Although Hamiltonian learning has been extensively i…
quant-ph2024
Dimension Independent and Computationally Efficient Shadow Tomography
Pulkit Sinha
We describe a new shadow tomography algorithm that uses samples, for measurements and additive error , which is independent of the dimension of the…
cs.CC2024
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
Omkar Baraskar, Agrim Dewan, Chandan Saha +1
An -sparse polynomial has at most monomials with nonzero coefficients. The Equivalence Testing problem for sparse polynomials (ETsparse) asks to decide if a given polynomial…