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
Secretaresse Quantum Computing en Cryptografie
Centrum Wiskunde & Informatica (CWI) heeft een vacature voor een professionele en flexibele Secretaresse Quantum Computing en Cryptografie (1 fte)
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
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 long-term and large-scale 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
-
van der Gulik, P.T.S. (2019, September 18). Considerations in evolutionary biochemistry. ILLC Dissertation Series.
-
Liu, S, Li, Y, & Duan, R. (2019). Distinguishing unitary gates on the IBM quantum processor. Science China Information Sciences, 62. doi:10.1007/s11432-018-9703-y
-
Alagic, G, Jeffery, S, Ozols, M, & Poremba, A. (2019). On quantum chosen-ciphertext attacks and learning with errors. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.TQC.2019.1
-
Arunachalam, S, Briët, J, & Palazuelos, C. (2019). Quantum query algorithms are completely bounded forms. SIAM Journal on Computing, 48(3), 903–925. doi:10.1137/18M117563X
-
Bannink, T.R, Briët, J, Buhrman, H.M, Labib, F.S, & Lee, T. J. (2019). Bounding quantum-classical separations for classes of nonlocal games. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) (pp. 12:1–12:11). doi:10.4230/LIPIcs.STACS.2019.12
-
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
-
Gilyén, A.P, Arunachalam, S, & Wiebe, N. (2019). Optimizing quantum optimization algorithms via faster quantum gradient computation. In Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1425–1444). doi:10.1137/1.9781611975482.87
-
Coladangelo, A, Grilo, A.B, Jeffery, S, & Vidick, T. (2019). Verifier-on-a-leash: New schemes for verifiable delegated quantum computation, with quasilinear resources. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-030-17659-4_9
-
Ito, T, & Jeffery, S. (2018). Approximate span programs. Algorithmica. doi:10.1007/s00453-018-0527-1
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
-
CIFAR grant Quantum Information Science (CIFAR)
-
Taming Quantum Adversaries (None)
-
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
-
CIFAR
-
Technische Universiteit Delft
-
Universiteit Leiden
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam