A Generalization of Bernstein-Vazirani Algorithm to Qudit Systems

Understand

A quantum algorithm to solve the parity problem is better than its most efficient classical counter- part with a separation that is polynomial in the number of queries.

• This was shown by E.
• Bernstein and U.
• Vazirani and was one of the earliest indications that the quantum information processing can outperform the classical one by a significant margin.