On the relevance of avoided crossings away from quantum critical point to the complexity of quantum adiabatic algorithm - Sergey Knysh; Vadim N. Smelyanskiy (CoRR, 2010)

The complexity of the Quantum Adiabatic Algorithm. - A. P. Young; Sergey Knysh; Vadim N. Smelyanskiy (Comput. Phys. Commun., 2011)

A NASA perspective on quantum computing: Opportunities and challenges. - Rupak Biswas; Zhang Jiang; Kostya Kechezhi; Sergey Knysh; Salvatore Mandrà; Bryan O'Gorman; Alejandro Perdomo-Ortiz; Andre Petukhov; John Realpe-Gomez; Eleanor Gilbert Rieffel; Davide Venturelli; Fedir Vasko; et al. (Parallel Comput., 2017)