These slides at: https://slides.com/javafxpert/prep-qiskit-dev-cert-exam

IBM’s statements regarding its plans, directions, and intent are subject to change or withdrawal without notice and at IBM’s sole discretion.

Information regarding potential future products is intended to outline our general product direction and it should not be relied on in making a purchasing decision.

The information mentioned regarding potential future products is not a commitment, promise, or legal obligation to deliver any material, code or functionality. Information about potential future products may not be incorporated into any contract.

The development, release, and timing of any future features or functionality described for our products remains at our sole discretion.

Performance is based on measurements and projections using standard IBM benchmarks in a controlled environment. The actual throughput or performance that any user will experience will vary depending upon many factors, including considerations such as the amount of multiprogramming in the user’s job stream, the I/O configuration, the storage configuration, and the workload processed. Therefore, no assurance can be given that an individual user will achieve results similar to those stated here.

© 2021 IBM Corporation

IBM Quantum Developer Advocate

Java Champion

Developer / Author / Speaker

james.weaver@ibm.com

With our quantum developer certification, companies and research institutions will find a clear path to get their workforce quantum-ready. The certificate will help those hiring for classical programming and non-programming roles recognize holders of this certification as forward-thinking individuals willing to skill up for the future of the computing workforce.

The IBM Quantum Developer Certification is a 60-question certification exam offered on the Pearson VUE platform. Those who pass the exam will have demonstrated experience using Qiskit to create and execute quantum computing programs on IBM quantum computers and simulators, and the ability to perform these tasks with little to no assistance from product documentation, support, or peers.

We figure that plenty of Qiskitters will be looking to take the certification exam, so we’ve put together a sneak peak of the exam’s structure, what’s going to be on it, and how to study for it. The test is going to be a 60-question exam, in English, offered on the Pearson VUE platform. The goal of the test is to certify that those who pass it can define, execute, and visualize quantum circuits using Qiskit, implement single and multi-qubit gates and understand their effects on quantum circuits, and leverage the fundamental features of Qiskit in order to write quantum programs.

**Create your first circuit walkthrough**

Also, explore the ** Quantum Composer user guide**, and

Gain an intuitive understanding of the Bloch sphere and gate rotations with this web-based application known as Grok the Bloch Sphere

Explore all of sections * 1* and

Explore the * Defining Quantum Circuits* section

Explore the * Qiskit Tutorials* -

The links shown above are in the * start_here* Jupyter notebook

Explore the * Qiskit Tutorials* -

The * Advanced circuit visualization* link is in the

Explore the * Qiskit Tutorials* -

The * Simulators* link is in the

Consult **qiskit.circuit.QiskitCircuit** methods for using QASM within Qiskit

Learn nuggets like this from other Qiskit developers

Each certification exam question falls into one of these objectives:

`%qiskit_backend_overview`

`QiskitCircuit.from_qasm_str()`

and string:

Access

Access

Access

*... and understand*

}

Familiarity with Qiskit API

✓

Mental gymnastics on the Bloch sphere

✓

✓

✓

✓

Familiarity with Qiskit API

✓

Familiarity with Qiskit API, measure vs. measure_all

Entanglement and knowing the four Bell states

✓

Gymnastics on the Bloch sphere, plot_bloch_multivector vs. plot_bloch_vector

✓

✓

Gate operations

✓

Bell state, and initialize()

✓

✓

Familiarity with Qiskit API, multi-qubit gates

✓

Familiarity with Qiskit API, Toffoli gate

✓

Example Toffoli gate:

Familiarity with Qiskit API, barrier operation

✓

✓

Barrier operation, optimizing circuits

✓

Barrier operation, circuit depth

✓

Using execute function parameters, coupling map, Aer qasm_simulator

✓

Using execute function parameters, coupling map, BasicAer qasm_simulator

✓

Example device gate map:

BasicAer simulators

✓

✓

✓

Assigning BasicAer simulators

✓

Quantum information, creating an Operator

✓

Familiarity with Qiskit quantum_info API, process and gate fidelity

✓

Mentally calculating statevector from a quantum circuit

✓

Massive hardware, limited bits, software infancy

Quantum computers make direct use of quantum-mechanical phenomena, such as superposition, interference and entanglement, to perform operations on data.

Feasible on **classical** computers

Feasible on **quantum** computers

Solutions to problems

Some problems may be solved exponentially faster

“Nature isn't classical, dammit, and if you want to make a simulation of nature, you'd better make it quantum mechanical, and by golly it's a wonderful problem, because it doesn't look so easy.”

complex chemical reactions, for example

**Dr. Richard Feynman, 1981**

“If you start factoring 10-digit numbers then it’s going to start getting scary”

someday maybe, using Shor's algorithm, formulated in 1994

**Dr. Peter Shor, 2013**

“Programming a quantum computer is particularly interesting since there are multiple things happening in the same hardware simultaneously. One needs to think like both a theoretical physicist and a computer scientist.”

