Michele Mosca | Academic Influence

Michele Mosca's AcademicInfluence.com Rankings

Michele Mosca

Computer Science

#905

World Rank

#938

Historical Rank

computer-science Degrees

Michele Mosca

Mathematics

#1972

World Rank

#3122

Historical Rank

Measure Theory

#3013

World Rank

#3580

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Michele Mosca's Degrees

PhD Mathematics University of Oxford
Bachelors Mathematics University of Calgary

Similar Degrees You Can Earn

Best Online Bachelor's in Math Ranked

Why Is Michele Mosca Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Michele Mosca is co-founder and deputy director of the Institute for Quantum Computing at the University of Waterloo, researcher and founding member of the Perimeter Institute for Theoretical Physics, and professor of mathematics in the department of Combinatorics & Optimization at the University of Waterloo. He has held a Tier 2 Canada Research Chair in Quantum Computation since January 2002, and has been a scholar for the Canadian Institute for Advanced Research since September 2003. Mosca's principal research interests concern the design of quantum algorithms, but he is also known for his early work on NMR quantum computation together with Jonathan A. Jones.

(See a Problem?)

Michele Mosca's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Quantum Amplitude Amplification and Estimation (2000) (1345)
Quantum algorithms revisited (1997) (1010)
Quantum lower bounds by polynomials (1998) (765)
An Introduction to Quantum Computing (2006) (641)
Implementation of a quantum search algorithm on a quantum computer (1998) (436)
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits (2012) (382)
Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer (1998) (327)
How powerful is adiabatic quantum computation? (2001) (285)
Private quantum channels (2000) (239)
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning (2013) (201)
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer (1998) (189)
Cybersecurity in an Era with Quantum Computers: Will We Be Ready? (2017) (176)
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates (2012) (172)
Quantum Search on Bounded-Error Inputs (2003) (119)
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits (2012) (117)
On the robustness of bucket brigade quantum RAM (2015) (111)
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3 (2016) (102)
An algorithm for the T-count (2013) (99)
Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project (2016) (98)
Finding shortest lattice vectors faster using quantum search (2015) (97)
Quantum Circuit Placement (2007) (94)
Quantum Computer Algorithms (2003) (88)
Approximate quantum cloning with nuclear magnetic resonance. (2001) (86)
Quantum circuit optimizations for NISQ architectures (2019) (80)
Quantum Networks for Generating Arbitrary Quantum States (2001) (75)
Quantum logic gates and nuclear magnetic resonance pulse sequences. (1998) (73)
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits (2012) (70)
Decomposing finite Abelian groups (2001) (69)
Self-testing of Quantum Circuits (2005) (67)
Pauli Partitioning with Respect to Gate Sets. (2019) (66)
Exact quantum Fourier transforms and discrete logarithm algorithms (2003) (64)
Optimal quantum circuits for general phase estimation. (2006) (62)
Simulating quantum systems using real Hilbert spaces. (2008) (57)
The Case for Quantum Key Distribution (2009) (56)
On the controlled-NOT complexity of controlled-NOT–phase circuits (2018) (55)
APPROXIMATE QUANTUM COUNTING ON AN NMR ENSEMBLE QUANTUM COMPUTER (1998) (54)
Quantum Searching Counting and Amplitude Ampli cation by Eigenvector Analysis (1998) (53)
T-Count Optimization and Reed–Muller Codes (2016) (50)
Quantum Coins (2009) (50)
Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer (1998) (49)
Generalized Self-testing and the Security of the 6-State Protocol (2010) (47)
Interacting boson problems can be QMA hard. (2009) (44)
Fault-Tolerant Resource Estimation of Quantum Random-Access Memories (2019) (43)
Efficient discrete-time simulations of continuous-time quantum query algorithms (2008) (41)
Quantum Key Distribution in the Classical Authenticated Key Exchange Framework (2012) (37)
Private Quantum Channels and the Cost of Randomizing Quantum Information (2000) (36)
Parallelizing quantum circuit synthesis (2016) (34)
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search (2013) (34)
Counting by quantum eigenvalue estimation (2001) (32)
Single spin measurement using cellular automata techniques. (2006) (30)
Asymptotic bound for heat-bath algorithmic cooling. (2014) (29)
On quantum algorithms (1998) (28)
Self-testing of universal and fault-tolerant sets of quantum gates (1999) (28)
Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment (2007) (25)
The engineering of a scalable multi-site communications system utilizing quantum key distribution (QKD) (2017) (25)
Approximating fractional time quantum evolution (2008) (22)
Quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes (2019) (21)
Improved reversible and quantum circuits for Karatsuba-based integer multiplication (2017) (21)
Post-quantum cryptography : 6th International Workshop, PQCrypto 2014 Waterloo, ON, Canada, October 1-3, 2014 : proceedings (2014) (20)
Reducing the CNOT count for Clifford+T circuits on NISQ architectures (2020) (20)
Algorithms for Quantum Computers (2010) (19)
Public-key cryptography based on bounded quantum reference frames (2009) (18)
The Day the Cryptography Dies (2017) (18)
A polynomial time and space heuristic algorithm for T-count (2020) (17)
Quantum networks for concentrating entanglement (2001) (16)
Quantum–enhanced information processing (2000) (14)
A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys (2011) (14)
On the CNOT-complexity of CNOT-PHASE circuits (2017) (14)
A Low-Resource Quantum Factoring Algorithm (2017) (13)
Postquantum Cryptography - State of the Art (2017) (12)
Novel Technique for Robust Optimal Algorithmic Cooling. (2019) (10)
Quantum Programming Languages (Dagstuhl Seminar 18381) (2018) (10)
T-count and T-depth of any multi-qubit unitary (2021) (10)
Post-Quantum Cryptography (2014) (10)
Unconditionally-Secure and Reusable Public-Key Authentication (2011) (8)
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits (2021) (8)
Limitations of some simple adiabatic quantum algorithms (2007) (8)
Optimal phase estimation in quantum networks (2007) (8)
Factoring semi-primes with (quantum) SAT-solvers (2019) (7)
Postquantum Cryptography, Part 2 (2018) (5)
Abelian Hidden Subgroup Problem (2008) (5)
A Resource Estimation Framework For Quantum Attacks Against Cryptographic Functions: Recent Developments (2020) (5)
PQFabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks (2020) (4)
Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph (1998) (4)
Finding shortest lattice vectors faster using quantum search (2015) (4)
On speeding up factoring with quantum SAT solvers (2019) (4)
34 13 v 1 [ qu an tph ] 2 0 M ay 2 00 9 Interacting boson problems are QMA-hard (2009) (3)
Universal quantum computation in a hidden basis (2008) (3)
Post-Quantum Cryptography - PQC 2013 (2013) (2)
00 05 05 5 v 1 1 5 M ay 2 00 0 Quantum Amplitude Amplification and Estimation Gilles Brassard (2014) (1)
Self-Testing of One-Qubit Gates (1999) (1)
Quantum Cryptanalysis (Dagstuhl Seminar 17401) (2017) (1)
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits (2022) (1)
Optimization of variational-quantum-eigensolver measurement by partitioning Pauli operators using multiqubit Clifford gates on noisy intermediate-scale quantum hardware (2022) (1)
A resource estimation framework for quantum attacks against cryptographic functions-final report (2018) (1)
Quantum Random-Number Generators: Practical Considerations and Use Cases (2021) (1)
Quantum Computing, Cryptography and Compilers (2012) (1)
Asymptotically optimal approximation of the single qubit unitaries by Clifford+T circuits using at most three ancillary qubits (2012) (1)
A resource estimation framework for quantum attacks against cryptographic functions GRI quantum risk assessment report (2017) (0)
Report on Resource Requirements Research on the Quantum Threat Timeline (2017) (0)
Quantum Key Distribution in the Classical Authenticated Key Exchange Framework (extended abstract) (2012) (0)
Pauli Partitioning: in Theory and in Practice (2019) (0)
Progress Towards Quantum Processors and Quantum Interfaces : Why Experimentalists Start Listening to Computer Science (2016) (0)
1 8 A ug 1 99 7 Quantum Algorithms Revisited (2008) (0)
The Engineering of a Scalable Multi-Site Communications System Utilizing QKD (2017) (0)
Quantum Cryptanalysis (Dagstuhl Seminar 11381) (2011) (0)
qu an tph / 9 70 80 16 8 A ug 1 99 7 Quantum Algorithms Revisited (1998) (0)
1 2 J an 2 00 1 Quantum Networks for Concentrating Entanglement (2008) (0)
Quantum Cryptanalysis (Dagstuhl Seminar 19421) (2019) (0)
Quantum Cryptanalysis (Dagstuhl Seminar 21421) (2021) (0)
Ju l 2 00 4 Quantum Networks for Generating Arbitrary Quantum States (2002) (0)
Quantum Error Correction (2006) (0)
Theory of Quantum Computation, Communication, and Cryptography, 4th Workshop, TQC 2009, Waterloo, Canada, May 11-13, 2009, Revised Selected Papers (2009) (0)
Quantum Computational Complexity Theory and Lower Bounds (2006) (0)
Book review (2007) (0)
Ja n 20 06 Single Spin Measurement Using Cellular Automata Techniques (2006) (0)
Quantum Cryptanalysis (Dagstuhl Seminar 13371) (2013) (0)
CORR 2001-04 quantum Networks for Concentrating Entanglement (2001) (0)
Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography (2009) (0)
Quantum Cryptanalysis (Dagstuhl Seminar 15371) (2015) (0)

This paper list is powered by the following services:

Other Resources About Michele Mosca

en.wikipedia.org

What Schools Are Affiliated With Michele Mosca?

Michele Mosca is affiliated with the following schools: