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
Centrum Wiskunde & Informatica (CWI) has a vacancy in the Algorithms and Complexity research group for a talented Postdoc / Postdoctoral researcher on the subject of the computer-science aspects of quantum computing and quantum information theory.
News
The week of quantum computing
Starting 12 January 2015, the Universiteit van Nederland publishes five public lectures by Harry Buhrman, head of the research group quantum computing at CWI. The series of lectures features the do's and don'ts of the computer of the future. From Monday through Friday, a new lecture will be available on the site of the Universiteit van Nederland each day.
Five Veni grants for CWI researchers
The Netherlands Organisation for Scientific Research (NWO) has awarded Veni grants to Jop Briët, Jiyin He, Wouter Koolen, Marc Stevens and Xiaodong Zhuge of CWI.
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.
Current events
PhD defence Joran van Apeldoorn (A&C/QuSoft)
- 2020-02-06T14:00:00+01:00
- 2020-02-06T23:59:59+01:00
PhD defence Joran van Apeldoorn (A&C/QuSoft)
Start: 2020-02-06 14:00:00+01:00 End: 2020-02-06 23:59:59+01:00
Everyone is welcome to attend the public defence of Joran van Apeldoorn, of his thesis 'A Quantum View on Convex Optimization'.
PhD defence Thomas Reint (Tom) Bannink (A&C/QuSoft)
- 2020-01-30T10:00:00+01:00
- 2020-01-30T23:59:59+01:00
PhD defence Thomas Reint (Tom) Bannink (A&C/QuSoft)
Start: 2020-01-30 10:00:00+01:00 End: 2020-01-30 23:59:59+01:00
Everyone is welcome to attend the public defence of Tom Bannink, of his thesis 'Quantum and Stochastic Processes'.
Promotores: prof. dr. H.M. Buhrman (CWI/UvA) en prof. dr. W.T.F. den Hollander (Universiteit Leiden)
Members
Associated Members
- Joran van Apeldoorn
- Simon Apers
- 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
- Harold Nieuwboer
- Maris Ozols
- Christian Schaffner
- Boris Skoric
- Jana Sotakova
- Leen Torenvliet
- Michael Walter
- Freek Witteveen
Publications
-
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
-
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
-
Sinha, M, & de Wolf, R.M. (2019). Exponential separation between quantum communication and logarithm of approximate rank. In Proceedings of FOCS 2019 - 60th Annual IEEE Symposium on Foundations of Computer Science.
-
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
-
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
-
Briët, J, & Palazuelos, C. (2019). Failure of the trilinear operator space Grothendieck theorem. Discrete Analysis, (8). doi:10.19086/da.8805
-
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
Current projects with external funding
-
Quantum Computation with Bounded Space ()
-
Quantum time-space tradeoff lower bounds ()
-
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