This post is technical

Today I released a new paper on the arXiv with my co-author Sean Barrett. In this paper we look at the problem of preparing cluster states using non-deterministic enangling gates. We introduce a numerical approach for simulating preparation procedures and use this to estimate how many gate operations are required when preparing large cluster states. We examine a few different types of entangling gates, as well as different preparation ‘strategies’ (i.e. algorithms for constructing large clusters from single qubits). For different gates and strategies we consider how the required number of gate operations scales with the success probability of the gate.

You can read our paper here.