Share Email Print
cover

Proceedings Paper

Programming non-trivial algorithms in the measurement-based quantum computation model
Author(s): P. M. Alsing; A. M. Smith; M. L. Fanto; C. C. Tison; G. E. Lott
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We provide a set of prescriptions for implementing a quantum circuit model algorithm as measurement based quantum computing (MBQC) algorithm 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 algorithm 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 (Tooli) required for a non-trivial feedforward realization of an 8-element Grover search algorithm.

Paper Details

Date Published: 13 October 2014
PDF: 19 pages
Proc. SPIE 9254, Emerging Technologies in Security and Defence II; and Quantum-Physics-based Information Security III, 92540I (13 October 2014); doi: 10.1117/12.2067490
Show Author Affiliations
P. M. Alsing, Air Force Research Lab. (United States)
A. M. Smith, Oak Ridge National Lab. (United States)
M. L. Fanto, Air Force Research Lab. (United States)
C. C. Tison, Air Force Research Lab. (United States)
G. E. Lott, Air Force Research Lab. (United States)


Published in SPIE Proceedings Vol. 9254:
Emerging Technologies in Security and Defence II; and Quantum-Physics-based Information Security III
Keith L. Lewis; Richard C. Hollins; Thomas J. Merlet; Alexander Toet; Mark T. Gruneisen; Miloslav Dusek; John G. Rarity, Editor(s)

© SPIE. Terms of Use
Back to Top