QNN PLAYGROUND
Number of nodes (persons)
Graph Topology (Relation)
Question
Pump Rate
CHALLENGE

PLAYGROUND CHALLENGE

Welcome to the Playground Challenge!

You can use the simple problem presented in the Playground Challenge to learn about Max-Cut problems,
a type of problem that would take a long time to try and solve using a regular computer.

1 2 3 4 5

There are five children.

Children connected with red lines get along,
Children connected with blue lines don’t get along.
Children with no line connecting them don’t particularly
interact with each other.

1 2 3 4 5

Divide the children between bus A and bus B.
Consider their relationships to each other,
and try and keep children who don’t get along
from being on the same bus.

Level of Harmony on the Bus 0

1 2 3 4 5

Level of Harmony on the Bus 0

Click!
1 2 3 4 5

Level of Harmony on the Bus 0

COM
YOU
Correct! Too bad...

Now, what if there were 16 children?

There would be many, many more potential combinations
that need to be tested, making the problem a lot harder.
In mathematics, this sort of problem that involves finding the best answer
out of many possible combinations is called a “combinatorial optimization problem.”
Max-Cut problems are a particularly difficult type of combinatorial optimization problem.

TIn the Playground, you can use the Quatum Neural Network (QNN) simulator
to see what it’s like to solve a difficult Max-Cut problem involving up to 16 people.

TUTORIAL
We use cookies to understand how people come to and use our site and share content through it so we can improve everyone’s experience. By using our site, you agree to the use of these cookies. See our Site Policy to read more.