Quantum Complexity of Time Evolution with Chaotic Hamiltonians. - Vijay Balasubramanian; Matthew DeCross; Arjun Kar; Onkar Parrikar (CoRR, 2019)

Complexity Growth in Integrable and Chaotic Models. - Vijay Balasubramanian; Matthew DeCross; Arjun Kar; Cathy Li; Onkar Parrikar (CoRR, 2021)

Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem. - Ruslan Shaydulin; Changhao Li; Shouvanik Chakrabarti; Matthew DeCross; Dylan Herman; Niraj Kumar 005; Jeffrey Larson 001; Danylo Lykov; Pierre Minssen; Yue Sun; Yuri Alexeev; Joan M. Dreiling; et al. (CoRR, 2023)

Code from "Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem". - Ruslan Shaydulin; Changhao Li; Shouvanik Chakrabarti; Matthew DeCross; Dylan Herman; Niraj Kumar 005; Jeffrey Larson 001; Danylo Lykov; Pierre Minssen; Yue Sun; Yuri Alexeev; Joan M. Dreiling; et al. (Zenodo, 2023)

Certified randomness using a trapped-ion quantum processor. - Minzhao Liu; Ruslan Shaydulin; Pradeep Niroula; Matthew DeCross; Shih-Han Hung; Wen Yu Kon; Enrique Cervero Martín; Kaushik Chakraborty; Omar Amer; Scott Aaronson; Atithi Acharya; Yuri Alexeev; et al. (Nat., 2025)