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.)
Hi! This looks like a computer science issue. Maybe it would help you if you close this question and repost it in the Computer Science section \(\sf\color{green}{\href{\study#/groups/Computer%20Science}{here!}}\) http://openstudy.com/study#/groups/Computer%20Science
kkk
My "here!" link is bad, though, sorry :P
could you solve it?
No! Sorry! I looked at the Wikipedia article, and I don't feel able to learn it well. I've been doing a lot of brain work today...
can you solve this type of sums? I am getting it wrong. Which of the following states is entangled? a) |++> b) 45|01>−35|11>] c) 1/√3|01> +1/√3|10>−1/3|11> d) 1+i/√22|++> − 1+i/√22|+−> + 1−i/√22|−+> − 1−i/√22|−−>
please help
I'm not sure what any of that means, sorry. I don't know how an entangled state would be defined!
Anything related to quantum states?
No, sorry.. I know a little bit of quantum mechanics and I'm familiar with some of the results according to the postulates of special relativity, but that is all of my knowledge beyond some basic classical physics and calculus.
In the category of physics knowledge.
okay
Sorry! Best of luck!
thanx!!!!
Join our real-time social learning platform and learn together with your friends!