Jonas Helsen

According to our database, Jonas Helsen authored at least 16 papers between 2018 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Catalytic entanglement transformations with noisy hardware.

Hemant Sharma, Aleksandr Mokeev, Jonas Helsen, Johannes Borregaard

Quantum, 2026

Minimising the number of edges in LC-equivalent graph states.

Hemant Sharma, Kenneth Goodenough, Johannes Borregaard, Filip Rozpedek, Jonas Helsen

Quantum, 2026

Trotter error and gate complexity of the SYK and sparse SYK models.

Yiyuan Chen, Jonas Helsen, Maris Ozols

Quantum, 2026

Clifford Testing: Algorithms and Lower Bounds.

Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht, Jens Eisert, Jop Briët, Jonas Helsen

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians.

Harry Buhrman, Jonas Helsen, Jordi Weggemans

Quantum, 2025

Single-Copy Stabilizer Testing.

Marcel Hinsche, Jonas Helsen

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Tolerant Testing of Stabilizer States with a Polynomial Gap via a Generalized Uncertainty Relation.

Zongbo Bao, Philippe van Dordrecht, Jonas Helsen

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Random regular graph states are complex at almost any depth.

Soumik Ghosh, Dominik Hangleiter, Jonas Helsen

CoRR, 2024

2023

Optimizing sparse fermionic Hamiltonians.

Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, Barbara M. Terhal

Quantum, August, 2023

Fermionic Hamiltonians without trivial low-energy states.

Yaroslav Herasymenko, Anurag Anshu, Barbara M. Terhal, Jonas Helsen

CoRR, 2023

2022

Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates.

Jonas Helsen, Sepehr Nezami, Matthew J. Reagor, Michael Walter

Quantum, 2022

The complexity of the vertex-minor problem.

Axel Dahlberg, Jonas Helsen, Stephanie Wehner

Inf. Process. Lett., 2022

2020

Transforming graph states to Bell-pairs is NP-Complete.

Axel Dahlberg, Jonas Helsen, Stephanie Wehner

Quantum, 2020

2019

Quantum information in the real world: Diagnosing and correcting errors in practical quantum devices.

Jonas Helsen

PhD thesis, 2019

Counting single-qubit Clifford equivalent graph states is #P-Complete.

Axel Dahlberg, Jonas Helsen, Stephanie Wehner

CoRR, 2019

2018

How to transform graph states using single-qubit operations: computational complexity and algorithms.

Axel Dahlberg, Jonas Helsen, Stephanie Wehner

CoRR, 2018