Jonas Helsen

19 papers A* 2Journal 16
YearRankTypeTitle / Venue / Authors
2026 J jnl
Minimising the number of edges in LC-equivalent graph states.
Quantum
Hemant Sharma, Kenneth Goodenough, Johannes Borregaard, Filip Rozpedek, Jonas Helsen
2026 J jnl
Trotter error and gate complexity of the SYK and sparse SYK models.
Quantum
Yiyuan Chen, Jonas Helsen, Maris Ozols
2025 J jnl
Clifford testing: algorithms and lower bounds.
CoRR
Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht, Jens Eisert, Jop Briët, Jonas Helsen
2025 J jnl
Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians.
Quantum
Harry Buhrman, Jonas Helsen, Jordi Weggemans
2025 A* conf
Single-Copy Stabilizer Testing.
STOC
Marcel Hinsche, Jonas Helsen
2025 A* conf
Tolerant Testing of Stabilizer States with a Polynomial Gap via a Generalized Uncertainty Relation.
STOC
Zongbo Bao, Philippe van Dordrecht, Jonas Helsen
2024 J jnl
Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians.
CoRR
Harry Buhrman, Jonas Helsen, Jordi Weggemans
2024 J jnl
Random regular graph states are complex at almost any depth.
CoRR
Soumik Ghosh, Dominik Hangleiter, Jonas Helsen
2024 J jnl
Single-copy stabilizer testing.
CoRR
Marcel Hinsche, Jonas Helsen
2023 J jnl
Fermionic Hamiltonians without trivial low-energy states.
CoRR
Yaroslav Herasymenko, Anurag Anshu, Barbara M. Terhal, Jonas Helsen
2023 J jnl
Optimizing sparse fermionic Hamiltonians.
Quantum
Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, Barbara M. Terhal
2022 J jnl
Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates.
Quantum
Jonas Helsen, Sepehr Nezami, Matthew J. Reagor, Michael Walter
2022 J jnl
Optimizing sparse fermionic Hamiltonians.
CoRR
Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, Barbara M. Terhal
2022 J jnl
The complexity of the vertex-minor problem.
Inf. Process. Lett.
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
2020 J jnl
Transforming graph states to Bell-pairs is NP-Complete.
Quantum
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
2019 J jnl
Counting single-qubit Clifford equivalent graph states is #P-Complete.
CoRR
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
2019 — —
Quantum information in the real world: Diagnosing and correcting errors in practical quantum devices.
Jonas Helsen
2019 J jnl
Transforming graph states to Bell-pairs is NP-Complete.
CoRR
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
2018 J jnl
How to transform graph states using single-qubit operations: computational complexity and algorithms.
CoRR
Axel Dahlberg, Jonas Helsen, Stephanie Wehner