Complete List of Publications

Referred Publications

  • [IM12] L. Ioannou, M. Mosca, “A new spin on Quantum Cryptography: Avoiding trapdoors and embracing public keys”,  In Proceedings of the Fourth International Conference on Post-Quantum Cryptography (PQCrypto 2011), Lecture Notes in Computer Science, Vol. 7071, pp. 255-274, Springer, 2011. arXiv:1109.3235
  • [MM11] M. McKague and M. Mosca, “Generalized self-testing and the security of the 6-state protocol”, In Proceedings of 5th Conf. on Theory of Quantum Computation, Communication & Cryptography (TQC2010), Lecture Notes in Computer Science, Vol. 6519, pp. 113-130, Springer, 2011. arXiv:1006.0150
  • [IM10] L. Ioannou and M. Mosca, “Universal quantum computation in a hidden basis”, Quantum Information and Computation, Vol. 10 No. 7 & 8 July 1, 2010, pp. 541-561. arXiv:0810.2780v3
  • [MS10] M. Mosca, D. Stebila, “Quantum Coins”, Error-Correcting Codes, Finite Geometry and Cryptography, Contemporary Mathematics, Vol. 523, pp. 35-47. American Mathematical Society, 2010. arXiv:0911.1295v1
  • [WMN10] T. Wei, M. Mosca, A. Nayak, “Interacting boson problems are QMA-hard”, Phys. Rev. Lett. 104, 040501, 2010. arXiv:0905.3413v1
  • [SML10] D. Stebila, M. Mosca, N. Lutkenhaus, “The Case for Quantum Key Distribution”, Proceedings of QuantumComm 2009 Workshop on Quantum and Classical Information Security, Lecture Notes of the Institute for Computer Science, Social Informatics and Telecommunications Engineering, Vol. 36, pp. 283-296, Springer, 2010. arXiv:0902.2839v2
  • [SMM09] L. Sheridan, D. Maslov, M. Mosca, “Approximating Fractional Time Quantum Evolution”, Journal of Physics A: Math. Theor. 42, 185302, 2009. arXiv:0810.3843v2
  • [CGMSY09] R. Cleve, D. Gottesman, M. Mosca, R. Somma, D. Yonge-Mallo, “Efficient Discrete-Time Simulations on Continuous-Time Quantum Query Algorithms”, Proceedings of 41st Annual ACM Symposium on Theory of Computing (STOC’09), Bethesda, USA, 2009. arXiv:0811.4428v1
  • [MMG09] M. McKague, M. Mosca, N. Gisin, “Simulating Quantum Systems Using Real Hilbert Spaces”, Phys. Rev. Lett. 102(2), 020505, 2009. arXiv:0810.1923v1
  • [IM08] L. Ioannou, M. Mosca, “Limitations of some simple adiabatic quantum algorithms”, International Journal of Quantum Information, Vol. 6, Issue 3, pp. 419-426, 2008. arXiv:quant-ph/0702241v2
  • [MFM08] D. Maslov, S. M. Falconer, M. Mosca, “Quantum Circuit Placement”, IEEE Transactions on CAD of Integrated Circuits and Systems, Vol. 27(4), pp. 752-763, April 2008. arXiv:quant-ph/0703256v2
  • [MFM07]  D. Maslov, S. M. Falconer, and M. Mosca, “Quantum Circuit Placement: Optimizing  Qubit- to-qubit Interactions through Mapping Quantum  Circuits into a Physical Experiment”. Proceedings of ACM/IEEE Design Automation Conference (DAC), San Diego, CA (2007).
  • [DMMS07] W. van Dam, F. Magniez, M. Mosca, M. Santha, “Self-testing of universal and fault-tolerant sets of quantum gates”, SIAM Journal on Computing, Vol. 37, 611-629, 2007. arXiv:quant-ph/9904108v2
  • [DDEMM07b] G. M. D’Ariano, W. van Dam, E. Ekert, C. Macchiavello, M. Mosca, “Optimal phase estimation in quantum networks”, J. Phys. A:Math. Theor. 40, 7971-7984, 2007. arXiv:0706.4412v2
  • [DDEMM07a] G. M. D’Ariano, W. van Dam, E. Ekert, C. Macchiavello, M. Mosca, “General optimized schemes for phase estimation”, Physical review Letters, Vol. 98(9), 090501, 2007.
  • [PMCC06] C. Perez, M. Mosca, P. Cappellaro, D. Cory, “Single spin measurement using cellular automata techniques”, Physical Review Letters, 97, 100501 (2006).
  • [MMMO06] Frederic Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier, “Self-Testing of Quantum Circuits”, Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP’06), Venice, Italy (2006).
  • [MZ04] M. Mosca and C. Zalka, “Exact quantum Fourier transforms and discrete logarithm”, International Journal of Quantum Information, Vol. 2, No. 1 (2004) pp. 91-100.
  • [HMW03] P. Høyer, M. Mosca, R. de Wolf, “Quantum Search on Bounded-Error Inputs”, Proceedings of the Thirtieth International Colloquium on Automata, Languages and Programming (ICALP’03), Eindhoven, The Netherlands (2003), pp. 291-299.
  • [CJFSMPJ02] H. Cummins, C. Jones, A. Furze, N. Soffe, M. Mosca, J. Peach, and J. Jones, “Approximate Quantum Cloning with Nuclear Magnetic Resonance”, Physical Review Letters 88 (2002), 187901.
  • [BHMT02] G. Brassard, P. Høyer, M. Mosca and A. Tapp, “Quantum Amplitude Amplification and Estimation”, in AMS Contemporary Mathematics Series Millennium Vol. entitled “Quantum Computation & Information”, 305, (2002).
  • [KM02] P. Kaye and M. Mosca, “Quantum networks for generating arbitrary quantum states,” in Proceedings of the International Conference on Quantum Information, OSA CD-ROM (Optical Society of America, Washington, D.C., 2002), PB28.
  • [DMV01] W. van Dam, M. Mosca and U. Vazirani, “How Powerful is Adiabatic Quantum Computation”, in Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS ’01), Las Vegas, USA, (2001), pp. 279-287.
  • [CM01] K. Cheung and M. Mosca, “Decomposing Finite Abelian Groups”, Vol. 1, No.2, Quantum Information and Computation (2001), pp. 26-32.
  • [KM01a] P. Kaye and M. Mosca, “Quantum Networks for Concentrating Entanglement”, Journal of Physics A: Mathematical and General, Special Issue on Quantum Computation and Information, 34, (2001), pp. 6939-6948.
  • [BBCMW01]] R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, “Quantum lower bounds by polynomials”, Journal of the ACM (2001), Vol. 48, No. 4, pp. 778-797.
  • [Mos01] M. Mosca, “Counting by quantum eigenvalue estimation”, Theoretical Computer Science, 26 (2001), pp. 139-153.
  • [MJSE00] M. Mosca, R. Jozsa, A. Steane and A. Ekert, “Quantum enhanced information processing”, Philosophical Transactions of the Royal Society A, Special Millennium Issue, Part II, (2000), pp. 261-280.
  • [AMTW00] A. Ambainis, M. Mosca, A. Tapp and R. de Wolf, “Private quantum channels”, Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS ’00), Redondo Beach, USA, (2000), pp. 547-553.
  • [DMMS00] W. van Dam, F. Magniez, M. Mosca and M. Santha, “Self-testing of sets of universal and fault-tolerant quantum gates”, Proceedings of 32nd Annual ACM Symposium on Theory of Computing (STOC’00), Portland, USA (2000), pp. 668-696.
  • [JM99] J. Jones and M. Mosca, “Approximate quantum counting on an NMR ensemble quantum computer”, Physical Review Letters, 83 (1999), pp. 1050-1053.
  • [ME99] M. Mosca and A. Ekert, “The hidden subgroup problem and eigenvalue estimation on a quantum computer”, Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communication, Palm Springs, USA, Lecture Notes in Computer Science 1509 (1999), pp. 174-188.
  • [JMH98a] J. Jones, M. Mosca and R. H. Hansen, “Implementation of a quantum search algorithm on a quantum computer”, Nature, 393 (1998), pp. 344-346.
  • [JM98] J. Jones and M. Mosca, “Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer”, Journal of Chemical Physics, 109 (1998), pp. 1648-1653.
  • [JHM98b] J. Jones, R. Hansen and M. Mosca, “Quantum logic gates and nuclear magnetic resonance pulse sequences”, Journal of Magnetic Resonance, 135 (1998), pp. 353-360.
  • [CEHMM98] R. Cleve, A. Ekert, L. Henderson, C. Macchiavello and M. Mosca, “On quantum algorithms”, Complexity, 4 (1998), pp. 33-42.
  • [CEMM98] R. Cleve, A. Ekert, C. Macchiavello and M. Mosca, “Quantum algorithms revisited”, Proceedings of the Royal Society of London A, 454 (1998), pp. 339-354.
  • [BBCMW98] R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, “Quantum lower bounds by polynomials”, Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS ’98), Palo Alto, USA, (1998) pp. 352-361.
  • [Mos98b] M. Mosca, “Quantum searching and counting by eigenvector analysis”, Proceedings of Randomized Algorithms, Workshop of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS’98), Brno, Czech Republic, (1998).
  • [Mos98a] M. Mosca, “Removing edges can increase the average number of colours in a graph colouring”, Combinatorics, Probability and Computing, 7 (1998), pp. 211-216.

