Recent Refereed Articles

• [KVM25] A. R. Kalra, D. Valluri, M. Mosca, “Synthesis and Arithmetic of Single Qutrit Circuits”, Quantum, Vol 9,  p.p 1647, February 26, 2025, arXiv: 2311.08696
• [GM25] V. Gheorghiu, M. Mosca, “Quantum resource estimation for large scale quantum algorithms”, Future Generation Computer Systems, p.p. 107480, Vol. 162, January 1, 2025. https://doi.org/10.1016/j.future.2024.107480
• [GDPRPM24] D. Dhruv, L. Dellantonio, A. Di Pilato, W. Redjeb, F. Pantaleo, M. Mosca, “qLUE: A Quantum Clustering Algorithm for Multi-Dimensional Datasets”, Frontiers in Quantum Science and Technology, Vol. 3, p.p. 1462004, October 11, 2024. arXiv:2407.00357
• [KGMGCFD24] A. Kerzner, V. Gheorghiu, M. Mosca, T. Guilbaud, F. Caminati, F. Fracas, L. Dellantonio, “A square root speedup for finding the smallest eigenvalue”, Quantum Science Technology, Vol. 9, number 4, August 12, 2024.  https://iopscience.iop.org/article/10.1088/2058-9565/ad6a36
• [HLYKMV23] J. Huang, S.M. Li, L. Yeh, A. Kissinger, M. Mosca, M. Vasmer, “Graphical CSS Code, Transformation using ZX Calculus”, In Proceedings QPL 2023, EPTCS384, p.p. 1-19, September 1, 2023. arXiv:2307.02437
• [MGHLM23] P. Mukhopadhyay, V. Gheorghiu, J. Huang, S.M. Li, M. Mosca, “Reducing the CNOT count for Cliffford+ T circuits on NISQ architectures”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 42, Issue 6, p.p. 1873-1884, June 2023.  https://arxiv.org/abs/2011.12191
• [GMM22] Gheorghiu, M. Mosca, P. Mukhopadhyay, “T-count and T-depth of any multi-qubit unitary”, npj Quantum Information, Vol. 8, Issue 1, pp 1-10, Nov 30, 2022. arXiv: 2110.10292
• [JMG22] Jena, Genin S, M. Mosca, “Optimization of variational-quantum-eigensolver measurement by partitioning Pauli operators using multiqubit Clifford gates on noisy intermediate-scale quantum hardware”, Physical Review A, Vol. 106, Issue 4, pp 042443, Oct 27, 2022,  arXiv:1907.07859
• [MGHLM22] P. Mukhopadhyay, V. Gheorghiu, J. Huang, S.M. Li, M. Mosca, “Reducing the CNOT count for Cliffford+ T circuits on NISQ architectures”, (IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Oct 10, 2022).  arxiv.org/abs/2011.12191v2
• [GMM22] V. Gheorghiu, M. Mosca, P. Mukhopadhyay, “A quasi-polynomial time heuristic algorithm for synthesizing T-depth optimal circuits”, npj Quantum Information, Vol. 8, Issue 1, pp 1-11, Sep 14, 2022). https://www.nature.com/articles/s41534-022-00624-1
• [MV22] M. Mosca and S. Verschoor, “Factoring semi- primes with (quantum) SAT-solvers”, Scientific Reports, Vol. 12, Issue 1, pp 1-12, May 14, 2022. https://www.nature.com/articles/s41598-022-11687-7
• [MM21] M. Mosca, P. Mukhopadhyay, “A polynomial time and space heuristic algorithm for T-count”, (2021). https://doi.org/10.1088/2058-9565/ac2d3a
• [HPDM21] A. Halcomb, GCCF Pereira, B. Das, M. Mosca, “PQ-Fabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks”, 2021 IEEE International Conference on Blockchain and Cryptocurrency, pp 1-9, https://ieeexplore.ieee.org/abstract/document/9461070
• [MBV20] M. Mosca, JMV. Basso, S. Verschoor, “On speeding up factoring with quantum SAT solvers”, Scientific Reports, Vol. 10, Issue 1, pp 1-8,  https://www.nature.com/articles/s41598-020-71654-y
• [NGM20] B. Nash, V. Gheorghiu and M. Mosca, “Quantum circuit optimizations for NISQ architectures”, (2020). Quantum Science and Technology, Vol. 5, No. 2, IOP Science, https://dx.doi.org/10.1088/2058-9565/ab79b1
• [DGM20] Di Matteo, V. Gheorghiu, M. Mosca, “Fault tolerant resource estimation of quantum random-access memories”, IEEE Transactions on Quantum Engineering, Vol. 1, pp. 1-13, January 17,2020. https://ieeexplore.ieee.org/abstract/document/8962352
• [RKM19] S. Raeisi, M Kieferová and M. Mosca, “Novel Technique for Robust Optimal Algorithmic Cooling”, To appear in Physical Review Letters (accepted on May 9, 2019).  arXiv:1902.04439
• [AM19] M. Amy, M. Mosca, “T-Count Optimization and Reed-Muller codes”, in IEEE Transactions on Information Theory. doi:10.1109/TIT.2019.2906374.
• [AAM18] M. Amy, P. Azimzadeh, M. Mosca, “On the controlled-NOT complexity of controlled-NOT-phase circuits”, IOP Science, Vol. 4, No. 1, (2018). http://iopscience.iop.org/article/10.1088/2058-9565/aad8ca/meta
• [M18] M. Mosca, “Cybersecurity in an era with quantum computers: will we be ready?”, IEEE Security & Privacy, Vol. 16, Issue 5, pp. 38-41, September 2018. (Earlier version at http://eprint.iacr.org/2015/1075)
• [TLLM18] P. Tysowski, X. Ling, N. Lütkenhaus, M. Mosca, “The Engineering of Scalable Multi-Site Communications systems utilizing quantum key distribution (QKD)”, IOP Science, Vol. 3, No. 2, (2018).   http://iopscience.iop.org/article/10.1088/2058-9565/aa9a5d
• [ADGMPS17] M. Amy, O. Di Matteo, V. Gheorghiu, M. Mosca, A. Parent, J. Schanck, “Estimating the Cost of Generic Quantum Pre-Image Attacks on SHA-2 and SHA-3”, selected areas of Cryptography-SAC 2016, 23^rdInternational Conference, St. Johns, NFLD, pp. 317-337 (2017).   https://link.springer.com/chapter/10.1007/978-3-319-69453-5_18
• [MMB17] J. Mulholland, M. Mosca, J. Braun, “The day the cryptography dies”, IEEE Security & Privacy, Vol. 15, issue 4, pp. 14-21 (2017). http://ieeexplore.ieee.org/document/8012311/
• [BBM17] D. J. Bernstein, J-F Biasse, M. Mosca, “A low-resource quantum factoring algorithm”, In Proceedings of The 8^th International Conference on Post- Quantum Cryptography, (PQCrypto2017), Lecture Notes in Computer Science, Vol. 10356, pp. 330-346, Springer, Cham, (2017).
• [ARM17] A. Parent, M. Roetteler, M. Mosca, “Improved reversible and quantum circuits for Karatsuba-base integer multiplication”, (2017). To appear in Proceedings of the 12th Conference on Theory of Quantum Computation, Communication and Cryptography (TQC 2017).   arxiv:1706.03419
• [DM16] O. Di Matteo, M. Mosca, “Parallelizing Quantum Circuit Synthesis”, Quantum Science and Technology, IOP, Vol. 1, Number 1 (2016). arXiv:1606.07413
• [KMM16] V. Kliuchnikov, D. Maslov, and M. Mosca, “Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits”, IEEE Transactions on Computers, Vol. 65, issue 1, pp. 161-172 (2016). arXiv:1212.6964
• [AGJMS15] S. Arunachalam, V. Gheorghiu, T.Jochym-O’Connor, M.Mosca, P. Srinivasan, “On the Robustness of Bucket Brigade Quantum RAM”, to appear in proceedings of 10^th Conf. on Theory of Quantum Computation, Communication & Cryptography(TQC2015).
• [RM15] S. Raeisi, M. Mosca, “Asymptotic Bound for Heat-Bath Algorithmic Cooling”, Physical Review Letter, Vol. 114, issue 10, 100400 (2015).
• [LMP15] T. Laarhoven, M. Mosca, and J. van de Pol, “Finding shortest lattice vectors faster using quantum search”, (Springer) Designs, Codes and Cryptography, Vol. 7932, pp. 83-101 (2015).
• [IM14a] L. Ioannou and M. Mosca, “Public‐key cryptography based on bounded quantum reference”, Theoretical Computer Science, Vol. 560, pp. 33-45 (2014).  arXiv:0903.5156
• [AMM14] M. Amy, D. Maslov, M. Mosca, “Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems). Vol. 33, issue 10, pp. 1476-1489 (2014). arXiv:1303.204
• [GKMR14] D. Gosset, V. Kliuchnikov, M. Mosca, V. Russo, “An algorithm for the T-count”, Quantum Information Computation (QIC). Vol.14 No.15&16, pp 1261-1276 (2014). arXiv: 1308.4134
• [IM14b] L. Ioannou and M. Mosca, ”Unconditionally-secure and reusable public-key authentication”, In Proceedings of 6^th Conf. on Theory of Computation, Communication, and Cryptography, (TQC2011), Lecture Notes in Computer Science, Vol. 6745 pp. 121-142, Springer (2014).
• [AMMR13] M. Amy, D. Maslov, M. Mosca, M. Roetteler, “A meet in the middle algorithm for fast synthesis of depth-optimal quantum circuits”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 32, pp. 818-830 (2013). arXiv:1206.0758
• [KMM13b] V. Kliuchnikov, D. Maslov, and M. Mosca, “Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits”,  Physical Review Letters, 110, 190502 (2013). arXiv:1212.0822
• [LMP13] T. Laarhoven, M. Mosca, J. van de Pol, “Solving the shortest vector problem in lattices faster using quantum search”, In Proceedings of the 5th International Conferences on Post-Quantum Cryptography (PQCrypto 2013), Lecture Notes in Computer Science, Vol. 7932, pp. 83-101, Springer (2013). arXiv:1301.6176
• [MSU13] M. Mosca, D. Stebila, B. Ustaoglu, “Quantum Key Distribution in the Classical Authenticated Key Exchange Framework”, In Proceedings of the 5th International Conference on Post-Quantum Cryptography (PQCrypto 2013), Lecture Notes in Computer Science, Vol. 7932, pp. 136-154, Springer (2013). arXiv:1206.6150
• [KMM13a]  V. Kliuchnikov, D. Maslov, and M. Mosca, “Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates”, Vol. 13, No. 7, pp. 607-630, Quantum Information and Computation. arXiv:1206.5236 

