Exercise 4 (2 pts) State the Big O time complexity for each algorithm that performs matrix multiplication. Example: O(f(n)) for some function f of n. - Nave approach - Strassen (Divide \& Conquer) - Coppersmith-Winograd Exeretio o (1 pts) Quantum gates perform a transformation on 1 or more qubits. These transforms have a corresponding matrix. - What is the size of the matrix for a single-qubit gate? - What is the size of the matrix for a 3-qubit gate? Exercise 6(4pts) Let denote the initial state of the qubit q. Fill in the post-gate state of the qubit q in Dirac Braket notation for each the gate and initial state of q. Ckercise 7 (1 pts) What does ground state mean in the context of quantum computing