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

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 “quantum bits” is called “quantum Fourier transform” (QFT).

It is similar to the “discrete Fourier transform” (DFT) where it works on the quantum state’s vector amplitude.

The “classical 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= e2πiMand 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 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

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.

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:

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’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.

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.

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