Complete list of Publications

Other Refereed Conference Contributions (without Proceedings)

• [TLLM17] P. Tysowski, X. Ling, N. Lütkenhaus, M. Mosca, “The Engineering of Scalable Multi-Site Communications systems utilizing quantum key distribution (QKD)”, Fifth ETSI-IQC workshop on Quantum-Safe Cryptography, London, UK, (2017).
• [AGJMS15] S. Arunachalam, V. Gheorghiu, T.Jochym-O’Connor, M. Mosca, P. Srinivasan, “On the Robustness of Bucket Brigade Quantum RAM”, 2015 Asian Conference on Quantum Information Science (AQIS’15), Seoul, Korea (2015).

Published Books and Monographs

• [JMNSS22] S. Jeffery, M. Mosca, M. Naya-Plasencia, R. Steinwandt (editors), “Quantum Cryptanalysis”, Dagstuhl Reports, Vol. 11, Issue 9, (2022).
• [GGMM21] V. Gheorghiu, S. Gorbunov, B. Munson, M. Mosca, “Platform Revolution: Blockchain Technology as the Operating System of the Digital Age”, chapter 7, “Quantum-Proofing the Blockchain: Security in the Age of Quantum Supremacy”, Blockchain Research Institute Enterprise Series (2021).
• [MNS20] M. Mosca, M. Naya-Plasencia, R. Steinwandt (editors), “Quantum Cryptanalysis”, Dagstuhl Reports, Vol. 9, Issue 10, March 2020.
• [MRS19] M. Mosca, M. Roetteler, P. Selinger (editors), “Quantum programming languages”, Dagstuhl Reports, Vol. 8, Issue 9, March 25, 2019.
• [MSSS17] M. Mosca, N. Sendrier, R. Steinwandt and K. Svore (editors), “Quantum Cryptanalysis”, Dagstuhl Reports, Vol. 7, Issue 10, October 2017.
• [MRSS16] M. Mosca, M. Roetteler, N. Sendrier and R. Steinwandt (editors), “Quantum Cryptanalysis”, Dagstuhl Reports, Vol. 5, Issue 9 (2016)
• [FMRS14] Fehr, M. Mosca, M. Roetteler and R. Steinwandt (editors), “Quantum Cryptanalysis”, Dagstuhl Reports, Vol. 3, Issue 9 (2014).
• [Mos14]  M. Mosca (editor), “Post‐Quantum Cryptography‐6th International Workshop, PQCrypto 2014″, Lecture Notes in Computer Science, Springer, Vol. 8772 (2014).

