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

Conference · Wed Jan 01 00:00:00 EST 2014

OSTI ID:1286794

Alsing, Paul ^[1]; Fanto, Michael ^[1]; Lott, Capt. Gordon ^[1]; Tison, Christoper C. ^[1]

---

1. United States Air Force Research Laboratory, Wright-Patterson Air Force Base

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.

• Research Organization: Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
• Sponsoring Organization: Work for Others (WFO)
• DOE Contract Number: AC05-00OR22725
• OSTI ID: 1286794
• Resource Relation: Conference: SPIE Security and defense, Amsterdam, Netherlands, 20140922, 20140922
• Country of Publication: United States
• Language: English