3 papers
cs.LG2026
Support Basis: Fast Attention Beyond Bounded Entries
Maryam Aliakbarpour, Vladimir Braverman, Junze Yin +1
Large language models (LLMs) have demonstrated remarkable performance across a wide range of tasks. However, the quadratic complexity of softmax attention remains a central bottlen…
quant-ph2025
Shadow Tomography Against Adversaries
Maryam Aliakbarpour, Vladimir Braverman, Nai-Hui Chia +4
We study single-copy shadow tomography in the adversarial robust setting, where the goal is to learn the expectation values of observables with …
quant-ph2025
Adversarially robust quantum state learning and testing
Maryam Aliakbarpour, Vladimir Braverman, Nai-Hui Chia +1
Quantum state learning is a fundamental problem in physics and computer science. As near-term quantum devices are error-prone, it is important to design error-resistant algorithms.…