From the course: Quantum Computing Fundamentals
Unlock the full course today
Join today to access over 24,700 courses taught by industry experts.
Challenge: Random numbers
From the course: Quantum Computing Fundamentals
Challenge: Random numbers
(inquisitive music) - We've learned about several quantum gates that can put a single qubit into arbitrary states of superposition, so I think it's time for another challenge. Your goal will be to take a new quantum circuit with three qubits and then use single qubit gates to configure their state such that when you measure those three qubits, they'll have roughly the outcome distribution shown here with a 37.5% probability of measuring those three qubits as 001 or 011, and a 12.5% chance of measuring them as 101 or 111. This challenge is a bit of a puzzle. You'll need to work backwards from those measurement results to figure out a set of quantum states that might have produced them. Now, don't get too caught up in trying to match those probabilities exactly. As long as your quantum circuit puts those three qubits into states with roughly the same distribution of those four outcomes, you've achieved the intent of…
Contents
-
-
-
-
-
-
Hadamard gate4m 30s
-
(Locked)
Hadamard gate with Qiskit3m 3s
-
(Locked)
Measurement on an arbitrary basis6m
-
(Locked)
Phase shift gates4m 27s
-
(Locked)
Phase shift gates with Qiskit1m 55s
-
(Locked)
Parameterized rotation gates3m 23s
-
(Locked)
Parameterized rotation gates with Qiskit3m 1s
-
(Locked)
Single-qubit gates on multi-qubit states3m 57s
-
(Locked)
Challenge: Random numbers1m 45s
-
(Locked)
Solution: Random numbers2m 2s
-
-
-
-
-
-