Scribd
Upload
2 views2 pages

Quantum Computing Problem Set

The document is a problem set for students to assess their understanding of quantum computing principles, including qubits, quantum gates, and quantum supremacy. It consists of six questions that require explanations and calculations related to classical bits versus qubits, the Hadamard and CNOT gates, measuring entangled states, and the challenges of simulating quantum circuits on classical computers. Students are instructed to submit their answers as a handwritten PDF document.

Uploaded by

i221648
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views2 pages

Quantum Computing Problem Set

The document is a problem set for students to assess their understanding of quantum computing principles, including qubits, quantum gates, and quantum supremacy. It consists of six questions that require explanations and calculations related to classical bits versus qubits, the Hadamard and CNOT gates, measuring entangled states, and the challenges of simulating quantum circuits on classical computers. Students are instructed to submit their answers as a handwritten PDF document.

Uploaded by

i221648
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Quantum Computing Problem Set

Watch the following video to solve this problem set:


https://www.youtube.com/watch?v=F_Riqjdh2oM

Objective
To assess students' understanding of basic quantum computing principles including:
- Representation of quantum bits (qubits)
- Use and function of basic quantum gates (Hadamard, CNOT, etc.)
- Execution of a simplified version of the quantum supremacy problem presented in the video

Instructions
- Answer all questions clearly and concisely.
- Submit your answers as a single PDF document scan of a handwritten assignment.

The above video assumes no prerequisite knowledge, although comfort with basic linear algebra
(matrices, vectors, matrix multiplication) will ease understanding.

Question 1: Classical Bits vs. Qubits


Explain how a classical bit differs from a qubit. Represent the classical bit states and a general qubit
state using Dirac notation and vector form.

Question 2: The Hadamard Gate


The Hadamard (H) gate is a common single-qubit quantum gate. Explain its effect. Specifically, write the
action of H on the basis states |0> and |1> (both as state vectors and in Dirac notation).

Question 3: The CNOT Gate and Entanglement


Consider two qubits (qubit A as control and qubit B as target). The controlled-NOT (CNOT) gate flips the
target qubit if the control qubit is |1>.

(a) Write the action of CNOT on the basis states |00>, |01>, |10>, |11>.
(b) Start with the two-qubit state $|00>$, apply H on qubit A, then apply CNOT (control=A, target=B).
What is the resulting two-qubit state?

Question 4: Measuring an Entangled State


Using the state |ψ⟩ = (1/√2) (|00⟩ + |11⟩) from Question 3, suppose we measure both qubits in the
computational basis. What are the possible measurement outcomes (bit strings) and their probabilities?

Question 5: Random Quantum Circuits and Supremacy


In the Google “quantum supremacy” experiment, a random quantum circuit on many qubits is used. (a)
Briefly describe what is meant by random circuit sampling. (b) What is the goal of this experiment? Why
is sampling from a random quantum circuit distribution considered a demonstration of quantum
supremacy?

Question 6: Classical Simulation Difficulty


Explain why simulating the random circuit experiment on a classical computer is believed to be
intractable. Use the concept of the size of the state space to justify why classical simulation time and
memory grow too quickly.

You might also like