Live briefing
Everything about BHT algorithm
Quantum algorithm
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 and needs to find two inputs that f maps to the same output. The BHT algorithm only makes queries to f, which matches the lower bound of in the black box model. The algorithm can be generalized to r-to-1 function with a complexity of. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: BHT algorithmA 5-minute orientation
- Skim a recent paper: The impact of optimization approximation algorithms on the performance of the BHT-QAOAInfluential work since 2022
- Read the landmark paper: BHT-QAOA: The Generalization of Quantum Approximate Optimization Algorithm to Solve Arbitrary Boolean Problems as HamiltoniansCited 8 times
- Go sideways: Grover's algorithmA closely related topic
- Go sideways: Collision problemA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
🆕 Influential since 2022
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Grover's algorithm In quantum computing, Grover's algorithm, also known as the quantum search algorithm, is a quantum algorithm for unstructured search that finds with high…
- Collision problem The r-to-1 collision problem is an important theoretical problem in complexity theory, quantum computing, and computational mathematics. The collision…
- Quantum algorithm In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the…
- Quantum counting algorithm The Quantum counting algorithm is a quantum algorithm for efficiently counting the number of solutions for a given search problem. The algorithm is based…
- Amplitude amplification Amplitude amplification is a technique in quantum computing that generalizes the idea behind Grover's search algorithm, and gives rise to a family of quantum…
- Simon's problem In computational complexity theory and quantum computing, Simon's problem is a computational problem that is proven to be solved exponentially faster on…
- Hidden subgroup problem The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. It is a generalization of problems including…
- Element distinctness problem In computational complexity theory, the element distinctness problem or element uniqueness problem is the problem of determining whether all the elements…