Translator Disclaimer
13 October 2014 Programming non-trivial algorithms in the measurement-based quantum computation model
Author Affiliations +
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.
© (2014) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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);


Superdense teleportation for space applications
Proceedings of SPIE (May 22 2014)
Quantum teleportation over a 143-km free-space link
Proceedings of SPIE (November 17 2017)
Methods for scalable optical quantum computation
Proceedings of SPIE (May 25 2005)
Experimental manipulation of five-photon entanglement
Proceedings of SPIE (September 14 2005)
Quantum information processing with Schrödinger cats
Proceedings of SPIE (May 16 2003)
2-photon multiqubit cluster states
Proceedings of SPIE (January 26 2009)

Back to Top