Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/76335
Type: Artigo de periódico
Title: A new quantum algorithm for solving the minimum searching problem
Author: Kowada, LAB
Lavor, C
Portugal, R
De Figueiredo, CMH
Abstract: In this paper, we propose a new quantum algorithm for solving the minimum searching problem. This algorithm has the same order of time and space complexities as the algorithm proposed by Durr and Hoyer, but it provides a quadratic reduction in the number of measurements. In addition to the correctness and complexity analysis of the algorithm, we present simulation results considering an NP-hard problem.
Subject: minimum searching problem
quantum algorithms
Country: Singapura
Editor: World Scientific Publ Co Pte Ltd
Rights: fechado
Identifier DOI: 10.1142/S021974990800361X
Date Issue: 2008
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000257540500002.pdf215.9 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.