A realization scheme for quantum multiobject search
Chapter

 Overview

 Identity

 Additional Document Info

 View All

Overview
abstract

© 2008 by Taylor & Francis Group, LLC. We study the quantum circuit design using 1bit and 2bit unitary gates for the iterations of the multiobject quantum search algorithm. The oracle block is designed in order to efficiently implement any signflipping operations. A chief ingredient in the design is the permutation operator which maps a set of search targets to another set on which the signflipping operation can be easily done. Such a proposed algorithmic approach implicates a minimal symmetric group generation problem: how to generate elements of a symmetric group using the smallest number of concatenations with a set of given generators. For the general case, this is an open problem. We indicate how the complexity issues depend on the solution of this problem through simple examples.
author list (cited authors)

Diao, Z., Chen, G., & Shiue, P.
Book Title

Mathematics of Quantum Computation and Quantum Technology
publication date
Identity
International Standard Book Number (ISBN) 13
Additional Document Info