Other Refereed Conference Contributions (without Proceedings)

  • [MSU12] M.Mosca, D. Stebila, B. Ustaoglu, “Quantum Key Distribution in the Classical Authenticated Key Exchange Framework”, 2nd Annual Conference on Quantum Cryptography (QCRYPT’12), Singapore (2012).
  • [CGMSY09] R. Cleve, D. Gottesman, M. Mosca, R. Somma, and D. Yonge-Mallo, “Efficient Discrete-Time Simulations of Continuous-Time Quantum Query Algorithms”, 2009 Quantum Information Processing workshop (QIP 2009), Santa Fe, USA (2009).
  • [IM08b] L. Ioannou, M. Mosca, “Superposing the known and unknown”, 2008 Asian Conference on Quantum Information Science (AQIS 2008), Seoul, Korea, 2008.
  • [MM07] M. McKague, M. Mosca, “Simulating Quantum Circuits using Real Valued Unitaries”, 2007 Asian Conference on Quantum Information Science (AQIS 2007), Kyoto, Japan 2007.
  • [MFM07b] D. Maslov, S. M. Falconer, M. Mosca, “Quantum Circuit Placement”. Asian Conference on Quantum Information Science (AQIS 2007), Kyoto, Japan, 2007.
  • [PCMCC06] C. Perez, D. Cheung, M. Mosca, P. Cappellaro, D. Cory, “Quantum Cellular Automata and Single Spin Measurement”, 2006 Asian Conference on Quantum Information Science (AQIS 2007), Beijing, China, 2006.
  • [MMMO06b] F. Magniez, D. Mayers, M. Mosca, H. Ollivier, “Self-Testing of Quantum Circuits”, 9th Workshop on Quantum Information Processing (QIP 2006), Paris, France, 2006.
  • [MZ03] M. Mosca, C. Zalka, “Exact quantum Fourier transforms and discrete logarithm algorithms”, 2003 ERATO Conference on Quantum Information Science (EQIS 2003), Kyoto, Japan, 2003.

