Question: Quantum Computation and Quantum Information ( Michael A . Nielsen, Isaac L . Chuang ) , exercise 5 . 1 8 : ( Factoring 9

Quantum Computation and Quantum Information (Michael A. Nielsen, Isaac L. Chuang), exercise5.18: (Factoring 91) Suppose we wish to factor N =91. Confirm that steps 1 and 2 are passed. For step 3, suppose we choose x =4, which is co-prime to 91. Compute the order r of x with respect to N, and show that xr/2 mod 91=641(mod 91), so the algorithm succeeds, giving gcd(641,19)=7.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!