Jonas Helsen

Full Name

J. Helsen

Email

Jonas.Helsen@cwi.nl

Phone

+31 20 592 4076

Room

L233

Department(s)

Algorithms and Complexity, Algorithms and Complexity

Function(s)

Scientific Staff Member

Jonas Helsen

Herasymenko, Y., Anshu, A., Terhal, B., & Helsen, J. (2024). Fermionic Hamiltonians without trivial low-energy states. Physical Review A: Atomic, Molecular and Optical Physics, 109(5). doi:10.1103/PhysRevA.109.052431
Helsen, J., & Walter, M. (2023). Thrifty shadow estimation: Reusing quantum circuits and bounding tails. Physical Review Letters, 131(24). doi:10.1103/PhysRevLett.131.240602
Helsen, J., Ioannou, M., Kitzinger, J., Onorati, E., Werner, A. H., Eisert, J., & Roth, I. (2023). Shadow estimation of gate-set properties from random sequences. Nature Communications, 14(1), 5039:1–5039:11. doi:10.1038/s41467-023-39382-9
Herasymenko, Y., Stroeks, M., Helsen, J., & Terhal, B. (2023). Optimizing sparse fermionic Hamiltonians. Quantum, 7, 1081:1–1081:34. doi:10.22331/q-2023-08-10-1081
Lawrie, W. I. L., Rimbach-Russ, M., van Riggelen, F., Hendrickx, N. W., de Snoo, S. L., Sammak, A., … Veldhorst, M. (M.). (2023). Simultaneous single-qubit driving of semiconductor spin qubits at the fault-tolerant threshold. Nature Communications, 14. doi:10.1038/s41467-023-39334-3
Stroeks, M., Helsen, J., & Terhal, B. (2022). Spectral estimation for Hamiltonians: A comparison between classical imaginary-time evolution and quantum real-time evolution. New Journal of Physics, 24(10), 103024:1–103024:31.
Helsen, J., Roth, I., Onorati, E., Werner, A. H., & Eisert, J. (2022). General framework for randomized benchmarking. PRX Quantum, 3(2), 020357:1–020357:54. doi:10.1103/PRXQuantum.3.020357
Dahlberg, A., Helsen, J., & Wehner, S. (2022). The complexity of the vertex-minor problem. Information Processing Letters, 175, 106222:1–106222:8. doi:10.1016/j.ipl.2021.106222
Helsen, J., Nezami, S., Reagor, M., & Walter, M. (2022). Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates. Quantum, 6. doi:10.22331/q-2022-02-21-657
Dahlberg, A., Helsen, J., & Wehner, S. (2020). Transforming graph states to Bell-pairs is NP-Complete. Quantum, 4. doi:10.22331/q-2020-10-22-348

Editor: Editor for the journal Quantum

Randomness in quantum computation (None)
Rotate, measure, repeat: better and cheaper error characterisation for quantum computers (None)
Quantum Software Consortium (QSC)

Quantum Information Theory(3 Feb 2025 - 23 May 2025)
Quantum Information Theory(5 Feb 2024 - 24 May 2024)