Mosca, Michele

Quantum amplitude amplification and estimation

Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 1,680

Quantum lower bounds by polynomials

Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 639

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

Mosca, M. (2018) · IEEE Security & Privacy

Quantum Information and CryptographyInformation and Cyber Security

Cited by 581

Implementation of a quantum search algorithm on a quantum computer

Jones, J. A., Mosca, M., & Hansen, R. H. (1998) · Nature

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 558

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

Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 549

Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3

Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., & Schanck, J. (2017) · Lecture Notes in Computer Science

Quantum Computing Algorithms and ArchitectureCryptographic Implementations and Security

Cited by 128

Asymptotically Optimal Approximation of Single Qubit Unitaries by Clifford and T Circuits Using a Constant Number of Ancillary Qubits

Kliuchnikov, V., Maslov, D., & Mosca, M. (2013) · Physical Review Letters

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 128

Self-testing of Quantum Circuits

Magniez, F., Mayers, D., Mosca, M., & Ollivier, H. (2006) · Lecture Notes in Computer Science

Quantum Information and CryptographyQuantum Computing Algorithms and Architecture

Cited by 58

An algorithm for the T-count

Gosset, D., Kliuchnikov, V., Mosca, M., & Russo, V. (2013) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 32

Reducing the CNOT count for Clifford+T circuits on NISQ architectures

Gheorghiu, V., Huang, J., Li, S. M., Mosca, M., & Mukhopadhyay, P. (2020) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 31

Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes

Gheorghiu, V., & Mosca, M. (2019) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 28

Improved reversible and quantum circuits for Karatsuba-based integer multiplication

Parent, A., Roetteler, M., & Mosca, M. (2018) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Quantum Computing Algorithms and ArchitectureCryptography and Residue Arithmetic

Cited by 24