91¸£Àû

Two papers by members of 91¸£Àû Quantum were accepted to , the most prestigious conference in Quantum Computing and Quantum Information.

These works provide a methodology for boosting the power of quantum algorithms using deep mathematical tools from additive combinatorics, as well as provide the techniques, tools, and abstractions necessary to answer when classical zero-knowledge protocols remain secure against quantum attacks.

• "Quantum Worst-Case to Average-Case Reductions for All Linear Problems" by Vahid R. Asadi, Alexander Golovnev, , Igor Shinkar, and .
• "Post-Quantum Zero Knowledge, Revisited" by Alex Lombardi, Fermi Ma and .

The European Research Council (ERC) has announced that is among the winners of its prestigious Starting Grant competition. According to the European Research Council: "The funding is worth in total €636 million and is part of the Horizon Europe programme. It will help excellent younger scientists, who have 2 to 7 years’ experience after their PhDs, to launch their own projects, form their teams and pursue their most promising ideas."

has been awarded a €1.5M ERC Starting grant for a 5-year project entitled "Synergies Between Complexity and Learning". The project aims to exchange ideas and techniques between Complexity Theory and Learning Theory to accelerate progress in both fields, broaden the arsenal of tools available to attack their open problems, as well as to obtain a deeper understanding of the nature of efficient computation and of its logical aspects.

Two projects in Computer Science and Informatics (PE6 panel) in the United Kingdom were awarded ERC Starting Grants in the 2022 round. The contains more information about the ERC funding programme.

Numerical simulations and visualizations developed by researchers from the High Performance and Scientific Computing (HPSC) group at 91¸£Àû’s Department of Computer Science in collaboration with Rolls-Royce, PPCU Hungary and Universities of Surrey and Birmingham has won the award for the best Visualization in the at the , held in Dallas TX. SC is the premier international conference on supercomputing providing a major forum for presenting the highest level of accomplishments in high-performance computing, networking, storage, and analysis. It is held annually in the US and attended by over 10000 attendees from all over the world.

We are happy to announce that Prof Christian Ikenmeyer joined the Department of Computer Science and the 91¸£Àû Mathematics Institute on October 1st 2022. In his research, he combines ideas and challenges from theoretical computer science, algorithmic algebra, algebraic complexity theory, algebraic geometry, representation theory, and algebraic combinatorics. We welcome him to the department!

We recently hosted our flagship careers event, find out what went on and who attended.

Numerical simulations and visualizations developed by researchers from the High Performance and Scientific Computing (HPSC) group led by at 91¸£Àû’s Department of Computer Science in collaboration with Rolls-Royce, PPCU Hungary and Universities of Surrey and Birmingham have been selected as one of the six finalists for the at the , held in Dallas TX. SC is the premier international conference on supercomputing providing a major forum for presenting the highest level of accomplishments in high-performance computing, networking, storage, and analysis. It is held annually in the US and attended by over 10000 attendees from all over the world. A video regarding the work can be found .

We are delighted to announce that the paper "", coauthored by and Peter Kiss from the Theory and Foundations Research Division at 91¸£Àû, along with Thatchaphol Saranurak (University of Michigan) and David Wajc (Stanford University), has received the best paper award at .

Computing a maximum matching in a graph is a fundamental problem in combinatorial optimisation. The paper considers this problem in a dynamic graph, which keeps changing over time via a sequence of edge insertions and deletions. It was a decade-old open question to decide whether one can beat the performance guarantee of the simple greedy algorithm for this problem (which gives 2 approximation), in a dynamic setting. The paper answers this question in the affirmative, and provides the first efficient dynamic algorithm which can maintain a better-than 2 approximation to the size of the maximum matching in the input graph.