Jonas Helsen

MaRDI QIDQ2059900zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Noise-mitigated randomized measurements and self-calibrating shadow estimation (available as arXiv preprint)	N/A	Paper
Trotter error and gate complexity of the SYK and sparse SYK models (available as arXiv preprint)	2026-01-01	Paper
Random regular graph states are complex at almost any depth (available as arXiv preprint)	2024-01-01	Paper
Thrifty shadow estimation: re-using quantum circuits and bounding tails	2022-12-12	Paper
Thrifty shadow estimation: re-using quantum circuits and bounding tails (available as arXiv preprint)	2022-01-01	Paper
The complexity of the vertex-minor problem Information Processing Letters	2021-12-14	Paper
Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates	2020-11-25	Paper
Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete Journal of Mathematical Physics	2020-05-22	Paper
Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates (available as arXiv preprint)	2020-01-01	Paper
Transforming graph states to Bell-pairs is NP-Complete	2019-07-18	Paper
The complexity of the vertex-minor problem (available as arXiv preprint)	2019-06-12	Paper
Transforming graph states to Bell-pairs is NP-Complete (available as arXiv preprint)	2019-01-01	Paper
Representations of the multi-qubit Clifford group Journal of Mathematical Physics	2018-08-27	Paper
How to transform graph states using single-qubit operations: computational complexity and algorithms	2018-05-14	Paper
How to transform graph states using single-qubit operations: computational complexity and algorithms (available as arXiv preprint)	2018-01-01	Paper

Research outcomes over time

This page was built for person: Jonas Helsen