Chapter 10: Q5E (page 329)
Short Answer
It can be proved that the QFT of is by offsetting / and applying QFT.
Chapter 10: Q5E (page 329)
It can be proved that the QFT of is by offsetting / and applying QFT.
All the tools & learning materials you need for study success - in one app.
Get started for freeThe CONTROLLED SWAP ( ) gate takes as input qubits and swaps the second and third if and only if the first qubit is a .
What is the quantum Fourier transform modulo M of the uniform superposition ?
Show that the following quantum circuit prepares the Bell state on input : 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.
In this problem we will show that if N=pq is the product of two odd primes, and if x is chosen uniformly at random between 0 and N-1, such that , then with probability at least role="math" localid="1658908286522" , the order r of x mod N is even, and more over 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 (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 , the order r of x mod N is even.
c) If r is even, prove that the probability that role="math" localid="1658908648251" is at most.
What is the QFT modulo M of
What do you think about this solution?
We value your feedback to improve our textbook solutions.