2026 Michele Mosca: Engineering and Technology Researcher – H-Index, Publications & Awards

D-Index & Metrics

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Engineering and Technology	49	4215	4051	177	169	121	14922

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Engineering and Technology

4215

4051

177

169

121

14922

Engineering and Technology

D-Index

Citations

14922

World Ranking

4215

National Ranking

177

Overview

Michele Mosca is affiliated with the University of Waterloo in Canada and works primarily in the field of Computer Science. Their research focuses extensively on Quantum Computing Algorithms and Architecture, as well as related topics within quantum information and cryptography.

Their work spans several subfields of study, including:

Artificial Intelligence
Computational Theory and Mathematics
Electrical and Electronic Engineering
Atomic and Molecular Physics, and Optics
Hardware and Architecture

Mosca has contributed significantly to research on quantum computing and related computational methods. Their topics of work prominently include:

Quantum Computing Algorithms and Architecture
Quantum-Dot Cellular Automata
Quantum Information and Cryptography
Low-power high-performance VLSI design
Cryptography and Data Security
Parallel Computing and Optimization Techniques
Blockchain Technology Applications and Security

Their publication record features papers in leading venues, with frequent contributions appearing in:

arXiv (Cornell University)
npj Quantum Information
Scientific Reports
Quantum Science and Technology
Electronic Proceedings in Theoretical Computer Science

Recent publications by Michele Mosca include:

"T-count and T-depth of any multi-qubit unitary", 2022, npj Quantum Information
"Reducing the CNOT Count for Clifford+T Circuits on NISQ Architectures", 2022, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
"A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits", 2022, npj Quantum Information
"Assessing the Benefits and Risks of Quantum Computers", 2024, arXiv (Cornell University)
"Factoring semi-primes with (quantum) SAT-solvers", 2022, Scientific Reports

Mosca has collaborated frequently with other researchers including Vlad Gheorghiu, Priyanka Mukhopadhyay, Sarah Meng Li, Jiaxin Huang, and Luca Dellantonio.

Best Publications

Quantum Amplitude Amplification and Estimation

Gilles Brassard;Peter Hoyer;Michele Mosca;Alain Tapp

2106
Citations
QUANTUM ALGORITHMS REVISITED

Richard Cleve;Artur Ekert;Chiara Macchiavello;Michele Mosca

1582
Citations
An introduction to quantum computing

Phillip Kaye;Raymond Laflamme;Michele Mosca

983
Citations
Quantum lower bounds by polynomials

Robert Beals;Harry Buhrman;Richard Cleve;Michele Mosca

877
Citations
Implementation of a quantum search algorithm on a quantum computer

Jonathan A. Jones;Michele Mosca;Rasmus H. Hansen

805
Citations
Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer

J. A. Jones;M. Mosca

592
Citations
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits

M. Amy;D. Maslov;M. Mosca;M. Roetteler

579
Citations
Cybersecurity in an Era with Quantum Computers: Will We Be Ready?

Michele Mosca

455
Citations
Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer

J. A. Jones;M. Mosca;R. H. Hansen

407
Citations
How powerful is adiabatic quantum computation

W. van Dam;M. Mosca;U. Vazirani

387
Citations
Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer

J. A. Jones;M. Mosca

327
Citations
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning

Matthew Amy;Dmitri Maslov;Michele Mosca

303
Citations
Private quantum channels

A. Ambainis;M. Mosca;A. Tapp;R. De Wolf

300
Citations
Quantum lower bounds by polynomials

R. Beals;H. Buhrman;R. Cleve;M. Mosca

261
Citations
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates

Vadym Kliuchnikov;Dmitri Maslov;Michele Mosca

253
Citations
On the Robustness of Bucket Brigade Quantum RAM

Srinivasan Arunachalam;Vlad Gheorghiu;Tomas Jochym-O'Connor;Michele Mosca

214
Citations
Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project

Douglas Stebila;Michele Mosca;Michele Mosca;Michele Mosca

201
Citations
The hidden subgroup problem and eigenvalue estimation on a quantum computer

M. Mosca;A. Ekert

197
Citations
Quantum circuit optimizations for NISQ architectures

Beatrice Nash;Beatrice Nash;Beatrice Nash;Vlad Gheorghiu;Michele Mosca

194
Citations
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits.

Vadym Kliuchnikov;Dmitri Maslov;Michele Mosca

160
Citations
Approximate quantum cloning with nuclear magnetic resonance.

Holly K. Cummins;Claire Jones;Alistair Furze;Nicholas F. Soffe

147
Citations
Quantum search on bounded-error inputs

Peter Høyer;Michele Mosca;Ronald De Wolf

146
Citations
How Powerful is Adiabatic Quantum Computation

Wim van Dam;Michele Mosca;Umesh Vazirani

139
Citations