Adam Wesołowski
About Me
Welcome to my personal webpage. I am Adam, a PhD student at Royal Holloway. I previously read Theoretical Physics (BSc Hons) at Lancaster University. My primary area of research is quantum algorithms.
Here's my google scholar.
Here's my Linkedin.
Research Interests:
I am currently focusing on quantum algorithms for fundamental graph problems and topological data analysis (qTDA). I am also interested in quantum complexity theory, quantum machine learning techniques, quantum tomography techniques.Events:
- YQIS conference 04-08.11.2024 Paris, France
- QURIE conference 02-04.10.2024 Warsaw, Poland
- TQC 09-13.09.2024 online (video presentation soon!)
- ALGO2024 Royal Holloway, London, UK
- FQC (Foundations of Quantum Computing conference) 02-05.09.2024 London, UK
- One day meeting in combinatorics 21.05.2024 Oxford, UK
- QCTIP 2024 (Poster presentation) 16-19.04.2024 Edinburgh, UK
- CCHM 06-07.01.2024 Oxford, UK
- QIS 2024 26-28.02.2024 Dubai, UAE
- QCTIP 2023 (Poster presentation) 16-18.04.2024 Cambridge, UK
Education
- Fall 2024; Visiting PhD student at IRIF at University Paris Cite.
- 2023- PhD student at Royal Holloway Univeristy of London. Supervisor: Stephen Piddock.
- 2020-2023 BSc (Hons) Theoretical Physics at Lancaster University. BSc project: "Hybrid Quantum Computation of Molecular Energies "
- 2017-2020 III High School in Wroclaw, Poland.
Publications
Contact
Email: adam.wesolowski.2023@live.rhul.ac.uk
Office: Bedford Building, Royal Holloway University of London
News
- 11.2024: My talk about quantum fine grained complexity at the Warsaw Quantum Computing event, organised by Quantum AI Foundation in Poland. The talk is available on YouTube
- 08.2024: My first paper is now available on arxiv, the work will also be presented during TQC 2024. The paper introduces two new quantum algorithms based on sampling the quantum flow state. The problem that the algorithms solve is one of the most fundamental problems in graph theory: the shortest path-finding problem. The problem is formulated as follows: given two vertices called s and t in an undirected, weighted graph G(m,n) with m edges and n vertices, find the shortest path between s and t. The best classical algorithm is not the famous Dijkstra algorithm, but an algorithm presented by Mikkel Thorup in 1999 which requires only O(m) steps (but works only for psoitive integer weights). The time complexity of our algorithms is the lowest known, but the algorithms demonstrate the superior performance only on restricted classes of graphs. I am quite curious whether there exist an equally fast algorithm for any graph. The framework seems quite promising and I am currently writing a follow-up work that extends the scope of applications to other fundamental graph problems. A big shout-out to my supervisor and a co-author of the paper Dr. Stephen Piddock, and Dr. Simon Apers who, during his visit to Royal Holloway, provided us with a number of valuable insights.