Contributions to Collective Work

• [MM19] M.Mosca, B. Munson, “The Quantum Threat to Cyber Security”, pp. 60-63, Governing Cyberspace during a Crisis in Trust (cigionline.org) (2019).

Preprints and Submitted Papers

• [DGKMY25] M. Deaconu, N. Gargava, A.R. Kalra, M.Mosca, J. Yard, “Building for Synthesis with Clifford+R”,  arXiv:2510.11526
• [LRWZ25] SM. Li, M. Mosca, NJ. Ross, J. van de Wetering, Y. Zhao, “A complete and Natural Rule Set for Multi-Qutrit Clifford Circuits”, arXiv:2508.14670
• [KKLM24] D. Kim, M. Kim, S.M. Li, M. Mosca, “Improving the Fidelity of CNOT Circuits on NISQ Hardware”, May 30, 2024. arXiv:2405.19891
• [MPTKGTDNFMMHRPPKMMHCKS24] N. Marks, A. Papageorgopoulos, K. Tsimvrakidis, P. Konteli, Y. Gautier, M. Terenziani, E. Daudin, D. Ntoulias, T. Fragkioidakis, I. Meletios, M. Mosca et. al., “Field Demonstration of a Fully Managed, L1 Encrypted 3-node Network with Hybrid Relayed-QKD and Centralized Symmetric Classical Key Management”, March 13, 2024. arXiv:2403.08526
• [SWMMHZTG24] L. Scholten, C.J. Williams, D. Moody, M. Mosca, W. Hurley, W.J. Zeng, M. Troyer, J.M. Gambetta, “Assessing the Benefits and Risks of Quantum Computers”, arXiv:2401.16317
• [GM19] V. Gheorghiu and M. Mosca, “Quantum Cryptanalysis of symmetric, public-key and hash-based cryptographic schemes.”(2019). arXiv:1902.02332

