Quantum Computing CHEAT SHEET

it m ag i ci ans
for circu
Instead of classical bits, quantum computers use Multiple qubits form a register. The number of computational states doubles Two or more qubits can be entangled,
quantum bits (or qubits for short). Measurement with each new qubit. A state with multiple qubits involved is often denoted like meaning that the state cannot be
One way to picture quantum states is = (where is the tensor product) factorized as a product of states:
The full state is not accessible in the circle notation:
one measurement, but multiple
state preparations and
Bit Qubit measurements are needed to the inner circles # qubits # basis states example
access the probability distribution. represents the the black line
0 Superposition 0
Linear combination 80%
amplitude indicates the 1 2
between two or more phase
possible linear
or states, e. g.
combination of
2 4
20% two-qubit states
1 1 0 1 phase Entanglement
Quantum states can also be
3 8 Entanglement between H
described using vectors: two qubits can be
we call this a ket created, for example, X
with this circuit

Quantum circuits are a model to visualize operations on qubits.

Gate Matrix Ket and circle notation

Qubit 1 (0x1) these boxes symbolize
operations acting on
one or multiple qubits There are many clever ways to arrange quantum circuits. A couple of them
Pauli-X is a 180° are depicted below.
rotation around the Qubit 2 (0x2) and are called gates
X x-axis; also known as the
X
quantum NOT gate Increment & decrement are used to add or subtract one from a register and are
Binary and decimal: You will find both the use of the binary representation of qubit states as well as the an example of how to do arithmetic with quantum gates.
decimal representation.
X X
Decimal Binary Decimal Binary X X
Pauli-Y is a 180°
means that the first X X
Y rotation around the
y-axis
Y and second qubit
increment decrement
are and the third
qubit is

Swap test allows for checking how similar the states in two registers are.
Pauli-Z is a 180° this is often used to indicate that multiple
Z rotation around
the z-axis
Z qubits are represented with this line
register1
1 if registers are in
Gate Matrix Ket and circle notation register2
same state
control output H H X
qubit
CNOT applies a this is a controlled SWAP gate
Pauli-X gate to the (also called Fredkin gate)
target qubit if the
Hadamard maps H = state of the control
to and to ;
H used to create an X qubit state is
equal superposition target Amplitude Amplification converts phase differences into amplitude
H qubit differences. It can be used (multiple times) to increase the success
CZ with two
probability of query or search algorithms like Grover's algorithm.
control qubits
CZ applies a Pauli-Z
gate to the target H X X H
= qubit if the state of X X H X X H
the control qubit is
S is a 90° rotation
Z H X X H

around the z-axis; flip phase of target with

S S = Z ; appropriate circuit
S The inverse S† rotates
S
SWAP swaps the
in the opposite direction state of 2 qubits;
can be implemented
using 3 alternating
CNOTs Quantum FourierTransform can reveal the signal frequency in a register.
Among other algorithms, it is used in Shor's algorithm for factoring numbers
and computing the discrete logarithm.
T is a 45° rotation Toffoli applies a
around the z-axis; Pauli-X gate to the H
T T T = S ;
The inverse T† rotates in
T target qubit if both
control qubits are in H S
† †
T
H S
†

the opposite direction state ; can be used

to construct a X conditional phase gates with phase decreasing
reversible version of
X the classical AND-gate over the qubit count: -90°, -45°, -22.5°, ...

IQM Quantum Computers CC-BY-SA Last updated: 03/2022 Please send us your feedback to [email protected]