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.
Vacancies
Postdoc / Postdoctoral Researcher on the subject of the computer-science aspects of quantum computing and quantum information theory
This position involves research into the computer-science aspects of quantum computing and quantum information theory. Specifically, the project will focus on one or more of the following topics: quantum algorithms and complexity, quantum machine learning, quantum communication, quantum cryptography. Depending on the most suitable topic, the research will be in collaboration with one or more of the following researchers: Jop Briët, Harry Buhrman, Peter Grünwald, Stacey Jeffery, Maris Ozols, Christian Schaffner, Michael Walter, and Ronald de Wolf. The position is on the NWO-funded QuantERA project QuantAlgo, for one or two years, and can start at any time after 1 August 2018.
News
Ronald de Wolf receives ERC Consolidator Grant for quantum research
Ronald de Wolf of Centrum Wiskunde & Informatica (CWI) has received a prestigious ERC Consolidator Grant for quantum computing research. De Wolf was awarded the individual grant of approximately €1.5 million for his research project 'Progress in quantum computing: Algorithms, communication and applications'.
Vidi grant for Alexander Schönhuth and Matthias Christandl
The Netherlands Organisation for Scientific Research (NWO) has awarded Vidi grants to Alexander Schönhuth and Matthias Christandl.
Rubicon for Jop Briët from CWI
The Netherlands Organisation for Scientific Research (NWO) awarded a Rubicon grant to Jop Briët, researcher at the Centrum Wiskunde & Informatica (CWI) in Amsterdam.
Stieltjes Prize for Jop Briët
Today, Jop Briët, researcher at Centrum Wiskunde & Informatica (CWI) in Amsterdam, was awarded the Stieltjesprijs 2011, the prize for the best thesis in mathematics.
Current events
PHD DEFENCE ANDRAS PAL GILYEN (A&C)
- 2019-05-29T14:00:00+02:00
- 2019-05-29T15:00:00+02:00
PHD DEFENCE ANDRAS PAL GILYEN (A&C)
Start: 2019-05-29 14:00:00+02:00 End: 2019-05-29 15:00:00+02:00
Everybody is welcome to attend the public defence of András Pál Gilyén (CWI)
of his thesis 'Quantum Singular Value Transformation and its algorithmic applications'.
Supervisor: prof. dr. R.M. de Wolf, Centrum Wiskunde & Informatica / Universiteit van Amsterdam
Co-supervisor: prof. dr. H.M. Buhrman, Centrum Wiskunde & Informatica/ Universiteit van Amsterdam
Committee:
prof. dr. M. Szegedy, Rutgers University
prof. dr. A. Schrijver, Universiteit van Amsterdam
prof. dr. C.J.M. Schoutens, Universiteit van Amsterdam
dr. S. Jeffery, Centrum Wiskunde & Informatica
dr. M. Ozols, Universiteit van Amsterdam
- Email: Silvia Benschop
- Phone: 020 592 4032
-
iCal
Members
Associated Members
Publications
-
Witteveen, J, Bottesch, R.C, & Torenvliet, L. (2019). A Hierarchy of Polynomial Kernels. In Lecture Notes in Computer Science. doi:10.1007/978-3-030-10801-4
-
Groenland, K.L. (2019). Adiabatic state distribution using anti-ferromagnetic spin systems. SciPost Physics, 6(011). doi:10.21468/SciPostPhys.6.1.011
-
Arunachalam, S, Briët, J, & Palazuelos, C. (2019). Quantum query algorithms are completely bounded forms. SIAM Journal on Computing.
-
Ito, T, & Jeffery, S. (2018). Approximate span programs. Algorithmica. doi:10.1007/s00453-018-0527-1
-
Buurlage, J, Bannink, T.R, & Bisseling, R.H. (2018). Bulk: A modern C++ interface for bulk-synchronous parallel programs. In Euro-Par 2018: Parallel Processing (pp. 519–532). doi:10.1007/978-3-319-96983-1_37
-
Jarret, M, Jeffery, S, Kimmel, S, & Piedrafita, A. (2018). Quantum algorithms for connectivity and related problems. In 26th Annual European Symposium on Algorithms (ESA 2018) (pp. 49:1–49:13). doi:10.4230/LIPIcs.ESA.2018.49
-
Buhrman, H.M, 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
-
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
-
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
-
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
Current projects with external funding
-
Quantum Computation with Bounded Space ()
-
Algorithms, protocols and applications for small qubits systems
-
Quantum Algorithms in a Practical Setting
-
Realization of Quantum Computing Applications at Bosch
-
Quantum Software Consortium (QSC)
-
Quantum algorithms and applications (QuantAlgo)
-
Research centre for quantum software (QUSOFT)
-
WISE Women In Science Excel (WISE)
Related partners
-
Bosch Foundation
-
Robert Bosch GmbH
-
Technische Universiteit Delft
-
Universiteit Leiden
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam