Question 5: Quantum Algorithms (State Initialization with Clifford Gates)

Source: Chapter 03, slides 3, 7-12, 28, 30-34, 38-39, 43-44. Flagged by the instructor as challenging.

Task type for every problem below: you are given a target quantum state, and you must draw a circuit built only from Clifford gates (, , Pauli , controlled-NOT, , swap) that prepares it starting from the all-zero computational basis state, then verify by tracing the circuit forward, one gate at a time.


Problem 1: Bell state

Circuit:

q0: |0> --H--*--
             |
q1: |0> -----X--

Step 1 (start). .

Step 2 (after on q0).

Step 3 (after controlled-NOT, control q0, target q1). The term has control , so its target flips , giving ; the term has control and is untouched.

Final state, matching the target exactly.


Problem 2:

Circuit:

q0: |0> --H--*--X-------
             |
q1: |0> -----X----Z-----

Step 1 (start). .

Step 2 (after on q0). .

Step 3 (after controlled-NOT, control q0, target q1). .

Step 4 (after on q0). flips the first digit of both terms: and .

Step 5 (after on q1). multiplies the amplitude by whenever q1 is ; the term has , so it picks up , while has and is untouched.

Conclusion. This is the target state up to an overall global phase of , which is unobservable (Question 2, Why Q4).


Problem 3: GHZ state

Circuit:

q0: |0> --H--*-----*--
             |     |
q1: |0> -----X-----|--
                    |
q2: |0> ------------X--

Step 1 (start). .

Step 2 (after on q0). .

Step 3 (after controlled-NOT, control q0, target q1). The term has control , flipping q1: .

Step 4 (after controlled-NOT, control q0, target q2). The term still has control (q0) equal to , flipping q2:

the target state.


Problem 4: , single qubit

Circuit:

q0: |0> --X--H--

Step 1 (start). .

Step 2 (after ). .

Step 3 (after ). Using ‘s own state mapping directly ():

the target state, no extra sign gate needed since placed the qubit at before Hadamard mixes it.


Problem 5: two independent Bell pairs, 4 qubits,

Circuit:

q0: |0> --H--*----------
             |
q1: |0> -----X----------
q2: |0> --H-------*-----
                   |
q3: |0> -----------X----

Step 1, structural observation. The two pairs and never interact, so they can be traced independently and then combined by a tensor product.

Step 2 (after on q0 and q2).

(writing each pair’s own 2-qubit amplitude vector).

Step 3 (after controlled-NOT(q0,q1)). Pair 01 becomes .

Step 4 (after controlled-NOT(q2,q3)). Pair 23 becomes .

Final state.

two independent Bell pairs, exactly the target.


Problem 6:

Circuit:

q0: |0> --H--*--Z--
             |
q1: |0> -----X-----

Step 1 (start). .

Step 2 (after on q0). .

Step 3 (after controlled-NOT). .

Step 4 (after on q0). multiplies the amplitude by whenever q0 is ; the term has , so it picks up , while is untouched.

the target state exactly, no global phase needed.


Problem 7:

Circuit:

q0: |0> --H--*--X--
             |
q1: |0> -----X-----

Step 1 (start). .

Step 2 (after on q0). .

Step 3 (after controlled-NOT). .

Step 4 (after on q0). flips the first digit of both terms: and .

the target state directly, no sign fix needed (unlike Problem 2, where the target had a minus sign).


Problem 8: a 3-qubit product state, Bell pair on q0,q1 tensor on q2

Target: (qubits 0,1) (qubit 2).

Circuit:

q0: |0> --H--*-----------
             |
q1: |0> -----X-----------
q2: |0> --X-----H--------

Step 1, structural observation. q0,q1 and q2 never interact (no shared gate), so they can be prepared in parallel and traced independently, exactly the same reasoning as Problem 5’s tensor composition.

Step 2, qubits 0,1. then controlled-NOT gives , by Problem 1.

Step 3, qubit 2. then gives , by Problem 4.

Final state, combining by tensor product.

the target state. This illustrates that independent registers can be initialized by circuits that share no gates, and can be reasoned about (and drawn) as separate sub-circuits running in parallel.