BHT algorithm
id:
bht-algorithm-194-17058558
title:
BHT algorithm
text:
In quantum computing, the Brassard-Høyer-Tapp algorithm or BHT algorithm is a quantum algorithm that solves the collision problem. In this problem, one is given n and an r-to-1 function f : { 1 , … , n } → { 1 , … , n } and needs to find two inputs that f maps to the same output. The BHT algorithm only makes O queries to f, which matches the lower bound of Ω in the black box model. The algorithm was discovered by Gilles Brassard, Peter Høyer, and Alain Tapp in 1997. It uses Grover's algorithm, w
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/BHT_algorithm
date created:
date modified:
2023-09-15T19:32:51Z
main entity:
{"identifier":"Q17005624","url":"https://www.wikidata.org/entity/Q17005624"}
image:
fields total:
13
integrity:
13