Chapter 10, Quantum algorithms Video Solutions, Algorithms

Problem 1

$|\psi\rangle=\frac{1}{\sqrt{2}}|00\rangle+\frac{1}{\sqrt{2}}|11\rangle$ is one of the famous "Bell states," a highly entangled state of its two qubits. In this question we examine some of its strange properties.
(a) Suppose this Bell state could be decomposed as the (tensor) product of two qubits (recall the box on page 314 ), the first in state $\alpha_{0}|0\rangle+\alpha_{1}|1\rangle$ and the second in state $\beta_{0}|0\rangle+\beta_{1}|1\rangle$ Write four equations that the amplitudes $\alpha_{0}, \alpha_{1}, \beta_{0},$ and $\beta_{1}$ must satisfy. Conclude that the Bell state cannot be so decomposed.
(b) What is the result of measuring the first qubit of $|\psi\rangle ?$
(c) What is the result of measuring the second qubit after measuring the first qubit?
(d) If the two qubits in state $|\psi\rangle$ are very far from each other, can you see why the answer to
(c) is surprising?

Dr. Rajveer Singh

Numerade Educator

05:58

Problem 2

Show that the following quantum circuit prepares the Bell state $|\psi\rangle=\frac{1}{\sqrt{2}}|00\rangle+\frac{1}{\sqrt{2}}|11\rangle$ on input
|00\rangle: apply a Hadamard gate to the first qubit followed by a CNOT with the first qubit as the control and the second qubit as the target.
What does the circuit output on input $10,01,$ and $11 ?$ These are the rest of the Bell basis states.

Rahul Nikhar

Numerade Educator

View

Problem 3

What is the quantum Fourier transform modulo $M$ of the uniform superposition $\frac{1}{\sqrt{M}} \sum_{j=0}^{M-1}|j\rangle ?$

Zia Ullah

Numerade Educator

01:21

Problem 4

What is the QFT modulo $M$ of $|j\rangle ?$

Ajay Singhal

Numerade Educator

View

Problem 5

Convolution-Multiplication. Suppose we shift a superposition $|\alpha\rangle=\sum_{j} \alpha_{j}|j\rangle$ by $l$ to get the superposition $\left|\alpha^{\prime}\right\rangle=\sum_{j} \alpha_{j}|j+l\rangle .$ If the QFT of $|\alpha\rangle$ is $|\beta\rangle,$ show that the QFT of $\alpha^{\prime}$ is $\beta^{\prime},$ where $\beta_{j}^{\prime}=\beta_{j} \omega^{l j} .$ Conclude that if $\left|\alpha^{\prime}\right\rangle=\sum_{j=0}^{M / k-1} \sqrt{\frac{k}{M}}|j k+l\rangle,$ then $\left|\beta^{\prime}\right\rangle=\frac{1}{\sqrt{k}} \sum_{j=0}^{k-1} \omega^{l j M / k}|j M / k\rangle$

Victor Salazar

Numerade Educator

01:04

Problem 6

Show that if you apply the Hadamard gate to the inputs and outputs of a CNOT gate, the result is a CNOT gate with control and target qubits switched:

Mirza Aslam Beig

Numerade Educator

01:04

Problem 7

The CONTROLLED SWAP (C-SWAP) gate takes as input 3 qubits and swaps the second and third if and only if the first qubit is a 1
(a) Show that each of the NOT, CNOT, and C-SWAP gates are their own inverses.
(b) Show how to implement an AND gate using a C-SWAP gate, i.e., what inputs $a, b, c$ would you give to a C-SWAP gate so that one of the outputs is $a \wedge b ?$
(c) How would you achieve fanout using just these three gates? That is, on input $a$ and 0 output $a$ and $a$
(d) Conclude therefore that for any classical circuit $C$ there is an equivalent quantum circuit $Q$ using just NOT and C-SWAP gates in the following sense: if $C$ outputs $y$ on input $x,$ then $Q$ outputs $|x, y, z\rangle$ on input $|x, 0,0\rangle .$ (Here $z$ is some set of junk bits that are generated during this computation).
(e) Now show that that there is a quantum circuit $Q^{-1}$ that outputs $|x, 0,0\rangle$ on input $|x, y, z\rangle$
(f) Show that there is a quantum circuit $Q^{\prime}$ made up of $\mathrm{NOT}$, CNOT, and C-SWAP gates that outputs $|x, y, 0\rangle$ on input $|x, 0,0\rangle$

Mirza Aslam Beig

Numerade Educator

01:58

Problem 8

In this problem we will show that if $N=p q$ is the product of two odd primes, and if $x$ is chosen uniformly at random between 0 and $N-1,$ such that $\operatorname{gcd}(x, N)=1,$ then with probability at least $3 / 8,$ the order $r$ of $x$ mod $N$ is even, and moreover $x^{r / 2}$ is a nontrivial square root of 1 mod $N$
(a) Let $p$ be an odd prime and let $x$ be a uniformly random number modulo $p$. Show that the order of $x$ mod $p$ is even with probability at least $1 / 2 .$ (Hint: Use Fermat's little theorem (Section 1.3 ).)
(b) Use the Chinese remainder theorem (Exercise 1.37 ) to show that with probability at least $3 / 4,$ the order $r$ of $x \bmod N$ is even
(c) If $r$ is even, prove that the probability that $x^{r / 2} \equiv \pm 1$ is at most $1 / 2$

Trang Hoang

Numerade Educator