Jonas Helsen

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 10

Top Topics

Similarity Scores

Computational Complexity

Top Venues

Inf. Process. Lett.

Delft University of Technology, Netherlands (PHD)

Education History

Delft University of Technology, Netherlands

PHD

Publications

Harry Buhrman, Jonas Helsen, Jordi Weggemans
Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians. CoRR (2024)
Yaroslav Herasymenko, Anurag Anshu, Barbara M. Terhal, Jonas Helsen
Fermionic Hamiltonians without trivial low-energy states. CoRR (2023)
Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, Barbara M. Terhal
Optimizing sparse fermionic Hamiltonians. Quantum 7 (2023)
Jonas Helsen, Sepehr Nezami, Matthew Reagor, Michael Walter
Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates. Quantum 6 (2022)
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
The complexity of the vertex-minor problem. Inf. Process. Lett. 175 (2022)
Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen, Barbara M. Terhal
Optimizing sparse fermionic Hamiltonians. CoRR (2022)
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
Transforming graph states to Bell-pairs is NP-Complete. Quantum 4 (2020)
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
Transforming graph states to Bell-pairs is NP-Complete. CoRR (2019)
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
Counting single-qubit Clifford equivalent graph states is #P-Complete. CoRR (2019)
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
How to transform graph states using single-qubit operations: computational complexity and algorithms. CoRR (2018)