Programming on quantum computers, Part 6: Bernstein-Vazirani Algorithm

About this video

The Bernstein-Vazirani algorithm is one example of many quantum algorithms where a quantum computer outperforms a classical computer. Let’s say there is a secret number hidden inside a box and that number is described by 6-bits or six strings of zeroes and ones. How many attempts do you think you’d need to guess that number correctly? If you are using a classical computer, it’d take you six tries. If that 6-bit number became 60 bits, it’d take you 60 tries. As you can see, this can quickly add up!

In part 6 of the “Programming on quantum computers” series, Abe covers how the Bernstein-Vazirani algorithm can correctly guess a string of binary numbers in one shot. In this video, you’ll also learn how to implement the algorithm in Qiskit.

About the series

The “Programming on quantum computers” series introduces you to quantum computers and shows you how to program quantum algorithms on them. Once you understand how to program quantum computers using Qiskit, you can focus on various application areas, including quantum chemistry, the development of quantum algorithms, and even learn how to program games based on quantum computing.

Get started with Qiskit

There are plenty of resources to help you get started with Qiskit. Join the Qskit Slack workspace and stay up to date with all things Qiskit by subscribing to weekly content.