### Resumen

Searching and sorting are used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is a partial search. For example, an exact address of the target item is given by a sequence of many bits, but we need to know only some of them. More generally, a partial search considers the problem in which a database is separated into several blocks and we want to find a block with the target item, not the target item itself. In this paper, we reformulate a quantum partial search algorithm in terms of group theory.

Idioma original | English |
---|---|

Páginas (desde-hasta) | 783-793 |

Número de páginas | 11 |

Publicación | Progress of Theoretical Physics |

Volumen | 116 |

N.º | 5 |

DOI | |

Estado | Published - nov 2006 |

### Huella dactilar

### ASJC Scopus subject areas

- Physics and Astronomy (miscellaneous)

### Citar esto

*Progress of Theoretical Physics*,

*116*(5), 783-793. https://doi.org/10.1143/PTP.116.783

}

*Progress of Theoretical Physics*, vol. 116, n.º 5, pp. 783-793. https://doi.org/10.1143/PTP.116.783

**Group theoretical formulation of a quantum partial search algorithm.** / Korepin, Vladimir E.; Vallilo, Brenno C.

Resultado de la investigación: Article

TY - JOUR

T1 - Group theoretical formulation of a quantum partial search algorithm

AU - Korepin, Vladimir E.

AU - Vallilo, Brenno C.

PY - 2006/11

Y1 - 2006/11

N2 - Searching and sorting are used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is a partial search. For example, an exact address of the target item is given by a sequence of many bits, but we need to know only some of them. More generally, a partial search considers the problem in which a database is separated into several blocks and we want to find a block with the target item, not the target item itself. In this paper, we reformulate a quantum partial search algorithm in terms of group theory.

AB - Searching and sorting are used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is a partial search. For example, an exact address of the target item is given by a sequence of many bits, but we need to know only some of them. More generally, a partial search considers the problem in which a database is separated into several blocks and we want to find a block with the target item, not the target item itself. In this paper, we reformulate a quantum partial search algorithm in terms of group theory.

UR - http://www.scopus.com/inward/record.url?scp=33847716637&partnerID=8YFLogxK

U2 - 10.1143/PTP.116.783

DO - 10.1143/PTP.116.783

M3 - Article

AN - SCOPUS:33847716637

VL - 116

SP - 783

EP - 793

JO - Progress of Theoretical Physics

JF - Progress of Theoretical Physics

SN - 0033-068X

IS - 5

ER -