Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Efficient and SPAM-Robust Ansatz-Free Lindbladian Learning
Savar D. Sinha
Describing the dynamics of open systems is essential for fault-tolerant quantum computation. Under Markovian assumptions, we can characterize dissipative dynamics via the Lindbladi…
quant-ph2025
Improved Hamiltonian learning and sparsity testing through Bell sampling
Savar D. Sinha, Yu Tong
We consider the problem of learning an -sparse Hamiltonian and the related problem of Hamiltonian sparsity testing. Through a detailed analysis of Bell sampling, we reduce the t…