using Grover's algorithm

**Dr. Lov Grover, 2002**

**Noisy Intermediate Scale Quantum computers*

\vert\space\space\space\rangle

\vert\space\space\space\rangle

\vert\space\space\space\rangle

\vert\space\space\space\rangle

=
\begin{bmatrix}
1 \\
0
\end{bmatrix}

\vert\space\space\space\rangle

=
\begin{bmatrix}
0 \\
1
\end{bmatrix}

=
\begin{bmatrix}
\sqrt{\frac{1}{3}} \\
\sqrt{\frac{2}{3}}
\end{bmatrix}

\sqrt{\frac{1}{3}}

\vert\space\space\space\rangle

+

\sqrt{\frac{2}{3}}

\vert\space\space\space\rangle

\vert\space\space\space\rangle

\vert\space\space\space\rangle

\vert\space\space\space\space\rangle

\vert\space\space\space\space\rangle

\vert\space\space\space\space\rangle

\vert\space\space\space\space\rangle

\vert\space\space\space\space\rangle

\vert\space\space\space\space\rangle

\vert\space\space\space\rangle

\vert\space\space\space\rangle

**X**

\begin{bmatrix}
0 & 1 \\
1 & 0
\end{bmatrix}
\cdot
\begin{bmatrix}
1 \\
0
\end{bmatrix}
=
\begin{bmatrix}
0 \\
1
\end{bmatrix}

NOT gate (Pauli/X, bit-flip)

\vert\space\space\space\rangle

**H**

\begin{bmatrix}
\frac{1}{\sqrt{2}} & \frac{1}{\sqrt{2}} \\
\frac{1}{\sqrt{2}} & -\frac{1}{\sqrt{2}}
\end{bmatrix}
\cdot
\begin{bmatrix}
1 \\
0
\end{bmatrix}
=
\begin{bmatrix}
\frac{1}{\sqrt{2}} \\
\frac{1}{\sqrt{2}}
\end{bmatrix}

Hadamard gate

\sqrt{\frac{1}{2}}

\vert\space\space\space\rangle

+

\sqrt{\frac{1}{2}}

\vert\space\space\space\rangle

\sqrt{\frac{1}{3}}

\vert\space\space\space\rangle

+

\sqrt{\frac{2}{3}}

\vert\space\space\space\rangle

When observed there is a:

\frac{1}{3}

\frac{2}{3}

probability of being grumpy

probability of being happy

\vert\space\space\space\space\space\space\space\rangle

\vert\space\space\space\rangle

\vert\space\space\space\rangle

=

\vert\space\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\space\rangle

=
\begin{bmatrix}
1 \\
0
\end{bmatrix}

\otimes
\begin{bmatrix}
1 \\
0
\end{bmatrix}

=
\begin{bmatrix}
1 \\
0 \\
0 \\
0
\end{bmatrix}

\vert\space\space\space\space\space\space\space\rangle

\vert\space\space\space\rangle

\vert\space\space\space\rangle

=

=
\begin{bmatrix}
0 \\
1 \\
0 \\
0
\end{bmatrix}

=
\begin{bmatrix}
1 \\
0
\end{bmatrix}

\otimes
\begin{bmatrix}
0 \\
1
\end{bmatrix}

\vert\space\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\space\rangle

\sqrt{\frac{1}{2}}

+

\vert\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\rangle

\sqrt{\frac{1}{2}}

\sqrt{\frac{1}{2}}

+

\vert\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\rangle

\sqrt{\frac{1}{6}}

+

\vert\space\space\space\space\space\space\space\rangle

\sqrt{\frac{1}{3}}

\vert\space\space\space\space\space\space\space\rangle

*quantum gates*

*quantum gates*

*measure*

\downarrow

\downarrow

\downarrow

\vert\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\rangle

with 1/2 probability

with 1/6 probability

with 1/3 probability

\vert\space\space\space\rangle

*H*

Hadamard gate

\vert\space\space\space\rangle

CNOT gate

\sqrt{\frac{1}{2}}

+

\vert\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\rangle

\sqrt{\frac{1}{2}}

\sqrt{\frac{1}{2}}

+

\vert\space\space\space\space\space\space\space\rangle

\vert\space\space\space\space\space\space\space\rangle

\sqrt{\frac{1}{2}}

Mars - ESA

Alice Cat

Bob Cat

Venus - NASA

\vert\space\space\rangle

=

\begin{bmatrix}
1 & 0 & 0 & 0 \\
0 & 0 & 0 & 1 \\
0 & 0 & 1 & 0 \\
0 & 1 & 0 & 0
\end{bmatrix}

\begin{bmatrix}
\frac{1}{\sqrt{2}} & \frac{1}{\sqrt{2}} \\
\frac{1}{\sqrt{2}} & -\frac{1}{\sqrt{2}}
\end{bmatrix}