Published Books and Monographs

  • [CM09] A. Childs, M. Mosca (editors), Revised selected papers of “4th Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2009)”, Lecture Notes in Computer Science, Springer, Vol. 5906, (2009).
  • [KM08] Y. Kawano, M. Mosca (editors), Revised selected papers of “3rd Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2008)”, Lecture notes in Computer Science, Springer, Vol. 5106, (2008).
  • [KLM07] P. Kaye, R. Laflamme, M. Mosca, “An Introduction to Quantum Computing”, Oxford University Press, (ISBN: 0198570007), 2007.
  • [MT02] M. Mosca, A. Tapp (editors), “Special Issue on Quantum Computation and Cryptography”, Algorithmica, Vol. 34, Number 4, (2002).

Contributions to  Collective Work

  • [SM12] J. Smith, M. Mosca, “Algorithms for Quantum Computers”, Handbook of Natural Computing, Springer). arXiv:1001.0767
  • [Mos09] M. Mosca, “Quantum Algorithms”, Encyclopedia of Complexity Systems Science (ed.: Robert Meyers), 2009.arXiv:0808.0369v1
  • [Mos08] M. Mosca, “Abelian hidden subgroup problem”, Encyclopedia of Algorithms (ed.: Ming-Yang Kao), Springer, 2008.
  • [Mos06] M. Mosca, “Quantum Algorithms and Complexity”, Proceedings of NATO ASI Quantum Computation and Information 2005, Chine, Crete, Greece, IOS Press, 2006.
  • [M02] M. Mosca, “The Promise of Quantum Computing”, Innovation: Essays by Leading Canadian Researchers (eds: J. Downey and L. Claxton), Key-Porter Books, (2002).