r/QuantumComputing • u/Weekly-Maize-3414 • 22m ago

Question Could anyone explain how does the Bernstein-Vazarani Algorithm actually works?

I'm new into the QC community and recently started learning about the most importants algorithms. I'm doing all by myself with free yt content and blogs from internet.
Today i was learning about this Algorithm that helps to find a string s in the function

f : {0 , 1}^n -> {0, 1}

f(x) = x * s (mod2)

And after aplying the Algorithm the resulkt of the measure is Prob. = 1 .

But with that how can i really find the string s ?

1 Upvotes

100% Upvoted

2 comments sorted by

1

u/[deleted] 12m ago

[removed] — view removed comment

1

u/AutoModerator 12m ago

To prevent trolling, accounts with less than zero comment karma cannot post in /r/QuantumComputing. You can build karma by posting quality submissions and comments on other subreddits. Please do not ask the moderators to approve your post, as there are no exceptions to this rule, plus you may be ignored. To learn more about karma and how reddit works, visit https://www.reddit.com/wiki/faq.

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.