History
Qubits
Algorithms
Fun with gates
100

This physicist said in 1981, “To simulate nature, build a quantum computer.”

Who is Richard Feynman?


100

The smallest unit of information in a quantum computer.

What is a qubit? 


100

Developed in 1996, this algorithm searches an unstructured database faster than classical methods.

What is Grover’s algorithm?

100

Every quantum state can be represented as this mathematical object

What is a vector?

200

These first classical computers of the 1940s inspired the development of quantum computing.

What are ENIAC and Colossus? 


200

A qubit can exist in this state, meaning it can represent multiple values at once.

What is a superposition?

200

Developed in 1994, this algorithm finds the prime factors of large numbers.

What is Shor’s algorithm?

200

Quantum gates are represented as this mathematical object which represents a linear transformation

What is a matrix

300

This scientist defined the universal quantum computer in 1985.

Who is David Deutsch?

300

This property links two or more qubits so that the state of one affects the others.

What is entanglement?

300

Grover’s algorithm searches N elements in this runtime, faster than classical O(N).

What is O(√N)?

300

This class of gates allow for qubits to get entangled with eachother

What are control gates
400

Quantum computing is based on discoveries in this branch of physics, studying the smallest particles in the universe.

What is quantum mechanics?

400

This is the physical chip containing qubits and readout circuits in a quantum computer.

What is the Quantum Processing Unit (QPU)?

400

Shor’s algorithm runs in this type of runtime, slower than Grover but much faster than classical factoring.

What is polynomial time?

400

This is the matrix that represents the H gate

What is

1/sqrt(2) *

[
1  1
1 -1

]

500

By the 1960s-80s, physicists discovered three main limitations of classical computers. Name one.

What is difficulty simulating quantum systems? (Other acceptable answers: quantum effects in small chips, information is quantum in nature)

500

These operations, including Hadamard and CNOT, manipulate qubits to perform algorithms.  

What are quantum gates?

500

This transform, abbreviated QFT, is used in Shor’s algorithm to find repeating patterns.

What is the Quantum Fourier Transform?

500

Every quantum gate is unitary, which means this

What is being reversible such that it preserves the total probability of a system's quantum state.

M
e
n
u