Other Reports and Articles

• [CDM25] M. Charbonneau, D. Dodson, M. Mosca, “Why Service Providers can lead the way to Cyber Resilience“, The Fast Mode, Nov 14, 2025.
• [LM25] L. Lambert, M. Mosca, “Security Delay is Security Denied”, Opinion, The Hills Time, October 29, 2025.
• [BDM25] C. Blassiau, M. Daniel, M. Mosca, “How engineering security into next-generation computing could enable a bold expansion of cyberspace“, World Economic Forum, October 10, 2025.
• [MM25] M. Mosca, J. Mulholland, “An Updated Methodology for Quantum Risk Assessment”, Global Risk Institute, Sept 5, 2025.
• [DM24] M. Mosca, D. Dodson, “Here why it’s important to build long-term cryptographic resilience”, World Economic Forum, Emerging Technologies, Dec 20, 2024.
• [MP24] M. Piani, M. Mosca, ”Quantum Threat Timeline Research Report 2023”, Quantum Risk Assessment Report, Global Risk Institute, Feb 5, 2024.
• [MP23] M. Piani, M. Mosca,”Quantum Threat Timeline Research Report 2022”, Quantum Risk Assessment Report, Global Risk Institute, April 14, 2024.
• [GM21] V. Gheorghiu, M. Mosca, “A resource estimation framework for quantum attacks against cryptographic functions: recent developments“, Quantum Risk Assessment Report – Final, Global Risk Institute, March 2021.
• [MP21] M. Piani, M. Mosca, “Quantum threat timeline report 2020”, Global Risk Institute, January 27, 2021.
• [PMN21] M. Piani, M. Mosca, B. Neill, “Quantum Random Number Generators”, Practical Considerations and Use Cases, January 2021.
• [MG20] M. Mosca, V. Gheorghiu “A resource estimation framework for quantum attacks against cryptographic functions – recent developments“, Quantum Risk Assessment Report-Part 5, Global Risk Institute, April 30, 2020.
• [MP19] M. Mosca, M. Piani, “Quantum threat timeline”, Global Risk Institute, October 3, 2019.
• [MMO19] Macklem, M. Mosca, and B. O’Higgins, “The quantum threat to cybersecurity: Danger meets opportunity”, Contributed to the Globe and Mail, May 6, 2019.
• [MOM19]  M. Mosca, B. O’Higgins, B. Munson, “The quantum threat to cyber security: Danger and Opportunity”, submitted in support of a presentation to the Standing Committee on Public Safety and National Security regarding Cybersecurity in the Financial Sector as a National Economic Security Issue, February 22, 2019.
• [MG19] M. Mosca, V. Gheorghiu, “A resource estimation framework for quantum attacks against cryptographic functions-Improvements”, Quantum Risk Assessment Report -Part 4, Global Risk Institute, February 19, 2019.
• [MG19]  M. Mosca, V. Gheorghiu, “A resource estimation framework for quantum attacks against cryptographic functions-Improvements”, Quantum Risk Assessment Report -Part 3, Global Risk Institute, January 16, 2019.
• [GGMM17]  V. Gheorghiu, S. Gorbunov, M.Mosca, W. Munson, “Quantum-proofing the Blockchain”, Blockchain Research Institute, Nov 23, 2017
• [MG17] M. Mosca, V. Gheorghiu, “A resource estimation framework for quantum attacks against cryptographic functions”, Global Risk Institute, May 11, 2017.
  http://globalriskinstitute.org/publications/resource-estimation-framework-quantum-attacks-cryptographic-functions/ 
