Follow
Aidan Roy
Aidan Roy
Sanctuary AI
Verified email at sanctuary.ai
Title
Cited by
Cited by
Year
A practical heuristic for finding graph minors
J Cai, WG Macready, A Roy
arXiv preprint arXiv:1406.2741, 2014
3572014
Next-generation topology of d-wave quantum processors
K Boothby, P Bunyk, J Raymond, A Roy
arXiv preprint arXiv:2003.00133, 2020
2642020
Fast clique minor generation in Chimera qubit connectivity graphs
T Boothby, AD King, A Roy
Quantum Information Processing 15, 495-508, 2016
1972016
Partitioning optimization problems for hybrid classical
M Booth, SP Reinhardt, A Roy
quantum execution. Technical Report, 01-09, 2017
1812017
Equiangular lines, mutually unbiased bases, and spin models
C Godsil, A Roy
European Journal of Combinatorics 30 (1), 246-262, 2009
1692009
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
1672014
Unitary designs and codes
A Roy, AJ Scott
Designs, codes and cryptography 53, 13-31, 2009
1342009
Weighted complex projective 2-designs from bases: optimal state determination by orthogonal measurements
A Roy, AJ Scott
Journal of mathematical physics 48 (7), 2007
1132007
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 3, 196706, 2016
1062016
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
752018
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
622020
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
572012
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
452020
Systems and methods that formulate embeddings of problems for solving by a quantum processor
AP Roy
US Patent 9,501,747, 2016
432016
Complex spherical designs and codes
A Roy, S Suda
Journal of Combinatorial Designs 22 (3), 105-148, 2014
392014
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
342017
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
342016
Systems and methods for embedding problems into an analog processor
AD King, RB Israel, PI Bunyk, KTR Boothby, SP Reinhardt, AP Roy, ...
US Patent 10,789,540, 2020
332020
Architectural considerations in the design of a third-generation superconducting quantum annealing processor
K Boothby, C Enderud, T Lanting, R Molavi, N Tsai, MH Volkmann, ...
arXiv preprint arXiv:2108.02322, 2021
302021
Bounds for codes and designs in complex subspaces
A Roy
Journal of Algebraic Combinatorics 31 (1), 1-32, 2010
302010
The system can't perform the operation now. Try again later.
Articles 1–20