0
$\begingroup$

Does anyone has (or is aware of) a solution to Nielsen's QCQI 4.36 exercise: construct a circuit to add two-qubit numbers x and y modulo 4 vs $|x,y\rangle \rightarrow |x, x+y \mod 4\rangle$

$\endgroup$
3
3
$\begingroup$

The trick is to break down, bit by bit, what the calculation is that you need. You'll see on the right-hand side of the circuit, I've stated what the outcomes need to be. Hopefully, you also recognise some of those outputs (particularly the top qubit), so that rapidly starts to formulate the circuit...

enter image description here

$\endgroup$
1
  • $\begingroup$ Crystal clear. Thank you. $\endgroup$
    – moldos
    Dec 22 '19 at 6:52

Not the answer you're looking for? Browse other questions tagged or ask your own question.