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
Quantum.Amsterdam and Quantum Delta NL celebrate close collaboration together
On 14 July the new quantum innovation hub Quantum.Amsterdam, established by CWI, Uva and QuSoft, and Quantum Delta NL raised the flag together to celebrate their close collaboration for the coming seven years. Their aim is to boost quantum research and development in the Amsterdam ecosystem.
Is this the first physics problem that the quantum computer will solve?
Joris Kattemölle (UvA/QuSoft/CWI) proposes a physical problem that could be the first one for a quantum computer with 100 qubits to solve. On Wednesday 30 June Kattemölle defended his PhD thesis.
Tremendous Boost for Quantum Research in the Amsterdam Ecosystem
The financial injection of 615 million euros from the National Growth Fund of the Dutch Ministry of Economic Affairs and Climate Policy gives a tremendous boost to quantum research and development in the Amsterdam ecosystem.
Quantum Delta NL Awarded 615 Million Euro from Netherlands’ National Growth Fund to Accelerate Quantum Technology
Funds will be used to train 2,000 researchers and engineers to scale 100 start-ups and to host three corporate R&D labs in the Netherlands by 2027
Members
- René Allerstorfer
- Simon Apers
- Jop Briët
- Harry Buhrman
- Chris Cade
- Yanlin Chen
- Yfke Dulek
- Marten Folkertsma
- Peter van der Gulik
- Stacey Jeffery
- Farrokh Labib
- Christian Majenz
- Nikhil Mande
- Ido Niesen
- Subhasree Patro
- Mehrdad Tahmasbi
- Philip Verduyn Lunel
- Paul Vitányi
- Jordi Weggemans
- Ronald de Wolf
- Sebastian Zur
Associated Members
- Joran van Apeldoorn
- Sébastian de Bone
- Jean-Sébastien Caux
- Arjan Cornelissen
- Bas Dirkse
- Llorenç Escolà Farràs
- Mark Golden
- Dmitry Grinko
- Koen Groenland
- Jonas Helsen
- Erik van Heumen
- Joris Kattemölle
- Matteo Lostaglio
- Ian Marshall
- Garazi Muguruza Lasa
- Niels Neumann
- Harold Nieuwboer
- Maris Ozols
- Arghavan Safavi-Naini
- Christian Schaffner
- Yvonne Smit
- Jana Sotakova
- Florian Speelman
- Marten Teitsma
- Leen Torenvliet
- Dyon van Vreumingen
- Michael Walter
- Freek Witteveen
Publications
-
Briët, J, & Labib, F.S. (2021). High-entropy dual functions over finite fields and locally decodable codes. Forum of Mathematics, Sigma, 9(e19). doi:10.1017/fms.2021.1
-
Christandl, M, Leditzky, F. (Felix), Majenz, C, Smith, G. (Graeme), Speelman, F, & Walter, M. (Michael). (2020). Asymptotic performance of port-based teleportation. Communications in Mathematical Physics. doi:10.1007/s00220-020-03884-0
-
Apers, S, & de Wolf, R.M. (2020). Quantum speedup for graph sparsification, cut approximation and Laplacian solving. In FOCS 2020 - 61st Annual IEEE Symposium on Foundations of Computer Science (pp. 637–648). doi:10.1109/FOCS46700.2020.00065
-
Patro, S, & Piedrafita, A. (2020). An overview of quantum algorithms: From quantum supremacy to Shor factorization. In 2020 IEEE International Symposium on Circuits and Systems (pp. 1–5). doi:10.1109/ISCAS45731.2020.9180793
-
Cornelissen, A.J, Jeffery, S, Ozols, M, & Piedrafita, A. (2020). Span programs and quantum time complexity. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.MFCS.2020.26
-
Ambainis, A, Gilyén, A.P, Jeffery, S, & Kokainis, M. (2020). Quadratic speedup for finding marked vertices by quantum walks. In Proceedings of the Annual ACM SIGACT Symposium on Theory of Computing (pp. 412–424). doi:10.1145/3357713.3384252
-
Arunachalam, S, Belovs, A, Childs, A.M, Kothari, R, Rosmanis, A, & de Wolf, R.M. (2020). Quantum coupon collector. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.TQC.2020.10
-
Bannink, T.R, Briët, J, Labib, F.S, & Maassen, H. (2020). Quasirandom quantum channels. In Leibniz International Proceedings in Informatics. doi:10.4230/LIPIcs.TQC.2020.5
-
Tham, W.K, Ferretti, H, Bonsma-Fisher, K, Brodutch, A, Sanders, B.C, Steinberg, A.M, & Jeffery, S. (2020). Experimental Demonstration of Quantum Fully Homomorphic Encryption with Application in a Two-Party Secure Protocol. Physical Review X, 10(1). doi:10.1103/PhysRevX.10.011038
-
Jeffery, S. (2020). Span programs and quantum space complexity. In Proceedings of ITCS (pp. 4:1–4:36). doi:10.4230/LIPIcs.ITCS.2020.4
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)
-
Startimpuls Nationale Quantumtechnologie (None)
-
Quantum Computing (PPS ABN AMRO Bank)
-
Quantum Software Consortium (QSC)
-
Quantum algorithms and applications (QuantAlgo)
-
Research centre for quantum software (QUSOFT)
-
Taming Quantum Adversaries
-
WISE Women In Science Excel (WISE)
Related partners
-
ABN AMRO Bank
-
Bosch Foundation
-
CIFAR
-
TNO
-
Technische Universiteit Delft
-
Universiteit Leiden
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam