Description
Leader of the group Algorithms and Complexity: Harry Buhrman.
Our research group designs software for the computing technology of the future, especially quantum computing. Based on the laws of quantum mechanics, which tell us that systems and particles can be in multiple states at once, quantum computing is radically different from computing as we know it. Our quantum software requires fundamentally different techniques and approaches based on superposition, interference and entanglement. Ultimately, our research will result in better, faster and more reliable computer systems for society. Our research group is involved in QuSoft, the new Dutch research centre for quantum software.
News
Arunachalam presents findings on quantum algorithms and machine learning
On 25 April 2018, CWI PhD student Srinivasan Arunachalam will defend his thesis at the University of Amsterdam. In his thesis, Arunachalam analyzes the strengths and weaknesses of the quantum computer for a number of problems.
European researchers publish Quantum Software Manifesto
Researchers and industry specialists across Europe, led by Harry Buhrman (director of QuSoft, group leader at CWI, and professor at the University of Amsterdam), have launched a Quantum Software Manifesto. With the Manifesto, the group aims to increase awareness of and support for quantum software research.
Quantum revolution at Lowlands
Quantum experts Harry Buhrman (CWI, QuSoft and UvA) and Ronald Hanson (QuTech, TU Delft) showed a glimpse of their scientific minds at the Lowlands pop festival 2017, discussing the quantum revolution.
Veni grants for CWI researchers Tim Baarslag and Stacey Jeffery
NWO has awarded Veni grants to Tim Baarslag and Stacey Jeffery. The funding allows these researchers, who have recently obtained their PhD, to conduct independent research and develop their ideas for a period of three years.
Members
Associated Members
Publications
-
Buhrman, H, Torenvliet, L, Unger, F.P, & Vereshchagin, N.K. (2018). Sparse Selfreducible Sets and Nonuniform Lower Bounds. Algorithmica, 1–22. doi:10.1007/s00453-018-0439-0
-
van der Gulik, P.T.S. (2018). The evolution of the genetic code. Amsterdam Science, (07), 6–7.
-
Christandl, M, Jensen, A. K, & Zuiddam, J. (2018). Tensor rank is not multiplicative under the tensor product. Linear Algebra and Its Applications, 543, 125–139. doi:10.1016/j.laa.2017.12.020
-
Excel op een kwantumcomputer? - EOSWetenschap.eu - 12-04-18. (2018). Excel op een kwantumcomputer? - EOSWetenschap.eu - 12-04-18.
-
de Boer, K, Ducas, L, Jeffery, S, & de Wolf, R. M. (2018). Attacks on the AJPS Mersenne-based cryptosystem. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 101–120). doi:10.1007/978-3-319-79063-3_5
-
Deze onderzoeksgroep schrijft de software van de toekomst - Folia.nl - 01-02-18. (2018). Deze onderzoeksgroep schrijft de software van de toekomst - Folia.nl - 01-02-18.
-
Arunachalam, S, Briët, J, & Palazuelos, C. (2018). Quantum query algorithms are completely bounded forms. In Leibniz International Proceedings in Informatics, LIPIcs (pp. 3:1–3:21). doi:10.4230/LIPIcs.ITCS.2018.3
-
Quantum computing: the new frontier - Amsterdam Science - 12-12-2017. (2017). Quantum computing: the new frontier - Amsterdam Science - 12-12-2017.
-
Briët, J, & Gopi, S. (2017). Gaussian width bounds with applications to arithmetic progressions in random settings. arXiv.org e-Print archive.
-
Referendum over nieuwe 'aftap-wet' veiligheidsdiensten op 21 maart - AT5.nl - 01-11-17. (2017). Referendum over nieuwe 'aftap-wet' veiligheidsdiensten op 21 maart - AT5.nl - 01-11-17.