Programming NonTrivial Algorithms in the Measurement Based Quantum Computation Model
Abstract
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 nontrivial 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 3qubit entangling gate (Toffoli) required for a nontrivial feedforward realization of an 8element Grover search algorithm.
 Authors:
 United States Air Force Research Laboratory, WrightPatterson Air Force Base
 Publication Date:
 Research Org.:
 Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
 Sponsoring Org.:
 Work for Others (WFO)
 OSTI Identifier:
 1286794
 DOE Contract Number:
 AC0500OR22725
 Resource Type:
 Conference
 Resource Relation:
 Conference: SPIE Security and defense, Amsterdam, Netherlands, 20140922, 20140922
 Country of Publication:
 United States
 Language:
 English
Citation Formats
Alsing, Paul, Fanto, Michael, Lott, Capt. Gordon, and Tison, Christoper C. Programming NonTrivial Algorithms in the Measurement Based Quantum Computation Model. United States: N. p., 2014.
Web.
Alsing, Paul, Fanto, Michael, Lott, Capt. Gordon, & Tison, Christoper C. Programming NonTrivial Algorithms in the Measurement Based Quantum Computation Model. United States.
Alsing, Paul, Fanto, Michael, Lott, Capt. Gordon, and Tison, Christoper C. 2014.
"Programming NonTrivial Algorithms in the Measurement Based Quantum Computation Model". United States.
doi:. https://www.osti.gov/servlets/purl/1286794.
@article{osti_1286794,
title = {Programming NonTrivial Algorithms in the Measurement Based Quantum Computation Model},
author = {Alsing, Paul and Fanto, Michael and Lott, Capt. Gordon and Tison, Christoper C.},
abstractNote = {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 nontrivial 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 3qubit entangling gate (Toffoli) required for a nontrivial feedforward realization of an 8element Grover search algorithm.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2014,
month = 1
}

We provide a set of prescriptions for implementing a circuit model algorithm as measurement based quantum computing via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptionsmore »

Measurementbased quantum computation beyond the oneway model
We introduce schemes for quantum computing based on local measurements on entangled resource states. This work elaborates on the framework established in Gross and Eisert [Phys. Rev. Lett. 98, 220503 (2007); quantph/0609149]. Our method makes use of tools from manybody physicsmatrix product states, finitely correlated states, or projected entangled pairs statesto show how measurements on entangled states can be viewed as processing quantum information. This work hence constitutes an instance where a quantum information problemhow to realize quantum computationwas approached using tools from manybody theory and not vice versa. We give a more detailed description of the setting and presentmore » 