| A practical heuristic for finding graph minors J Cai, WG Macready, A Roy arXiv preprint arXiv:1406.2741, 2014 | 300 | 2014 |
| Next-generation topology of d-wave quantum processors K Boothby, P Bunyk, J Raymond, A Roy arXiv preprint arXiv:2003.00133, 2020 | 182 | 2020 |
| Fast clique minor generation in Chimera qubit connectivity graphs T Boothby, AD King, A Roy Quantum Information Processing 15, 495-508, 2016 | 167 | 2016 |
| Equiangular lines, mutually unbiased bases, and spin models C Godsil, A Roy European Journal of Combinatorics 30 (1), 246-262, 2009 | 158 | 2009 |
| Discrete optimization using quantum annealing on sparse Ising models Z Bian, F Chudak, R Israel, B Lackey, WG Macready, A Roy Frontiers in Physics 2, 56, 2014 | 140 | 2014 |
| Partitioning optimization problems for hybrid classical M Booth, SP Reinhardt, A Roy quantum execution. Technical Report, 01-09, 2017 | 131 | 2017 |
| Unitary designs and codes A Roy, AJ Scott Designs, codes and cryptography 53, 13-31, 2009 | 114 | 2009 |
| Weighted complex projective 2-designs from bases: optimal state determination by orthogonal measurements A Roy, AJ Scott Journal of mathematical physics 48 (7), 2007 | 109 | 2007 |
| Mapping constrained optimization problems to quantum annealing with application to fault diagnosis Z Bian, F Chudak, RB Israel, B Lackey, WG Macready, A Roy Frontiers in ICT, 14, 2016 | 99 | 2016 |
| Entanglement can increase asymptotic rates of zero-error classical communication over classical channels D Leung, L Mancinska, W Matthews, M Ozols, A Roy Communications in Mathematical Physics 311, 97-111, 2012 | 52 | 2012 |
| Systems and methods for problem solving, useful for example in quantum computing F Hamze, AD King, J Raymond, AP Roy, R Israel, E Andriyash, ... US Patent 9,881,256, 2018 | 45 | 2018 |
| Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results Z Bian, F Chudak, W Macready, A Roy, R Sebastiani, S Varotti Information and computation 275, 104609, 2020 | 33 | 2020 |
| Complex spherical designs and codes A Roy, S Suda Journal of Combinatorial Designs 22 (3), 105-148, 2014 | 32 | 2014 |
| Hearing the shape of the Ising model with a programmable superconducting-flux annealer W Vinci, K Markström, S Boixo, A Roy, FM Spedalieri, PA Warburton, ... Scientific reports 4 (1), 5703, 2014 | 28 | 2014 |
| Boosting integer factoring performance via quantum annealing offsets E Andriyash, Z Bian, F Chudak, M Drew-Brook, AD King, WG Macready, ... D-Wave Technical Report Series 14 (2016), 2016 | 27 | 2016 |
| Solving sat and maxsat with a quantum annealer: Foundations and a preliminary report Z Bian, F Chudak, W Macready, A Roy, R Sebastiani, S Varotti Frontiers of Combining Systems: 11th International Symposium, FroCoS 2017 …, 2017 | 25 | 2017 |
| Bounds for codes and designs in complex subspaces A Roy Journal of Algebraic Combinatorics 31 (1), 1-32, 2010 | 25 | 2010 |
| Minimal Euclidean representations of graphs A Roy Discrete Mathematics 310 (4), 727-733, 2010 | 23 | 2010 |
| Systems and methods for analog processing of problem graphs having arbitrary size and/or connectivity MC Thom, AP Roy, FA Chudak, Z Bian, WG Macready, RB Israel, ... US Patent 10,599,988, 2020 | 21 | 2020 |
| Systems and methods that formulate embeddings of problems for solving by a quantum processor AP Roy US Patent 9,501,747, 2016 | 21 | 2016 |
