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
Tenure-Track position in the area of quantum algorithms and applications of quantum computers
QuSoft is the Dutch research Center for Quantum Software that was launched in 2015. Its mission is to develop new communication protocols, algorithms, and applications for small and medium-sized prototypes as well as larger quantum computers.
News
ABN AMRO and QuSoft join hands to explore the power of quantum software
ABN AMRO and QuSoft are joining forces to explore the opportunities offered by quantum software and quantum computers. Operating under the name DisQover, the partnership will reveal what issues in the financial sector could be better solved using quantum computers. The partnership was announced at the Quantum Tech conference in Boston.
CWI researcher develops a unifying framework for quantum algorithms
A large group of quantum algorithms can now be easier understood and optimized, using a new framework developed by QuSoft researcher András Gilyén. In his PhD thesis Gilyén provides a framework that unifies quantum algorithms, while optimizing their hardware requirements. His thesis was awarded cum laude
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.
Members
Associated Members
- Joran van Apeldoorn
- Sébastian de Bone
- Jean-Sébastien Caux
- Arjan Cornelissen
- Jan Czajkowski
- Bas Dirkse
- Yfke Dulek
- Mark Golden
- Koen Groenland
- Jonas Helsen
- Erik van Heumen
- Joris Kattemölle
- Ian Marshall
- Harold Nieuwboer
- Maris Ozols
- Christian Schaffner
- Jana Sotakova
- Marten Teitsma
- Leen Torenvliet
- Michael Walter
- Jordi Weggemans
- Freek Witteveen
Publications
-
Arunachalam, S, Chakraborty, S, Koucky, M, Saurabh, N, & de Wolf, R.M. (2020). Improved bounds on Fourier entropy and min-entropy. In Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020. doi:10.4230/LIPIcs.STACS.2020.45
-
van Apeldoorn, J.T.S. (2020, February 6). A quantum view on convex optimization. ILLC Dissertation Series.
-
Bannink, T.R. (2020, January 30). Quantum and stochastic processes. ILLC Dissertation Series.
-
Groenland, K.L. (2020, January 17). Quantum protocols for few-qubit devices. ILLC Dissertation Series.
-
van Apeldoorn, J.T.S, Gilyén, A.P, Gribling, S.J, & de Wolf, R.M. (2020). Convex optimization using quantum oracles. Quantum, 4. doi:10.22331/q-2020-01-13-220
-
Alagic, G, Majenz, C, Russell, A, & Song, F. (2020). Quantum-secure message authentication via blind-unforgeability. In EUROCRYPT.
-
Chakraborty, S, Gilyén, A.P, & Jeffery, S. (2019). The power of block-encoded matrix powers: Improved regression techniques via faster Hamiltonian simulation. In International Colloquium on Automata, Languages, and Programming (pp. 33:1–33:14). doi:10.4230/LIPIcs.ICALP.2019.33
-
Aharonov, D, & Grilo, A. (2019). Stoquastic PCP vs. randomness. In Proceedings of FOCS (pp. 1000–1023). doi:10.1109/FOCS.2019.00065
-
Sinha, M, & de Wolf, R.M. (2019). Exponential separation between quantum communication and logarithm of approximate rank. In Proceedings of FOCS (pp. 966–981). doi:10.1109/FOCS.2019.00062
-
Briët, J, Dvir, Z, & Gopi, S. (2019). Outlaw distributions and locally decodable codes. Theory of Computing, 15(12), 1–24. doi:10.4086/toc.2019.v015a012
Current projects with external funding
-
Quantum Algorithms in a Practical Setting ()
-
Quantum Computation with Bounded Space ()
-
Quantum time-space tradeoff lower bounds ()
-
Realization of Quantum Computing Applications at Bosch
-
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
-
Technische Universiteit Delft
-
Universiteit Leiden
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam