Programming non-trivial algorithms in the measurement-based quantum computation model

P. M. Alsing; A. M. Smith; M. L. Fanto; C. C. Tison; G. E. Lott

doi:10.1117/12.2067490

Translator Disclaimer

13 October 2014 Programming non-trivial algorithms in the measurement-based quantum computation model

P. M. Alsing, A. M. Smith, M. L. Fanto, C. C. Tison, G. E. Lott

Author Affiliations +

Proceedings Volume 9254, Emerging Technologies in Security and Defence II; and Quantum-Physics-based Information Security III; 92540I (2014) https://doi.org/10.1117/12.2067490
Event: SPIE Security + Defence, 2014, Amsterdam, Netherlands

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.

Citation Download Citation

P. M. Alsing, A. M. Smith, M. L. Fanto, C. C. Tison, and G. E. Lott "Programming non-trivial algorithms in the measurement-based quantum computation model", Proc. SPIE 9254, Emerging Technologies in Security and Defence II; and Quantum-Physics-based Information Security III, 92540I (13 October 2014); https://doi.org/10.1117/12.2067490

ACCESS THE FULL ARTICLE