The following pages link to Jonas Helsen (Q2059900):
Displaying 6 items.
- The complexity of the vertex-minor problem (Q2059901) (← links)
- Representations of the multi-qubit Clifford group (Q4583101) (← links)
- Counting single-qubit Clifford equivalent graph states is #P-complete (Q5110740) (← links)
- Transforming graph states to Bell-pairs is NP-Complete (Q6322318) (← links)
- Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates (Q6354604) (← links)
- Thrifty shadow estimation: re-using quantum circuits and bounding tails (Q6420326) (← links)
