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
Four quantum information pioneers speaking at QuSoft/CWI
On 11 November, celebrated quantum information scientists and longtime collaborators Charlie Bennet and Gilles Brassard gave a lecture at QuSoft at CWI, being awarded the 2023 Breakthrough Prize in Fundamental Physics. As a surprise, other winners Peter Shor and David Deutsch joined online.
Launch of EQSI-European Quantum Software Institute in Paris
On 8 November 2022, the EQSI–European Quantum Software Institute was launched with a stakeholder event in Paris. One of the founding members is QuSoft director Harry Buhrman (QuSOft, CWI & UvA).
Gilles Brassard wins 2023 Breakthrough Prize in Fundamental Physics
Gilles Brassard, Charles H. Bennett, David Deutsch and Peter Shor were awarded the world’s largest science prize for their foundational work in quantum information. Brassard is currently hosted at QuSoft at NWO institute CWI.
Prestigious ACM STOC 10-year Test of Time Award for Ronald de Wolf
CWI researcher Ronald de Wolf and his co-authors received the ACM STOC 10-year Test of Time Award for the exceptional long-term impact of their article, during STOC - one of the most important conferences in theoretical computer science.
Members
- René Allerstorfer
- Jop Briët
- Harry Buhrman
- Yanlin Chen
- Leo Alexandre Severin Colisson
- Yfke Dulek
- Lynn Engelberts
- Francisco Escudero Gutiérrez
- Marten Folkertsma
- Peter van der Gulik
- Jonas Helsen
- Stacey Jeffery
- Junqiao Lin
- Jelena Mackeprang
- Nikhil Mande
- Jiri Minar
- Subhasree Patro
- Davi Silva
- Quinten Marcus Tupker
- Philip Verduyn Lunel
- Paul Vitányi
- Jordi Weggemans
- Ronald de Wolf
- Sebastian Zur
Associated Members
- Joran van Apeldoorn
- Mert Besken
- Gilles Brassard
- Adam Burchardt
- Chris Cade
- Jean-Sébastien Caux
- Arjan Cornelissen
- Llorenç Escolà Farràs
- Mark Golden
- Dmitry Grinko
- Koen Groenland
- Richard Maarten Peter van Harderwijk
- Seenivasan Hariharan
- Yaroslav Herasymenko
- Erik van Heumen
- Emiel Koridon
- Ludovico Lami
- Koen Leijnse
- Vania Lopez Diaz
- Garazi Muguruza Lasa
- Niels Neumann
- Ido Niesen
- Harold Nieuwboer
- Maris Ozols
- Galina Pass
- Christian Schaffner
- Yvonne Smit
- Jana Sotakova
- Florian Speelman
- David Speijer
- Marten Teitsma
- Leen Torenvliet
- Dyon van Vreumingen
- Michael Walter
- Freek Witteveen
Publications
-
Don, J.W, Fehr, S, Majenz, C, & Schaffner, C. (2022). Efficient NIZKs and signatures from commit-and-open protocols in the QROM. In Advances in Cryptology - CRYPTO 2022 (pp. 729–757). doi:10.1007/978-3-031-15979-4_25
-
Stroeks, M.E, Helsen, J, & Terhal, B.M. (2022). Spectral estimation for Hamiltonians: A comparison between classical imaginary-time evolution and quantum real-time evolution. New Journal of Physics, 24(10), 103024.1–103024.31.
-
Briët, J, & Escudero Gutiérrez, F. (2022). On converses to the polynomial method. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.TQC.2022.6
-
Buhrman, H.M, Loff Barreto, B. S, Patro, S, & Speelman, F. (2022). Memory compression with quantum random-access gates. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.TQC.2022.10
-
Don, J.W, Fehr, S, Majenz, C, & Schaffner, C. (2022). Online-extractability in the quantum random-oracle model. In Advances in Cryptology - Eurocrypt 2022 (pp. 677–706). doi:10.1007/978-3-031-07082-2_24
-
Dahlberg, A, Helsen, J, & Wehner, S.D.C. (2022). The complexity of the vertex-minor problem. Information Processing Letters, 175, 106222.1–106222.8. doi:10.1016/j.ipl.2021.106222
-
Briët, J, Holmes, D, & Kang, R.J. (2022). Steps towards openness and fairness in scientific publishing. Nieuw Archief voor Wiskunde, 5(23), 53–55.
-
Arunachalam, S, Chakraborty, S, Koucký, M, Saurabh, N, & de Wolf, R.M. (2021). Improved bounds on Fourier Entropy and Min-entropy. ACM Transactions on Computation Theory, 13(4). doi:10.1145/3470860
-
Piedrafita Postigo, A. (2021, November 10). On span programs and quantum algorithms. ILLC Dissertation Series.
-
Briët, J, & Green, B. (2021). Multiple correlation sequences not approximable by nilsequences. Ergodic Theory and Dynamical Systems, 1–12. doi:10.1017/etds.2021.66
Current projects with external funding
-
Quantum Algorithms in a Practical Setting ()
-
Quantum time-space tradeoff lower bounds ()
-
Zwaartekracht QSC Ada Lovelace (Ada Lovelace)
-
Robustness of Quantum Algorithms (ARO)
-
Algorithms, Security and Complexity for Quantum Computers (ASC-Q)
-
Groeifonds - QDNL / KAT 1 (Groeifonds)
-
Lectoraat Applied Quantum Computing (Teitsma) (None)
-
Quantum Software Consortium (QSC)
-
Research centre for quantum software (QUSOFT)
-
Startimpuls Nationale Quantumtechnologie (Startimpuls KAT-1)
Related partners
-
Bosch Foundation
-
Hogeschool van Amsterdam
-
TNO
-
Technische Universiteit Delft
-
Universiteit Leiden
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam