How to transform graph states using single-qubit operations: computational complexity and algorithms. - Axel Dahlberg; Jonas Helsen; Stephanie Wehner (CoRR, 2018)

Counting single-qubit Clifford equivalent graph states is #P-Complete. - Axel Dahlberg; Jonas Helsen; Stephanie Wehner (CoRR, 2019)

Quantum information in the real world: Diagnosing and correcting errors in practical quantum devices. - Jonas Helsen (2019)

Transforming graph states to Bell-pairs is NP-Complete. - Axel Dahlberg; Jonas Helsen; Stephanie Wehner (Quantum, 2020)

The complexity of the vertex-minor problem. - Axel Dahlberg; Jonas Helsen; Stephanie Wehner (Inf. Process. Lett., 2022)

Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates. - Jonas Helsen; Sepehr Nezami; Matthew Reagor; Michael Walter 005 (Quantum, 2022)

Fermionic Hamiltonians without trivial low-energy states. - Yaroslav Herasymenko; Anurag Anshu; Barbara M. Terhal; Jonas Helsen (CoRR, 2023)

Optimizing sparse fermionic Hamiltonians. - Yaroslav Herasymenko; Maarten Stroeks; Jonas Helsen; Barbara M. Terhal (Quantum, 2023)

Random regular graph states are complex at almost any depth. - Soumik Ghosh; Dominik Hangleiter; Jonas Helsen (CoRR, 2024)

Tolerant Testing of Stabilizer States with a Polynomial Gap via a Generalized Uncertainty Relation. - Zongbo Bao; Philippe van Dordrecht; Jonas Helsen (STOC, 2025)

Single-Copy Stabilizer Testing. - Marcel Hinsche; Jonas Helsen (STOC, 2025)

Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians. - Harry Buhrman; Jonas Helsen; Jordi Weggemans (Quantum, 2025)