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
No vacancies currently.
News
Podcast: Companies craving for quantum software
Harry Buhrman (CWI, QuSoft) spoke in the Superscience podcast series on the new possibilities that quantum software will offer society and businesses.
Jordi Weggemans wins Lorentz Graduation Prize
CWI PhD student and QuSoft researcher Jordi Weggemans has won the Lorentz Graduation Prize for Theoretical Physics 2021 for his master thesis on a new quantum algorithm.
CWI-researchers performed at 'Gala van de Wetenschap'
CWI researchers Harry Buhrman, Stacey Jeffery and Maris Ozols performed at 'Gala van de Wetenschap'.
Quantum Application Lab: a bridge between science and applications
In October 2021 the MoU of the Quantum Application Lab (QAL) was signed by its six partners. QAL will connect scientific developments of quantum hardware and software with demand-driven solutions.
Current events
PhD Defence Farrokh Sieyar Labib (A&C)
- 2022-01-26T10:00:00+01:00
- 2022-01-26T11:00:00+01:00
PhD Defence Farrokh Sieyar Labib (A&C)
Start: 2022-01-26 10:00:00+01:00 End: 2022-01-26 11:00:00+01:00
Preliminary announcement:
PhD defence Farrokh Labib. Title thesis "Quasirandomness in quantum information theory".
Promotor: prof.dr. H.M. Buhrman (CWI/UvA)
Co-promotor: dr. J. Briet (CWI)
Members
- René Allerstorfer
- Jop Briët
- Harry Buhrman
- Yanlin Chen
- Yfke Dulek
- Francisco Escudero Gutiérrez
- Marten Folkertsma
- Peter van der Gulik
- Jonas Helsen
- Stacey Jeffery
- Nikhil Mande
- Subhasree Patro
- Mehrdad Tahmasbi
- Quinten Marcus Tupker
- Philip Verduyn Lunel
- Paul Vitányi
- Jordi Weggemans
- Ronald de Wolf
- Sebastian Zur
Associated Members
- Joran van Apeldoorn
- Sébastian de Bone
- Adam Burchardt
- Chris Cade
- Jean-Sébastien Caux
- Arjan Cornelissen
- Llorenç Escolà Farràs
- Mark Golden
- Dmitry Grinko
- Koen Groenland
- Seenivasan Hariharan
- Erik van Heumen
- Matteo Lostaglio
- Ian Marshall
- Garazi Muguruza Lasa
- Niels Neumann
- Ido Niesen
- Harold Nieuwboer
- Maris Ozols
- Galina Pass
- Akshay Ramachandran
- Arghavan Safavi-Naini
- Christian Schaffner
- Yvonne Smit
- Jana Sotakova
- Florian Speelman
- Marten Teitsma
- Leen Torenvliet
- Dyon van Vreumingen
- Michael Walter
- Freek Witteveen
Publications
-
Labib, F.S. (2022, January 26). Quasirandomness in quantum information theory. ILLC Dissertation Series.
-
Chakraborty, S, Chattopadhyay, A, Høyer, P, Mande, N.S, Paraashar, M, & de Wolf, R.M. (2022). Symmetry and quantum query-to-communication simulation. In Proceedings of International Symposium on Theoretical Aspects of Computer Science.
-
Alagic, G, Gagliardoni, T, & Majenz, C. (2021). Can you sign a quantum state?. Quantum, 5, 603.1–603.38. doi:10.22331/Q-2021-12-16-603
-
Bun, M, Mande, N.S, & Thaler, J. (2021). Sign-rank can increase under intersection. ACM Transactions on Computation Theory, 13(4). doi:10.1145/3470863
-
Grilo, A, Hövelmanns, K, Hülsing, A, & Majenz, C. (2021). Tight adaptive reprogramming in the QROM. In Advances in Cryptology - ASIACRYPT 2021 (pp. 637–667). doi:10.1007/978-3-030-92062-3_22
-
Chakraborty, S, Mande, N.S, Mittal, R, Molli, T, Paraashar, M, & Sanyal, S. (2021). Tight Chang’s-lemma-type bounds for Boolean functions. In Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 10.1–10.22). doi:10.4230/LIPIcs.FSTTCS.2021.10
-
Arunachalam, S, Chakraborty, S, Lee, T. J, Paraashar, M, & de Wolf, R.M. (2021). Two new results about quantum exact learning. Quantum, 5. doi:10.22331/q-2021-11-24-587
-
Broadbent, A, Jeffery, S, Lord, S, Podder, S, & Sundaram, A. (2021). Secure Software Leasing without assumptions. In TCC 2021, Theory of Cryptography, Proceedings (pp. 90–120). doi:10.1007/978-3-030-90459-3_4
-
Apers, S.M.G, & Lee, T. J. (2021). Quantum complexity of minimum cut. In Computational Complexity Conference (pp. 28:1–28:33). doi:10.4230/LIPIcs.CCC.2021.28
-
Apers, S.M.G, Sarlette, A, & Ticozzi, F. (2021). Characterizing limits and opportunities in speeding up Markov chain mixing. Stochastic Processes and their Applications, 136, 145–191. doi:10.1016/j.spa.2021.03.006
Current projects with external funding
-
Quantum Algorithms in a Practical Setting ()
-
Quantum time-space tradeoff lower bounds ()
-
Zwaartekracht QSC Ada Lovelace (Ada Lovelace)
-
CIFAR grant Quantum Information Science (CIFAR)
-
Nationaal groeifonds / KAT 1 (Groeifonds)
-
Quantum Software Consortium (QSC)
-
Quantum algorithms and applications (QuantAlgo)
-
Research centre for quantum software (QUSOFT)
-
Startimpuls Nationale Quantumtechnologie (Startimpuls KAT-1)
-
WISE Women In Science Excel (WISE)
Related partners
-
Bosch Foundation
-
CIFAR
-
TNO
-
Technische Universiteit Delft
-
Universiteit Leiden
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam