Implementing quantum algorithms is essential for quantum computation. We study the implementation of three quantum algorithms on a two-dimensional temporal continuous-variable cluster state. We first review the generation of temporal cluster states and the implementation of gates using the measurement-based model. Alongside this we discuss methods to introduce non-Gaussianity into the cluster states. The first algorithm we consider is Gaussian boson sampling in which only Gaussian unitaries need to be implemented. Taking into account the fact that input states are also Gaussian, the errors due to the effect of finite squeezing can be partially corrected and a high fidelity can be achieved, provided a moderate amount of online squeezing is available. This helps to construct a large Gaussian boson sampling machine. The second algorithm is the continuous-variable instantaneous quantum polynomial circuit in which one needs to implement non-Gaussian gates, such as the cubic phase gate. We discuss several methods of implementing the cubic phase gate and fit them into the temporal cluster state architecture. The third algorithm is the continuous-variable version of Grover's search algorithm, the main challenge of which is the implementation of the inversion operator. We propose a method to implement the inversion operator by injecting a resource state into a teleportation circuit. The resource state is simulated using the Strawberry Fields quantum software package.

• Received 10 July 2018

DOI:https://doi.org/10.1103/PhysRevA.98.032316