2 computer-science-quantum "https:" "https:" "https:" "https:" positions at The University of Manchester
Sort by
Refine Your Search
-
factorisation and discrete logarithm computation are hard. It is proven that large scale quantum computers, if they were built, would solve these hard problems efficiently, hence rendering today's cryptography
-
computations possible [1]. However, proven scientific applications for quantum computing remain mostly limited to quantum chemistry, materials, and particle physics. Since CFD is one of the most demanding use
Enter an email to receive alerts for computer-science-quantum "https:" "https:" "https:" "https:" positions