Michele Mosca

Michele Mosca (* 1971 ) is a Canadian mathematician who specializes in quantum information theory.

Career

Mosca studied mathematics at the University of Waterloo with a bachelor's degree in 1995 and at Oxford University (Wolfson College) with a master's degree in mathematics and computer science in 1996 and a doctorate from Artur Ekert in 1999 ( Quantum Computer Algorithms ). He is a professor at the University of Waterloo (full professorship from 2009) and since 1999 at the Center for Applied Cryptographic Research. From 2002 to 2016 he was Deputy Director of the Institute of Quantum Computing, which he co-founded. From 2002 to 2012 he held a Canada Research Chair.

He also does research at the Perimeter Institute , of which he is a founding member.

He deals with quantum algorithms, the limits of quantum computers, self-tests for quantum gates and quantum cryptography ( private quantum channels , optimal methods of encrypting quantum information with classical cryptographic methods). Together with Ekert and others, he developed the phase estimation access to quantum algorithms, and with Ekert made contributions to the hidden subgroup problem , quantum search and quantum counting. With colleagues in Oxford ( Jonathan A. Jones ) he implemented some of the first quantum algorithms on quantum computers with NMR .

In 2013 he received the Queen Elizabeth II Diamond Jubilee Medal.

Fonts

with Phillip Kaye, Raymond Laflamme : An introduction to quantum computing, Oxford UP 2007, ISBN 0198570007
Quantum Algorithms, in: Springer Encyclopedia of Complexity and Systems Science, Arxiv 2008

Web links

Homepage, University of Waterloo

Individual evidence

↑ Michele Mosca in the Mathematics Genealogy Project (English)
↑ Mosca et al. a., Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates , STOC 2000, p. 688
^ Mosca, Alan Tapp, Ronald de Wolf: Private Quantum Channels and the Cost of Randomizing Quantum Information, Arxiv 2000
^ R. Cleve, A. Ekert, C. Macchiavello, M. Mosca: Quantum algorithms revisited, Proc. Roy. Soc. A, Vol. 454, 1998, pp. 339-354, Arxiv
↑ Given a function on a group G, which is constant on all secondary classes of a subgroup H, but different on different secondary classes of H (the function hides H), and the function is given by an oracle with logarithmic power of G and X. given a limited number of bits. Then the Hidden Subgroup Problem (HSP) consists in determining the generators of H from the information from the oracle. Shor's quantum factorization algorithm is equivalent to the HSP for finite Abelian groups G. The graph isormophism problem is equivalent to the HSP for non-Abelian symmetric groups . ${\ displaystyle f \ colon G \ to X}$

↑ Ekert, Mosca, The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer , 1999

↑ For example Jones, Mosca, Implementing a quantum algorithm to solve Deutsch's problem on a Nuclear Magnetic Resonance Quantum Computer, J. Chem. Phys., Volume 109, 1998, pp. 1648-1653, Arxiv , Jones, Mosca, R. Hansen , Implementing a quantum search algorithm on a NMR QC, Nature, Volume 393, 1998, pp. 344-346, Arxiv , Jones, Fast searches with a Nuclear Magnetic Resonance Computer, Science, Volume 280, 1998, p. 229, Jones, Mosca, Approximate quantum counting on an NMR ensemble quantum computer, Phys. Rev. Lett., Vol. 83, 1999, p. 1050, Arxiv

personal data
SURNAME	Mosca, Michele
BRIEF DESCRIPTION	Canadian mathematician
DATE OF BIRTH	1971

[1] Michele Mosca in the Mathematics Genealogy Project (English)

[2] Mosca et al. a., Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates , STOC 2000, p. 688

[3] Mosca, Alan Tapp, Ronald de Wolf: Private Quantum Channels and the Cost of Randomizing Quantum Information, Arxiv 2000

[4] R. Cleve, A. Ekert, C. Macchiavello, M. Mosca: Quantum algorithms revisited, Proc. Roy. Soc. A, Vol. 454, 1998, pp. 339-354, Arxiv

[5] Given a function on a group G, which is constant on all secondary classes of a subgroup H, but different on different secondary classes of H (the function hides H), and the function is given by an oracle with logarithmic power of G and X. given a limited number of bits. Then the Hidden Subgroup Problem (HSP) consists in determining the generators of H from the information from the oracle. Shor's quantum factorization algorithm is equivalent to the HSP for finite Abelian groups G. The graph isormophism problem is equivalent to the HSP for non-Abelian symmetric groups . ${\ displaystyle f \ colon G \ to X}$

[6] Ekert, Mosca, The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer , 1999

[7] For example Jones, Mosca, Implementing a quantum algorithm to solve Deutsch's problem on a Nuclear Magnetic Resonance Quantum Computer, J. Chem. Phys., Volume 109, 1998, pp. 1648-1653, Arxiv , Jones, Mosca, R. Hansen , Implementing a quantum search algorithm on a NMR QC, Nature, Volume 393, 1998, pp. 344-346, Arxiv , Jones, Fast searches with a Nuclear Magnetic Resonance Computer, Science, Volume 280, 1998, p. 229, Jones, Mosca, Approximate quantum counting on an NMR ensemble quantum computer, Phys. Rev. Lett., Vol. 83, 1999, p. 1050, Arxiv