Metraipolis › archive › dc_aebe592cffee

BHT algorithm — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/BHT_algorithm
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-07T16:51:49.059Z
SHA-256 of the archived text: e09e58cd83f200b860380bbbdf765392da90799a2c382933195281830634e009
Stable URL of this page: https://metraipolis.com/documento/dc_aebe592cffee

How to cite

BHT algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/BHT_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_aebe592cffee (Metraipolis archive dc_aebe592cffee, sha256 e09e58cd83f200b860380bbbdf765392da90799a2c382933195281830634e009)

BibTeX

@misc{dcaebe592cffee,
  title = {BHT algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/BHT_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_aebe592cffee; sha256 e09e58cd83f200b860380bbbdf765392da90799a2c382933195281830634e009},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/BHT_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In quantum computing, the Brassard–Høyer–Tapp (BHT) algorithm is a quantum algorithm that solves the collision problem. In this problem, one is given n and an 2-to-1 function f : { 1 , … , n } → { 1 , … , n } {\displaystyle f:\,\{1,\ldots ,n\}\rightarrow \{1,\ldots ,n\}} and needs to find two inputs that f maps to the same output. The BHT algorithm only makes O ( n 1 / 3 ) {\displaystyle O(n^{1/3})} queries to f, which matches the lower bound of Ω ( n 1 / 3 ) {\displaystyle \Omega (n^{1/3})} in the black box model. The algorithm can be generalized to r-to-1 function with a complexity of O ( ( n r ) 1 / 3 ) {\displaystyle O\left(\left({\frac {n}{r}}\right)^{1/3}\right)} . The algorithm was discovered by Gilles Brassard, Peter Høyer, and Alain Tapp in 1997. It uses Grover's algorithm, which was discovered the year before.

Tema degli esploratori: fisica e astronomia (deposito sistematico; ricerca «quantum computing»).
Fonte: Wikipedia in inglese, voce «BHT algorithm» — https://en.wikipedia.org/wiki/BHT_algorithm
Wikidata Q17005624 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q17005624
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/BHT_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1345499270, consultata il 2026-10-07T16:20:00.436Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 22e1fd9b5d17397fbf0ddbcdc3adea60da083542ba46cac08fca2d8d23e50ab0