Busca quântica de dados XML usando algoritmo de Grover
This paper presents a quantum search algorithm implementation with small modifications. The algorithm idea is to be hybrid, capable to run on classical systems and quantum systems. We present the concepts of quantum search and introduced a pseudo-framework able to generate code for classical compute...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2013 |
| País: | Brasil |
| Institución: | Universidade Estadual Paulista (UNESP) |
| Repositorio: | Repositório Institucional da UNESP |
| Idioma: | portugués |
| OAI Identifier: | oai:repositorio.unesp.br:11449/122645 |
| Acceso en línea: | http://fmpfm.edu.br/intercienciaesociedade/colecao/online/vol2_n1_on_line.html http://hdl.handle.net/11449/122645 |
| Access Level: | acceso abierto |
| Palabra clave: | busca quântica grover QCL emaranhamento sobreposição quantum search qcl entanglement superposition |
| Sumario: | This paper presents a quantum search algorithm implementation with small modifications. The algorithm idea is to be hybrid, capable to run on classical systems and quantum systems. We present the concepts of quantum search and introduced a pseudo-framework able to generate code for classical computers (C++) and quantum computers (QCL). The algorithms were submitted to simulations, which resulted in a comparative study of the operation of Grover’s algorithm on both systems, carrying out searches in a mass of data in XML format files. As a result, we see very similar numbers between classical and quantum systems, this creates an expectation that the search in real quantum computers is much more efficient. |
|---|