Bernstein–Vazirani algorithm
Quantum algorithm
The Bernstein–Vazirani algorithm, which solves the Bernstein–Vazirani problem, is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in 1997. It is a restricted version of the Deutsch–Jozsa algorithm where instead of distinguishing between two different classes of functions, it tries to learn a string encoded in a function.
Nº Q65053013 ★
Common · Knowledge
Bernstein–Vazirani algorithm
Quantum algorithm
The Bernstein–Vazirani algorithm, which solves the Bernstein–Vazirani problem, is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in 1997. It is a restricted version of the Deutsch–Jozsa algorithm where instead of distinguishing between two different classes of functions, it tries to learn a string encoded in a function.
From Wikipedia
The Bernstein–Vazirani algorithm, which solves the Bernstein–Vazirani problem, is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in 1997. It is a restricted version of the Deutsch–Jozsa algorithm where instead of distinguishing between two different classes of functions, it tries to learn a string encoded in a function. The Bernstein–Vazirani algorithm was designed to prove an oracle separation between complexity classes BQP and BPP.
Text: Wikipédia, CC BY-SA 4.0. · Image: Vtomole (CC BY-SA 4.0) ·
Related cards
-
D
Deutsch–Jozsa algorithm
Quantum algorithm
Nº Q1028209 ★
Not listed
-
Schönhage–Strassen algorithm
Multiplication algorithm
Nº Q1938391 ★
Not listed
-
R
Rabin–Karp algorithm
String searching algorithm
Nº Q1384131 ★
Not listed
-
P
Peterson's algorithm
Concurrent programming algorithm for mutual exclusion
Nº Q903721 ★
Not listed
-
M
MinHash
Data mining technique
Nº Q11091745 ★
Not listed
-
Q
Quadratic sieve
Integer factorization algorithm
Nº Q1151850 ★
Not listed