Sergii Strelchuk
Interests
My research interests include quantum algorithms and their applications (particularly in bioinformatics) as well as classical simulation methods for quantum computation, quantum complexity theory, and quantum learning theory.
A representative snapshot of my current research interests is outlined here. Follow @quantSS on X for updates.
I lead the following projects:
- Wellcome Leap "Human and Pathogen Quantum Pangenomics", 2023-2026 [Selected for Phase 3!]
- EPSRC Robust and Reliable Quantum Computing Grant "Structure and symmetry in quantum verification", 2023-2025.
- (jointly with Bipasha Chakraborty) Quantum Algorithms for Quantum Field Theory project, 2022-2025
The Quantum Cambridge–Oxford–Warwick Colloquium (QCOW)
QCOW is a rotating workshop series dedicated to advancing the study of quantum complexity theory and the theoretical limits of quantum computation. Its meetings center on specific themes, bringing together experts, postdoctoral researchers, and students for tutorial-style lectures, accessible expositions of major recent advances, and sustained exchange on open problems.
The first QCOW, focused on Quantum Low-Depth Complexity, took place in Oxford on 11–12 December 2025; the second, on Quantum Learning Theory, is scheduled for Warwick on 23–24 April 2026.
Selected Publicity
More about broader impact of our work:
MIT Technology Review: Can quantum computers now solve health care problems? (03/2026)
IBM Quantum Readiness Report (12/2025)
World Economic Forum : Quantum Technologies White Paper (12/2025)
Sergii Strelchuk to lead final phase of Wellcome Leap-funded quantum pangenomics project
Sanger Institute collaboration using quantum computing to tackle complex genomic challenges
Quanta Magazine: The Quest to Quantify Quantumness
Researchers aim to use quantum computing to assemble and analyse pangenomes
Developing Hybrid Fermion-to-Qubit Mappings for Efficient Quantum Computing Simulations
Unveiling Mysteries of the Quantum World
Mathematical breakthrough sets out rules for more effective teleportation
List of recent results (since 04/2025):
-
D. Yakymenko, M. Chernyshev, I. Savchenko, and S. Strelchuk, RotorMap and Quantum Fingerprints of DNA Sequences via Rotary Position Embeddings, arXiv:2603.22245 (2026).
-
J. Burkat, S. Strelchuk, and M. Studziński, The Power of Power-of-SWAP: Postselected Quantum Computation with the Exchange Interaction, arXiv:2603.28527 (2026).
-
R. W. Chien, et al., Simulating fermions with a digital quantum computer, Nature Reviews Physics (2026)
-
J. Cudby and S. Strelchuk, Parameterized Quantum Algorithms for Closest String Problems, arXiv:2510.15529 (2025).
-
M. Weisz and S. Strelchuk, Flexible Catalysis, arXiv:2510.01065 (2025).
-
J. Cudby, J. Bonfield, C. Zhou, R. Durbin, and S. Strelchuk, Pangenome-guided sequence assembly via binary optimisation, arXiv:2508.08200 (2025), Briefings in Bioinformatics (Volume 27, Issue 1, January 2026, bbag084)
-
F. M. Creevey, H. T. Hassan, J. McCafferty, L. C. L. Hollenberg, and S. Strelchuk, Scalable Quantum State Preparation for Encoding Genomic Data with Matrix Product States, arXiv:2508.06184 (2025).
-
H. Buhrman, M. Folkertsma, I. Mertz, F. Speelman, S. Strelchuk, S. Subramanian, and Q. Tupker, Quantum Catalytic Space, arXiv:2506.16324 (2025) [TQC 2025].
-
M. Chiew, C. Ibrahim, I. Safro, and S. Strelchuk, Optimal fermion-qubit mappings via quadratic assignment, arXiv:2504.21636 (2025).
-
C. Wille and S. Strelchuk, Classical simulation of parity-preserving quantum circuits, arXiv:2504.19317 (2025).
All papers and preprints are available on my arXiv page.
Biography
- 2024- Associate Professor, Department of Computer Science, University of Oxford
- 2020-2024: Royal Society University Research Fellow, DAMTP, University of Cambridge
- 2017-2019: Leverhulme Early Career Fellow, DAMTP, University of Cambridge
- 2013-2017: John and Delia Agar Research Fellow, Sidney Sussex College, University of Cambridge
- 2009-2013: PhD, DAMTP and Trinity College, University of Cambridge
PhD/DPhil students
- Serban Cercelescu (2025-) [@Oxford, jointly with Aleks Kissinger]
- Mate Weisz (2024-) [@Oxford]
- Orson Ye (2024-) [@Cambridge]
- Jedrzej Burkat (2023-) [@Cambridge, jointly with Crispin Barnes]
- Josh Cudby (2022-2026) [@Cambridge]
- Wilfred Salmon (2021-2024) [@Cambridge]
- Mitchell Chiew (2020-2025) [@Cambridge]
Hiring and Research Opportunities
Together with Dr. Sathya Subramanian, we have several opportunities for researchers interested in quantum computation, with a focus on computational complexity theory, classical simulation, and the development and application of novel quantum algorithms.
Our work addresses fundamental challenges at the frontiers of quantum computing and its applications (in particular -- bioinformatics). Broadly, we are interested in developing algorithm design and analysis tools to realise the potential of quantum computers, while gaining a deeper understanding of the theoretical limits of quantum computation.
- Classical simulation of quantum systems and the limits of efficient computation.
- Quantum complexity theory and quantum learning theory.
- Quantum algorithms and their applications, including emerging directions in bioinformatics and pangenomics .
Our research centres on the mathematical theory and techniques that underpin computation and the physical principles of information. We welcome inquiries from outstanding students and postdoctoral researchers with a strong interest in the intersection of algorithms, physics, and mathematics. Candidates with backgrounds in mathematics, theoretical computer science, theoretical physics, or related disciplines are particularly well suited. For more details, see:
We encourage candidates to contact us by email. Please include: (1) Your CV; and (2) a 1–2 paragraph cover letter describing relevant past research (if any), your future interests, and why you would like to work with us. As we receive a high volume of inquiries, we may take at least a week to reply.