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
Bosch and QuSoft start quantum computing collaboration
Recently, a research collaboration has begun between QuSoft and the Bosch Group. Researchers will investigate potential quantum computing use cases at Bosch, with a focus on applications in engineering and AI/machine learning fields.
Florian Speelman wins Andreas Bonn medal 2018
Florian Speelman (CWI & QuSoft) was awarded an Andreas Bonn medal 2018 from the GNGH, the Dutch Society for the Advancement of Science, Medicine and Surgery, for his thesis 'Position-based Quantum Cryptography and Catalytic Computation'. The three medals are presented once every five years for original work.
Cum laude for PhD thesis on advancing theory of lower bounds for multiplying matrices faster
Jeroen Zuiddam (CWI) developed new mathematical instruments to study the problem of multiplying large matrices fast. He defends his PhD thesis ‘Algebraic complexity, asymptotic spectra and entanglement polytopes’ at the UvA on 23 October. He received a 'cum laude' predicate.
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.
Members
Associated Members
Publications
-
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
-
Jarret, M, Jeffery, S, Kimmel, S, & Piedrafita, Á. (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, 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
-
van der Gulik, P.T.S, Hoff, W.D, & Speijer, D. (2017). In defence of the three-domains of life paradigm. BMC Evolutionary Biology, 17. doi:10.1186/s12862-017-1059-z
-
Bottesch, R.C. (2017). Relativization and interactive proof systems in Parameterized Complexity theory. In Leibniz International Proceedings in Informatics. doi:10.4230/LIPIcs.IPEC.2017.9
Current projects with external funding
-
Algorithms, protocols and applications for small qubits systems
-
Quantum Algorithms in a Practical Setting
-
Quantum Computation with Bounded Space
-
Realization of Quantum Computing Applications at Bosch
-
Approximation Algorithms, Quantum Information and Semidefinite Optimization (AQSO)
-
Progress in quantum computing:Algorithms, communication, and applications (QPROGRESS)
-
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