• [MM17] M. Mosca, J. Mulholland, “A methodology for quantum risk assessment”, Global Risk Institute, Jan. 5, 2017. http://globalriskinstitute.org/publications/3423-2/
• [SM16] Douglas Stebila, Michele Mosca, “Post-Quantum Key Exchange for the Internet and the Open Quantum Safe Project”, to appear in selected areas in Cryptography-SAC 2016, 23rd International Conference, St. Johns, NFLD, Canada, 2016, revised selected papers. https://eprint.iacr.org/2016/1017
• [Mos16] M. Mosca, “A quantum of prevention for our cyber-security” Global Risk Institute, September 5, 2016. http://globalriskinstitute.org/publications/quantum-computing-cybersecurity/
• [Mos15] M. Mosca, “Cybersecurity in an era with quantum computers: will we be ready?”, abstract for Invited Talk at the 5^th International Conference on Quantum Cryptography, QCRYPT 2015, Tokyo, Japan, Oct 2, 2015. http://eprint.iacr.org/2015/1075
• [MLP15] M.Mosca, G. Lenhart, M. Pecen (editors), e-proceedings of “2nd Quantum-Safe-Crypto Workshop”, Ottawa, Oct. 6-7, 2014. http://www.etsi.org/images/files/Events/2014/201410_Crypto/e-proceedings-QSC-14.pdf
• [MLP13] M.Mosca, G. Lenhart, M. Pecen (editors), e-proceedings of “1st Quantum-Safe-CryptoWorkshop”, Sophia Antipolis, Sep 26-27, 2013.  http://docbox.etsi.org/Workshop/2013/201309_CRYPTO/e-proceedings_Crypto_2013.pdf
• [M13] M. Mosca, “Setting the Scene for the ETSI Quantum-Safe Cryptography Workshop”, e-proceedings of 1st Quantum-Safe-Crypto Workshop”, Sophia Antipolis, France, pp. 25-28, 2013.  https://docbox.etsi.org/Workshop/2013/201309_CRYPTO/e-proceedings_Crypto_2013.pdf
• [FMRS11] S.Fehr, M. Mosca, M. Rötteler and R. Steinwandt “Quantum Cryptanalysis”, Dagstuhl Reports, Vol. 1, Issue 9 (2011).

Theses

• [Mos99] M. Mosca,”Quantum Computer Algorithms”, Oxford D.Phil. thesis, 1999. [pdf]
• [Mos96] M. Mosca, “Discrete Logarithms in Finite Fields”, Oxford M.Sc. dissertation, 1996. [pdf]