17 citations · 17 across the 2 of their papers we have counts for
5 papers
Plain Transformers Can be Powerful Graph Learners
Liheng Ma, Soumyasundar Pal, Yingxue Zhang +2
Transformers have attained outstanding performance across various modalities, owing to their simple but powerful scaled-dot-product (SDP) attention mechanisms. Researchers have att…
Highly-efficient quantum Fourier transformations for some nonabelian groups
Edison M. Murairi, M. Sohaib Alam, Henry Lamm +2
Quantum Fourier transformations are an essential component of many quantum algorithms, from prime factoring to quantum simulation. While the standard abelian QFT is well-studied, i…
Scattering Processes from Quantum Simulation Algorithms for Scalar Field Theories
Andrew Hardy, Priyanka Mukhopadhyay, M. Sohaib Alam +8
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and ph…
Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
Eleanor G. Rieffel, Ata Akbari Asanjan, M. Sohaib Alam +20
Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum co…
Dynamical Logical Qubits in the Bacon-Shor Code
M. Sohaib Alam, Eleanor Rieffel
The Bacon-Shor code is a quantum error correcting subsystem code composed of weight 2 check operators that admits a single logical qubit, and has distance on a squ…