Translating NonTrivial Algorithms from the Circuit Model to the Measurement
Abstract
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 prescriptions can be generalized to implement any logical circuit model operation with appropriate single photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).
 Authors:
 ORNL
 Air Force Research Laboratory
 Publication Date:
 Research Org.:
 Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
 Sponsoring Org.:
 Work for Others (WFO)
 OSTI Identifier:
 1185632
 DOE Contract Number:
 DEAC0500OR22725
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Journal of Modern Optics
 Country of Publication:
 United States
 Language:
 English
Citation Formats
Smith IV, Amos M, Alsing, Paul, Lott, Capt. Gordon, and Fanto, Michael. Translating NonTrivial Algorithms from the Circuit Model to the Measurement. United States: N. p., 2015.
Web.
Smith IV, Amos M, Alsing, Paul, Lott, Capt. Gordon, & Fanto, Michael. Translating NonTrivial Algorithms from the Circuit Model to the Measurement. United States.
Smith IV, Amos M, Alsing, Paul, Lott, Capt. Gordon, and Fanto, Michael. 2015.
"Translating NonTrivial Algorithms from the Circuit Model to the Measurement". United States.
doi:.
@article{osti_1185632,
title = {Translating NonTrivial Algorithms from the Circuit Model to the Measurement},
author = {Smith IV, Amos M and Alsing, Paul and Lott, Capt. Gordon and Fanto, Michael},
abstractNote = {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 prescriptions can be generalized to implement any logical circuit model operation with appropriate single photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).},
doi = {},
journal = {Journal of Modern Optics},
number = ,
volume = ,
place = {United States},
year = 2015,
month = 1
}

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 measurementsmore »

Quantumcircuit model of Hamiltonian search algorithms
We analyze three different quantum search algorithms, namely, the traditional circuitbased Grover's algorithm, its continuoustime analog by Hamiltonian evolution, and the quantum search by local adiabatic evolution. We show that these algorithms are closely related in the sense that they all perform a rotation, at a constant angular velocity, from a uniform superposition of all states to the solution state. This makes it possible to implement the two Hamiltonianevolution algorithms on a conventional quantum circuit, while keeping the quadratic speedup of Grover's original algorithm. It also clarifies the link between the adiabatic search algorithm and Grover's algorithm. 
Circuit model of the ITERlike antenna for JET and simulation of its control algorithms
The ITERlike Antenna (ILA) for JET [1] is a 2 toroidal by 2 poloidal array of Resonant Double Loops (RDL) featuring invessel matching capacitors feeding RF current straps in conjugateT manner, a low impedance quarterwave impedance transformer, a service stub allowing hydraulic actuator and water cooling services to reach the aforementioned capacitors and a 2nd stage phaseshifterstub matching circuit allowing to correct/choose the conjugateT working impedance. Toroidally adjacent RDLs are fed from a 3dB hybrid splitter. It has been operated at 33, 42 and 47MHz on plasma (20082009) while it presently estimated frequency range is from 29 to 49MHz. Atmore » 
Computational algorithms for analysis of data from thinfilm thermoresistors on a radioelectronic printed circuit board
In the paper, the data analysis is considered for thinfilm thermoresistors coated on to a radioelectronic printed circuit board to determine possible zones of its overheating. A mathematical model consists in an underdetermined system of linear algebraic equations with an infinite set of solutions. For computing a more real solution, two additional conditions are used: the smoothness of a solution and the positiveness of an increase of temperature during overheating. Computational experiments demonstrate that an overheating zone is determined exactly with a tolerable accuracy of temperature in it. 
Trivial influences: A doubly stochastic Poisson process model permits the detection of arbitrarily small electromagnetic signals
If a weak, exogenous, extremely lowfrequency (ELF) electric or magnetic field is to produce biological sequelae, then there must exist averaging sufficient to lift some primary effect of that field above the endogenous stochastic variations of the biological system. One way in which a field could accomplish this is by changing the intensity of some stochastic operation that controls an important and not trivially reversible biological transformation. In this paper, this operation is modeled as a doubly stochastic Poisson process. It is then shown, first, that (in theory) even a minuscule exogenous influence might appreciably shift the incidence of amore »