Assignment-2_Unit-2[1]
Assignment-2_Unit-2[1]
13. Analyze the transformations of a qubit state ∣0⟩ through a sequence of single qubit
Bloch Sphere.
operations.
For example, apply a Hadamard gate followed by a Pauli-X gate and describe the
final state.
14. Discuss the criteria that make a set of quantum gates universal.
Provide examples of gate sets and their applications in building quantum circuits.
15. Define quantum algorithms and explain how they differ from classical algorithms.
Provide an example of a quantum algorithm and its application.
16. What are some key characteristics of quantum algorithms like Shor’s and Grover’s
algorithms?
Explain how they achieve advantages over classical counterparts.
17. Describe how controlled operations can be implemented using universal quantum
gates.
Provide an example of a controlled operation constructed from simpler gates.
18. How do quantum algorithms leverage superposition and entanglement?
19. What is the output of a CNOT gate when the input states are ∣00⟩, ∣01⟩, ∣10⟩, and ∣11⟩?
Explain their significance in achieving computational speedup.