Quantum algorithms revisited R Cleve, A Ekert, C Macchiavello, M Mosca Proceedings of the Royal Society of London. Series A: Mathematical, Physical …, 1998 | 1148 | 1998 |

Quantum amplitude amplification and estimation G Brassard, P Hoyer, M Mosca, A Tapp Contemporary Mathematics 305, 53-74, 2002 | 1007 | 2002 |

Quantum lower bounds by polynomials R Beals, H Buhrman, R Cleve, M Mosca, R De Wolf Journal of the ACM (JACM) 48 (4), 778-797, 2001 | 782 | 2001 |

An introduction to quantum computing P Kaye, R Laflamme, M Mosca Oxford University Press on Demand, 2007 | 717 | 2007 |

Implementation of a quantum search algorithm on a quantum computer JA Jones, M Mosca, RH Hansen Nature 393 (6683), 344-346, 1998 | 716 | 1998 |

Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer JA Jones, M Mosca The Journal of chemical physics 109 (5), 1648-1653, 1998 | 550 | 1998 |

A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits M Amy, D Maslov, M Mosca, M Roetteler IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2013 | 305 | 2013 |

How powerful is adiabatic quantum computation? W Van Dam, M Mosca, U Vazirani Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 279-287, 2001 | 251 | 2001 |

Private quantum channels A Ambainis, M Mosca, A Tapp, R De Wolf Proceedings 41st Annual Symposium on Foundations of Computer Science, 547-553, 2000 | 230 | 2000 |

The hidden subgroup problem and eigenvalue estimation on a quantum computer M Mosca, A Ekert NASA International Conference on Quantum Computing and Quantum …, 1998 | 200 | 1998 |

Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates V Kliuchnikov, D Maslov, M Mosca arXiv preprint arXiv:1206.5236, 2012 | 181 | 2012 |

Polynomial-time T-depth optimization of Clifford+ T circuits via matroid partitioning M Amy, D Maslov, M Mosca IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2014 | 160 | 2014 |

Cybersecurity in an era with quantum computers: will we be ready? M Mosca IEEE Security & Privacy 16 (5), 38-41, 2018 | 148 | 2018 |

Finding shortest lattice vectors faster using quantum search T Laarhoven, M Mosca, J Van De Pol Designs, Codes and Cryptography 77 (2), 375-400, 2015 | 131* | 2015 |

Approximate quantum cloning with nuclear magnetic resonance HK Cummins, C Jones, A Furze, NF Soffe, M Mosca, JM Peach, JA Jones Physical review letters 88 (18), 187901, 2002 | 131 | 2002 |

Quantum search on bounded-error inputs P Høyer, M Mosca, R De Wolf International Colloquium on Automata, Languages, and Programming, 291-299, 2003 | 128 | 2003 |

Quantum logic gates and nuclear magnetic resonance pulse sequences JA Jones, RH Hansen, M Mosca Journal of Magnetic Resonance 135 (2), 353-360, 1998 | 123 | 1998 |

Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits V Kliuchnikov, D Maslov, M Mosca Physical review letters 110 (19), 190502, 2013 | 121 | 2013 |

Quantum algorithms M Mosca arXiv preprint arXiv:0808.0369, 2008 | 108 | 2008 |

Quantum computer algorithms M Mosca University of Oxford. 1999., 1999 | 103 | 1999 |