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
PhD student on the subject of quantum algorithms and complexity
Centrum Wiskunde & Informatica (CWI) has a vacancy in its Algorithms and Complexity research group for a talented PhD student on the subject of quantum algorithms and complexity.
Tenuretrack position in the area of quantum algorithms and applications of quantum computers
Centrum Wiskunde & Informatica (CWI) in Amsterdam invites excellent researchers to apply for a Tenuretrack position in the area of quantum algorithms and applications of quantum computers.
Postdoc / Postdoctoral Researcher on the subject of the computerscience aspects of quantum computing and quantum information theory
This position involves research into the computerscience 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 NWOfunded QuantERA project QuantAlgo, for one or two years, and can start at any time after 1 August 2018.
News
CWI researchers develop new method of computation
Catalytic memory is the new term for a method of computing whereby the computer carries out a computation using memory that it is already filled with data, returning it to its original state after use.
Bruno Loff defends thesis on computational complexity
CWI researcher Bruno Loff has developed new techniques for determining the complexity of problems that can be solved by a computer. Studying computational complexity provides insight in the inherent difficulty of different types of problems, and the amount of computing power necessary to solve them.
CWI researchers in research consortium Gravity programme
Six research consortia in which prominent scientists from various Dutch universities work together are receiving a combined sum of 153 million euros for longterm and largescale research.
Jop Briët awarded Andreas Bonn medal
Jop Briët, former researcher at the Centrum Wiskunde & Informatica (CWI) in Amsterdam, was awarded the Andreas Bonn medal for his thesis `Grothendieck Inequalities, nonlocal games and optimization’.
Members
Associated Members
Publications

Liu, S, Li, Y, & Duan, R. (2019). Distinguishing unitary gates on the IBM quantum processor. Science China Information Sciences, 62. doi:10.1007/s114320189703y

Alagic, G, Jeffery, S, Ozols, M, & Poremba, A. (2019). On quantum chosenciphertext attacks and learning with errors. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.TQC.2019.1

Witteveen, J, Bottesch, R.C, & Torenvliet, L. (2019). A Hierarchy of Polynomial Kernels. In Lecture Notes in Computer Science. doi:10.1007/9783030108014

Groenland, K.L. (2019). Adiabatic state distribution using antiferromagnetic spin systems. SciPost Physics, 6(011). doi:10.21468/SciPostPhys.6.1.011

Gilyén, A.P, Arunachalam, S, & Wiebe, N. (2019). Optimizing quantum optimization algorithms via faster quantum gradient computation. In Annual ACMSIAM Symposium on Discrete Algorithms (pp. 1425–1444). doi:10.1137/1.9781611975482.87

Arunachalam, S, Briët, J, & Palazuelos, C. (2019). Quantum query algorithms are completely bounded forms. SIAM Journal on Computing.

Coladangelo, A, Grilo, A, Jeffery, S, & Vidick, T. (2019). Verifieronaleash: New schemes for verifiable delegated quantum computation, with quasilinear resources. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/9783030176594_9

Ito, T, & Jeffery, S. (2018). Approximate span programs. Algorithmica. doi:10.1007/s0045301805271

Buurlage, J, Bannink, T.R, & Bisseling, R.H. (2018). Bulk: A modern C++ interface for bulksynchronous parallel programs. In EuroPar 2018: Parallel Processing (pp. 519–532). doi:10.1007/9783319969831_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
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 Computing (PPS ABN AMRO Bank)

Quantum Software Consortium (QSC)

Quantum algorithms and applications (QuantAlgo)

Research centre for quantum software (QUSOFT)

WISE Women In Science Excel (WISE)
Related partners

ABN AMRO Bank

Bosch Foundation

Robert Bosch GmbH

Technische Universiteit Delft

Universiteit Leiden

Universiteit van Amsterdam

Vrije Universiteit Amsterdam