Refereed research papers
• [IM08a] L. M. Ioannou, and M. Mosca, “ Limitations of some simple adiabatic quantum algorithms” To appear in the International Journal of Quantum Information, quant-ph/0702241
• [MFM08] D. Maslov, S. M. Falconer, and M. Mosca. Quantum Circuit Placement. IEEE Transactions on CAD, vol. 27(4), pp. 752-763, (2008).
• [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 and M. Santha, “Self-testing of universal and fault-tolerant sets of quantum gates“, SIAM Journal on Computing, Vol. 37, No. 2, 611-629 (2007).
• [DDEMM07] G. M. D'Ariano, W. van Dam, E. Ekert, C. Macchiavello, and M. Mosca, “Optimal phase estimation in quantum networks“, Journal of Physics A: Math. Theor. 40 (2007) 7971-7984.
• [DDEMM06] G. M. D'Ariano, W. van Dam, E. Ekert, C. Macchiavello, and M. Mosca,“General optimized schemes for phase estimation“. Physical Review Letters, Volume 98, Number 9, Article 090501 (2007).
• [PMCC06] C. Perez, M. Mosca, P. Cappellaro, D. Cory, “Single spin measurement using cellular automata techniques”, Physical Review Letters, Volume 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 algorithms”, International Journal of Quantum Information, Vol. 2, No. 1 (2004) 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), 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. quant-ph/0111098
• [BHMT02] G. Brassard, P. Høyer, M. Mosca and A. Tapp, “Quantum Amplitude Amplification and Estimation”, in AMS Contemporary Mathematics Series Millennium Volume 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), 279-287.
• [CM01] K. Cheung and M. Mosca, “Decomposing Finite Abelian Groups”, Vol. 1, No.2, Quantum Information and Computation (2001), 26-32.
• [KM01] 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), 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, 778-797.
• [Mos01] M. Mosca, "Counting by quantum eigenvalue estimation", Theoretical Computer Science, 26 (2001), 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), 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), 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), 668-696.
• [JM99] J. Jones and M. Mosca, "Approximate quantum counting on an NMR ensemble quantum computer", Physical Review Letters, 83 (1999), 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), 174-188.
• [JMH98] J. Jones, M. Mosca and R. H. Hansen, "Implementation of a quantum search algorithm on a quantum computer", Nature, 393 (1998), 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), 1648-1653.
• [JHM98] J. Jones, R. Hansen and M. Mosca, "Quantum logic gates and nuclear magnetic resonance pulse sequences", Journal of Magnetic Resonance, 135 (1998), 353-360.
• [CEHMM98] R. Cleve, A. Ekert, L. Henderson, C. Macchiavello and M. Mosca, "On quantum algorithms", Complexity, 4 (1998), 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), 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) 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), 211-216.
Other refereed conference talks
• [IM08b] L. Ioannou, M. Mosca, "Superposing the known and unknown", to appear at the 2008 Asian Conference on Quantum Information Science (AQIS'08), Seoul, Korea (2008).
• [MM07] M. McKague and M. Mosca, "Simulating Quantum Circuits using Real Valued Unitaries", 2007 Asian Conference on Quantum Information Science (AQIS'07), Kyoto, Japan (2007).
• [MFM07b] D. Maslov, S. M. Falconer, and M. Mosca. Quantum Circuit Placement. Asian Conference on Quantum Information Science (AQIS'07), 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'07), Beijing, China (2006).
• [MMMO06b] F. Magniez, D. Mayers, M. Mosca, H. Ollivier, "Self-Testing of Quantum Circuits", 9th Workshop on Quantum Information Processing (QIP'06), Paris, France (2006).
• [MZ03] M. Mosca and C. Zalka, “Exact quantum Fourier transforms and discrete logarithm algorithms”, Proceedings of the 2003 ERATO Conference on Quantum Information Science (EQIS’03), Kyoto, Japan, (2003).
Published Books and Monographs
• [KM08] Y. Kawano, M. Mosca (editors), "Proceedings of the 3rd Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2008)", Lecture Notes in Computer Science, Springer, Volume 5106, to appear in 2008.
• [KLM06] P. Kaye, R. Laflamme, M. Mosca, “An Introduction to Quantum Computation”, Oxford University Press, to appear (ISBN: 0198570007).
• [MT02] M. Mosca and A. Tapp (editors), “Special Issue on Quantum Computation and Cryptography”, Algorithmica, Volume 34, Number 4, (2002).
Contributions to a Collective Work
• [Mos08b] M. Mosca, "Quantum Algorithms", Springer Encyclopedia of Complexity and Systems Science, to appear.
• [Mos08a] 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, Chania, Crete, Greece, IOS Press (2006).
• [Mos02] M. Mosca, “The Promise of Quantum Computing”, inno'va-tion and inno'v@-tion2: Essays by Leading Canadian Researchers (eds: J. Downey and L. Claxton), Key-Porter Books, (2002).
Theses
• [Mos99] M. Mosca, "Quantum Computer Algorithms", Oxford DPhil thesis, 1999.
• [Mos96] M. Mosca, "Discrete Logarithms in Finite Fields", Oxford MSc dissertation, 1996.