Ask your own question, for FREE!
Computer Science 18 Online
OpenStudy (anonymous):

Suppose we are trying to solve Simon's problem with n=4. We ran 4 iterations of Simon's algorithm and obtained 0000, 1101, 1010, and 0110. What is the secret string s? (Assume that s is not the all-zero string 0000.)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!