Career

• 2024-: Associate Professor, Department of Computer Science and co-Director of Warwick Quantum Centre, University of Warwick
• 2025-2027: Royal Society University Research Fellow, Department of Computer Science, University of Warwick
• 2020-2025: 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, University of Cambridge

Research interests

Quantum Computing and Complexity

I am particularly interested in Classical Simulation for Quantum Computations, Quantum Algorithms, Quantum Complexity, Quantum Learning theory and topics in Quantum Information Theory.

Follow @quantSS

Recent research spotlight:

Quanta Magazine: The Quest to Quantify Quantumness

Researchers aim to analyse pangenomes using quantum computingLink opens in a new window

Researchers aim to use quantum computing to assemble and analyse pangenomesLink opens in a new window

I'm leading the following projects:

• Wellcome Leap "Human and Pathogen Quantum Pangenomics" , 2023-2026
• EPSRC Robust and Reliable Quantum Computing Grant "Structure and symmetry in quantum verification", 2023-2025. A short video of the kick-off event is available hereLink opens in a new window.
• Quantum Algorithms for Quantum Field Theory project (jointly with Bipasha Chakraborty), 2022-2025

Preprints

my arXiv preprints are available here.

Selected Publications

• T. Wahl, S. Strelchuk "Simulating quantum circuits using efficient tensor network contraction algorithms with subexponential upper bound", Phys. Rev. Lett. 131, 180601 (2023).
• H. Zheng, Z. Li, J. Liu, S. Strelchuk, R. Kondor "Speeding up learning quantum states through group equivariant convolutional quantum Ansatze", PRX Quantum 4, 020327 (2023) 
• D. Stilck França, S. Strelchuk, M. Studziński, "Efficient classical simulation and benchmarking of quantum processes in the Weyl basis", Phys. Rev. Lett.126, 210502 (2021)
• M. Hebenstreit, R. Jozsa, B. Kraus, S. Strelchuk, and M. Yoganathan, "All Pure Fermionic Non-Gaussian States Are Magic States for Matchgate Computations", Phys. Rev. Lett. 123, 080503 (2019)
• V. Havlicek, S. Strelchuk "Quantum Schur sampling circuits can be strongly simulated", Phys. Rev. Lett. 121, 060505 (2018)
• A. Rocchetto, E. Grant, S. Strelchuk, G. Carleo, S. Severini "Learning hard quantum distributions with variational autoencoders", npj Quantum Information Vol.4, 28 (2018)
• D. Elkouss, S. Strelchuk "Superadditivity of private information for any number of uses of the channel", Phys. Rev. Lett. 115, 040501 (2015)
• F. Brandao, A. Harrow, J. Oppenheim, S. Strelchuk "Quantum Conditional Mutual Information, Reconstructed States, and State Redistribution", Phys. Rev. Lett. 115, 050501 (2015)
• H. Buhrman, L. Czekaj, A. Grudka, M. Horodecki, P. Horodecki, M. Markiewicz, F. Speelman, S. Strelchuk "Quantum communication complexity advantage implies violation of a Bell inequality", PNAS March 22, 2016 vol. 113 no. 12 3191-3196
• D. Elkouss, S. Strelchuk, M. Ozols, W. Matthews, D. Perez-Garcia, T. Cubitt "Unbounded number of channel uses are required to see quantum capacity", Nature Communications 6, 7739 (2015)
• R. Jozsa, A. Miyake, S. Strelchuk "Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation", Quantum Information & Computation Vol. 15, 7-8, 541-556 (2015)
• S. Strelchuk, M. Horodecki, J. Oppenheim “Entanglement Recycling and Generalized Teleportation”, Phys. Rev. Lett. 110, 010505 (2013)
• F. Brandao, J. Oppenheim, S. Strelchuk “When does noise increase the quantum capacity?”, Phys. Rev. Lett. 108, 040501 (2012)

Funding

Support from the following organizations is gratefully acknowledged: