Computer Science
Mathematics
Physics
Quantum Computation

Bernstein–Vazirani Algorithm

Construct the Bernstein–Vazirani quantum circuit for a given secret string

Open in Cloud
Download Notebook

The Bernstein-Vazirani algorithm is a quantum algorithm that solves a specific problem known as the "oracle problem." In this problem, we are given a black-box oracle (a function) that computes a dot product between an unknown binary string "s" and an input binary string "x", modulo 2. The goal is to determine the unknown string "s".

Install and load the QuantumFramework paclet:

In[1]:=

PacletInstall["Wolfram/QuantumFramework"]Needs["Wolfram`QuantumFramework`"]

Generate the Bernstein–Vazirani circuit for the secret string 101:

In[2]:=

bv=QuantumCircuitOperator[{"BernsteinVazirani","101"}]

Out[2]=

QuantumCircuitOperator



View the circuit diagram:

In[3]:=

bv["Diagram"]

Out[3]=

Show only the oracle part of the circuit:

In[4]:=

QuantumCircuitOperator[{"BernsteinVaziraniOracle","101"}]["Diagram"]

Out[4]=

Evaluate the BV circuit and get the measurement:

In[5]:=

meas=bv[]

Out[5]=

QuantumMeasurement

Target: {1,2,3}

Measurement Outcomes: 8



Return quantum probabilities:

In[6]:=

meas["Probabilities"]

Out[6]=

|000〉0,|001〉0,|010〉0,|011〉0,|100〉0,|101〉1,|110〉0,|111〉0

The only result corresponds to the secret string:

In[7]:=

meas["ProbabilityPlot"]

Out[7]=

Publisher Information

Contributed by: Wolfram Research, Quantum Computation Framework Team

Wolfram Language Example Repository

Bernstein–Vazirani Algorithm

See Also

Publisher Information