Skip to main content
SHARE
Publication

Programming Non-Trivial Algorithms in the Measurement Based Quantum Computation Model...

by Paul Alsing, Michael Fanto, Gordon Lott, Christoper Tison
Publication Type
Conference Paper
Journal Name
Proceedings of SPIE
Publication Date
Volume
N/A
Conference Name
SPIE Security and defense
Conference Location
Amsterdam, Netherlands
Conference Date

We provide a set of prescriptions for implementing a quantum circuit model algorithm as measurement based quantum computing (MBQC) algorithm1, 2 via a large cluster state. As means of illustration we draw upon our numerical modeling experience to describe a large graph state capable of searching a logical 8 element list (a non-trivial version of Grover's algorithm3 with feedforward). We develop several prescriptions based on analytic evaluation of cluster states and graph state equations which can be generalized into any circuit model operations. Such a resulting cluster state will be able to carry out the desired operation with appropriate measurements and feed forward error correction. We also discuss the physical implementation and the analysis of the principal 3-qubit entangling gate (Toffoli) required for a non-trivial feedforward realization of an 8-element Grover search algorithm.