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
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.
Nature does not allow secure computation between rivals
It is impossible to devise a cryptographic system that guarantees secure computation between two rivals.
Members
Associated Members
Publications
-
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 Leibniz International Proceedings in Informatics, LIPIcs. 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
-
Briët, J, Dvir, Z, & Gopi, S. (2017). Outlaw distributions and locally decodable codes. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.ITCS.2017.20
-
Arunachalam, S, & de Wolf, R. M. (2017). Optimal quantum sample complexity of learning algorithms. In Leibniz International Proceedings in Informatics, LIPIcs: Proceedings of Conference of Computational Complexity. doi:10.4230/LIPIcs.CCC.2017.25
Current projects with external funding
-
Algorithms, protocols and applications for small qubits systems
-
Networks
-
Position-Based Quantum Cryptography
-
Quantum and classical data transmission
-
Quantum Computation with Bounded Space
-
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)
Related partners
-
Technische Universiteit Eindhoven
-
Technische Universiteit Delft
-
Universiteit Leiden
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam