Recent Refereed Articles

  • [MM21] M. Mosca, P. Mukhopadhyay, “A polynomial time and space heuristic algorithm for T-count”, (2021).
  • [MBV20] M. Mosca, JMV. Basso, S. Verschoor, “On speeding up factoring with quantum SAT solvers”, Scientific Reports, Vol. 10, Issue 1, pp 1-8,
  • [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,
  • [DGM20] O. 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.
  • [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).
  • [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
  • [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).
  • [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, 23rdInternational Conference, St. Johns, NFLD, pp. 317-337 (2017).
  • [MMB17] J. Mulholland, M. Mosca, J. Braun, “The day the cryptography dies”, IEEE Security & Privacy, Vol. 15, issue 4, pp. 14-21 (2017).
  • [BBM17] D. J. Bernstein, J-F Biasse, M. Mosca, “A low-resource quantum factoring algorithm”, In Proceedings of The 8th 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 10th 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 6th 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).
  • [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).
  • [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

  • [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).
  • [MM19] M. Mosca, B. Munson, “The Quantum Threat to Cyber Security”, pp. 60-63, CIGI Press, (2019).

Preprints and Submitted Papers

  • [GMM21] Gheorghiu, M. Mosca, P. Mukhopadhyay, “T-count and T-depth of any multi-qubit unitary”, (2021), arXiv: 2110.10292
  • [GMM21] Gheorghiu, M. Mosca, P. Mukhopadhyay, “A quasi-polynomial time heuristic algorithm for synthesizing T-depth optimal circuits”, (2021), arXiv: 2101.03142
  • [GLMM20] Gheorghiu, SM. Li, M. Mosca, P. Mukhopadhyay, “Reducing the CNOT count for Clifford+ T circuits on NISQ”, (2020), arXiv:2011.12191
  • [DHMP20] Das, A. Halcomb, M. Mosca, GCCF Pereira, “PQ-Fabric: A Permissioned Blockchain Secure from Both Classical and Quantum Attacks”, (2020), arXiv:2010.06571
  • [MBV19] M. Mosca, J. Basso, S. Verschoor, “On speeding up factoring with quantum SAT solvers”, (2019).  arXiv:1910.09592
  • [JMG19] A. Jena, Genin S, M. Mosca, “Pauli Partitioning with Respect to Gate Sets”, (2019). arXiv:1907.07859
  • [NGM19] B. Nash,V. Gheorghiu and M. Mosca, “Quantum circuit optimizations for NISQ architectures”, (2019). arXiv:1904.01972
  • [GM19] V. Gheorghiu and M. Mosca, “Quantum Cryptanalysis of symmetric, public-key and hash-based cryptographic schemes.”(2019). arXiv:1902.02332
  • [MV19] M. Mosca and S. Verschoor, “ Factoring semi- primes with (quantum) SAT-solvers”, (2019) arXiv:1902.01448

Other Reports and Articles


  • [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]