Quantum Software Consortium

NEWS

  • Quantum Physics and Logic 2026: Scientific Highlights

    The 23rd International Conference on Quantum Physics and Logic (QPL 2026) brought nearly 200 quantum researchers, computer scientists, and mathematicians to the University of Amsterdam, Roeterseiland campus between August 15th and 21st, 2026. This year’s gathering marked the largest QPL conference in its 23 years history, spanning seven days of workshops, a job fair, and three parallel technical tracks.

  • Freek Witteveen (CWI, QuSoft) selected for QDNL’s Top Talent Initiative.

    QuSoft is pleased to announce Freek Witteveen, a senior researcher at QuSoft and CWI, as a recipient of QDNL funding and mentorship through QDNL Top Talent Initiative (TTI). Freek’s work sits at the intersection of physics, mathematics, and computer science – and he effectively aims to move ideas from one domain to another. Through the study of quantum tensor network states, he explores which quantum systems can be examined using a classical computer and which require quantum computation. 

  • ERC Starting Grant for QSC researcher Jonas Helsen on quantum error correction.

    Jonas Helsen, a researcher in CWI’s Algorithms & Complexity group, has been awarded a prestigious €1.5 million European grant. Jonas will use the funding to develop methods for reliably analyzing and certifying the performance of fault-tolerant quantum computers. This is one of the major challenges in quantum computing: quantum computers are highly prone to errors, which can make their results unreliable.

  • Veni grant for research into quantum-resistant digital locks.

    Researcher Wessel van Woerden has received a Veni grant from the Dutch Research Council (NWO) to design compact digital ‘locks’ that protect systems against attacks by quantum computers. Van Woerden will join CWI’s Cryptology group in January to carry out the research.

  • Report on Quantum Position Verification Workshop at Lorentz Center

    Lorentz Center@Omega, Leiden, from 13 - 17 July 2026

    Source: Wolfgang Löffler (LION, Leiden University)

  • Best Student Paper Award for Breakthrough in Quantum Complexity.

    Junqiao Lin (QuSoft, CWI) has won the best student paper award at STOC, a premier conference in theoretical computer science held in Salt Lake City (USA). His paper demonstrates how changing the mathematical rules we use to describe quantum physics completely changes what a computer is capable of discovering.

    Source: CWI website

  • Former QuSoft Turing Chair Gilles Brassard wins A.M. Turing Award

    Charles H. Bennett and Gilles Brassard have been awarded the 2025 ACM A.M. Turing Award for “their essential role in establishing the foundations of quantum information science and transforming secure communication and computing.” The award, often referred to as the “Nobel Prize of Computing,” carries a $1 million prize. It is the first time the 60-year-old prize honours work in the quantum realm.

  • Christian Schaffner contributed to Technoloog podcast of BNR Nieuwsradio

    Christian Schaffner (QuSoft, IvI-UvA) joined Ben Van der Burg and @Mark Beekhuis at their Technoloog podcast of BNR Nieuwsradio to talk about where quantum computing stands right now — and what it means for cybersecurity.

  • Rubicon grant for Liam Bond

    Liam Bond, PhD candidate in the group of Arghavan Safavi-Naini, has been awarded an NWO Rubicon grant. Liam specializes in the research of quantum many-body dynamics, quantum simulations and quantum sensing. The grant allows him to carry out his project “Why not both? Hybrid qubit-oscillator systems for quantum advantage” at the University of Maryland. Congratulations to Liam!

  • Quantuminternet: Chinese fysici bouwen ‘het allerbeste dat je op dit moment kunt bereiken’.

    Chinese onderzoekers zijn een stap dichter bij een toekomstig quantuminternet gekomen, een futuristisch netwerk waarmee gebruikers onkraakbare informatie kunnen uitwisselen, flitshandel kunnen bedrijven en datacenters efficiënter kunnen maken. ‘De eerste toepassingen komen steeds dichterbij.’

 
1 2 3 4 5 6 7 8 9 10 ... 15