/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q4E What is the QFT modulo M of j&gt... [FREE SOLUTION] | 91影视

91影视

What is the QFT modulo M of j>

Short Answer

Expert verified

The QFT modulo M of j>is

QFTj=1Mj=0M-1WjIj>

Step by step solution

01

Step 1:Discrete Fourier Transform Formula

Quantum Fourier Transform:

Performing linear transformation on the 鈥渜uantum bits鈥 is called 鈥渜uantum Fourier transform鈥 (QFT).

It is similar to the 鈥渄iscrete Fourier transform鈥 (DFT) where it works on the quantum state鈥檚 vector amplitude.

The 鈥渃lassical DFT鈥 works on the vector of a0,K,aN-1and map it to the vectorb0,K,bN-1.

It is defined by the following formula,bI=1Mj=0M-1ajwjI

02

QFT modulo of j>

Here, the value of w is w= e2iMand it is the Nthroot of unity.

Similar to DFT, QFT works on the quantum state j=0M-1ajj>and map it to the quantum state.

j=0M-1bjj>.

It is defined by the following formula.

localid="1658904981124" j>=1Mj=0M-1wjIJ>Therefore,

QFTj=1Mj=0M-1wjIj>

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 91影视!

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

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.

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

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鈥檚 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" xr21is at most12.

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.

Convocation-Multiplication.Suppose=jajjbyItogetthesuperposition'=jjj+I.IftheQFTofis,showthattheQFTOF'IS',Where尾箩'=jij.Concludethatif'=j=0MK-1KMjk+I,then'=1kj=0k-1IjMKjMk.

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.