Jonas Helsen
- Full Name
- J. Helsen
- Function(s)
- Researcher - QuSoft
- Jonas.Helsen@cwi.nl
- Telephone
- +31 20 592 4308
- Room
- L230
- Department(s)
- Algorithms and Complexity
Publications
-
Dahlberg, A, Helsen, J, & Wehner, S.D.C. (2020). Transforming graph states to Bell-pairs is NP-Complete. Quantum, 4. doi:10.22331/q-2020-10-22-348
-
Dahlberg, A, Helsen, J, & Wehner, S.D.C. (2020). How to transform graph states using single-qubit operations: computational complexity and algorithms. Quantum Science and Technology, 5(4). doi:10.1088/2058-9565/aba763
-
Dahlberg, A, Helsen, J, & Wehner, S.D.C. (2020). Counting single-qubit Clifford equivalent graph states is #ℙ-complete. Journal of Mathematical Physics, 61(2). doi:10.1063/1.5120591
-
Dirkse, B, Helsen, J, & Wehner, S.D.C. (2019). Efficient unitarity randomized benchmarking of few-qubit Clifford gates. Physical Review A: Atomic, Molecular and Optical Physics, 99(1). doi:10.1103/PhysRevA.99.012315