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

Alsing, Paul; Fanto, Michael; Lott, Capt. Gordon; Tison, Christoper C.

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

Full Record
Other Related Research

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 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.

Authors:

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

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

Publication Date:: Wed Jan 01 00:00:00 EST 2014

Research Org.:: Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

Sponsoring Org.:: Work for Others (WFO)

OSTI Identifier:: 1286794

DOE Contract Number:: AC05-00OR22725

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 Non-Trivial Algorithms in the Measurement Based Quantum Computation Model.  United States: N. p., 2014. 
        Web.

Copy to clipboard


                    Alsing, Paul, Fanto, Michael, Lott, Capt. Gordon, & Tison, Christoper C. Programming Non-Trivial Algorithms in the Measurement Based Quantum Computation Model.  United States.

Copy to clipboard


                    Alsing, Paul, Fanto, Michael, Lott, Capt. Gordon, and Tison, Christoper C. 2014.  
        "Programming Non-Trivial Algorithms in the Measurement Based Quantum Computation Model".  United States.  https://www.osti.gov/servlets/purl/1286794.

Copy to clipboard


                    
@article{osti_1286794,

  title        = {Programming Non-Trivial 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 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.},

  doi          = {},

  url          = {https://www.osti.gov/biblio/1286794},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {Wed Jan 01 00:00:00 EST 2014},

  month        = {Wed Jan 01 00:00:00 EST 2014}

}

Copy to clipboard

Conference:

View Conference (0.47 MB)

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Translating Non-Trivial Algorithms from the Circuit Model to the Measurement

Journal Article Smith, IV, Amos; Alsing, Paul; Lott, Capt.; ... - Journal of Modern Optics

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 »« less
Optical spin-1 chain and its use as a quantum-computational wire

Journal Article Darmawan, Andrew; Bartlett, Stephen - Physical Review. A

Measurement-based quantum computing, a powerful alternative to the standard circuit model, proceeds using only local adaptive measurements on a highly entangled resource state of many spins on a graph or lattice. Along with the canonical cluster state, the valence-bond solid ground state on a chain of spin-1 particles, studied by Affleck, Kennedy, Lieb, and Tasaki (AKLT), is such a resource state. We propose a simulation of this AKLT state using linear optics, wherein we can make use of the high-fidelity projective measurements that are commonplace in quantum-optical experiments, and describe how quantum logic gates can be performed on this chain.more »« less
https://doi.org/10.1103/PHYSREVA.82.012328
New Approaches to Quantum Computing using Nuclear Magnetic Resonance Spectroscopy

Technical Report Colvin, M; Krishnan, V

The power of a quantum computer (QC) relies on the fundamental concept of the superposition in quantum mechanics and thus allowing an inherent large-scale parallelization of computation. In a QC, binary information embodied in a quantum system, such as spin degrees of freedom of a spin-1/2 particle forms the qubits (quantum mechanical bits), over which appropriate logical gates perform the computation. In classical computers, the basic unit of information is the bit, which can take a value of either 0 or 1. Bits are connected together by logic gates to form logic circuits to implement complex logical operations. The expansionmore »« less
https://doi.org/10.2172/15007477

Full Text Available
Grover-algorithm-like operator using only single-qubit gates

Journal Article Kato, G - Physical Review. A

We propose a quantum circuit for the quantum search problem. The quantum circuit is superior to Grover's algorithm in some realistic cases. The reasons for the superiority are in short as follows: In the quantum circuit proposed in this paper, all the operators except for the oracle can be written as direct products of single-qubit gates. Such separable operators can be executed much faster than multiparticle operators, such as controlled-NOT gates and Toffoli gates, in many realistic systems. The idea of this quantum circuit is inspired by the Hamiltonian used in the adiabatic quantum computer. In addition, the scaling ofmore »« less
https://doi.org/10.1103/PhysRevA.72.032319
Hybrid quantum computation

Journal Article Sehrawat, Arun; Englert, Berthold-Georg; Zemann, Daniel - Physical Review. A

We present a hybrid model of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model, part of a quantum circuit is simulated by unitary evolution and the rest by measurements on star graph states, thereby combining the advantages of the two standard quantum computation models. In the hybrid model, a complicated unitary gate under simulation is decomposed in terms of a sequence of single-qubit operations, the controlled-z gates, and multiqubit rotations around the z axis. Every single-qubit and the controlled-z gate are realized by a respective unitary evolution, and every multiqubit rotation is executedmore »« less
https://doi.org/10.1103/PHYSREVA.83.022317

Similar Records