Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Convocation-Multiplication.Supposeα=jajjbyItogetthesuperpositionα'=jαjj+I.IftheQFTofαisβ,showthattheQFTOFα'ISβ',Whereβj'=βjωij.Concludethatifα'=j=0MK-1KMjk+I,thenβ'=1kj=0k-1ωIjMKjMk.

Short Answer

Expert verified

It can be proved that the QFT of α'isβ' by offsetting / and applying QFT.

Step by step solution

01

Explain Convolution-Multiplication.

Considerthattheα=jajjbyItogetthesuperpositionα'=jαjj+I.IftheQFTofαisβ.

02

Show that the QFT of α' is β'.

Consider that the ithcoefficient against βandβ'are,

βi=1Mjωijaj......(1)βi'=1Mjωij+Iaj.........2

By comparing Equations (1) and (2),

βi'=βiωil......3 Consider,α=jj=0MK-1kMjk,accordingtotheclaimβ=1kj=0k-1jMK.

After offsetting αby I ,the result is

α'=j=0MK-1KMjk+I.....4

Perform QFT to get β'.According the Equation (3), the value of the ithcoefficient is i=jMKatβ.at .

Hence,

β'=1kj=0k-1ωIjMKjMK......5

Therefore, It is proved that the QFT of α'is β'by the Equations (4) and (5).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

The CONTROLLED SWAP ( C-SWAP) gate takes as input3 qubits and swaps the second and third if and only if the first qubit is a 1.

  1. Show that each of theNOT,CNOTandC-SWAP gates are their own inverses.
  2. Show how to implement anrole="math" localid="1658207684748" AND gate using aC-SWAP gate, i.e., what inputsa,b,c would you give to aC-SWAP gate so that one of the outputs is ab?
  3. How would you achieve fanout using just these three gates? That is, on input aand0 , outputa anda .
  4. Conclude therefore that for any classical circuit Cthere is an equivalent quantum circuitQ using just NOT and C-SWAP gates in the following sense: ifC outputs Yon input x, then Qoutputs|x,y,z on input |x,0,0. (Herez is some set of junk bits that are generated during this computation.)
  5. Now show that that there is a quantum circuit Q-1 that outputs|x,0,0 on input|x,y,z .
  6. Show that there is a quantum circuitQ' made up ofNOT,CNOTandC-SWAPgates that outputs|x,y,0 on input |x,0,0.

What is the quantum Fourier transform modulo M of the uniform superposition 1Mj=0M1|j?

Show that the following quantum circuit prepares the Bell state |Ψ=12|00+12|11on input |00: 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 gcd(x,N)=1, then with probability at least role="math" localid="1658908286522" 38, the order r of x mod N is even, and more over xr2is 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 least12 (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 34, the order r of x mod N is even.

c) If r is even, prove that the probability that role="math" localid="1658908648251" xr2±1is at most12.

What is the QFT modulo M of j>

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free