Hi everyone,

We understand that the problem had a larger maneuver space then we planned beforehand. The main objective of the exercise is to create the quantum circuit, and that is why we decided you shouldn’t optimize the constraints at all. **We will provide the list of constraints that define the problem**.

Without any optimization on the problem, The pure constraints are as follows:

```
"(x0 != x1) and"
"(x2 != x3) and"
"(x2 != x4) and"
"(x3 != x4) and"
"(x5 != x6) and"
"(x0 != x2) and"
"(x1 != x3) and"
"(x1 != x5) and"
"(x3 != x5) and"
"(x4 != x6) and"
"((x0 + x2) == 5) and"
"((x1 + x3+x5) == 3) and"
"((x4 + x6) == 1) and"
"((x2 + x4+x3) == 5) and"
"((x0 + x1) == 3) and"
"((x5 + x6) == 1)
```

These massive amounts of constraints might create a circuit with too many qubits to simulate. We want you to be able to test your solution yourself, and that is why we optimized these constraints a bit. We will provide an explanation in the comments to this post about the optimization process.

The constraints needed to solve the problem are:

```
"(x0 != x1) and"
"(x2 + 2 != x3) and"
"(x3 != x4) and"
"(x1 != x3) and"
"(x3 != x5) and"
"(x5 != x6) and"
"(x0 != x2) and"
"(x1 != x5) and"
"(x4 != x6) and"
"(x3 == 2) and"
"(x2 + x4 + x3 == 3)"
```

In terms of definitions of the variables - **all of the variables are of size 1 qubit, except for x3 which is 2 qubits.**

Good luck to all participants! Feel free to ask any further questions in this forum.