The more I read about Quantum computers the less I understand. I feel like my grandparents when I explained them the Commodore 64 and the concept of bits and bytes. It was all so clear to me and I couldn't really understand why they where not able to "get it". Now we have Quantum computers and now I am like my grandparents. I try to understand it, but it makes no sense in my head.
explanation as to how the simulator works fall short of details quite quickly. "You draw this and you get that" was not really what I needed to understand.
If the second block is used to hide the card in the 4th slot, and we already know which slot the card is in, what exactly is happening in the quantum inversion step? Doesn't it already know where the card is?
How is the quantum system able to correctly "guess" the position of the queen without "knowing" anything about the system? How is it possible for the system to "perceive" something completely randomized and disconnected as a shuffled deck of cards? In short, what is the theory that describes how this is possible?
The only way the quantum computer could "calculate" the position of queen would be to somehow "sense" the wavefunction of the queen card and thereby locate its position. Correct?
Amazing technology, I never thought such a powerful research tool would ever be able to exist like this and available to the public! Amazing learning tool!
Hey, Grover! Guess what. I only pretended to want to find the queen, but I really wanted the jack. How about you find the right card without me telling you which one I want.
+Simon Carlile You can implement Shor's algorithm to factorize semiprime numbers. The complexity of the algorithm is not the issue - the limiting factor is the difficulty of building a processor with enough qubits to factorize large numbers.
I love what you're doing, IBM, now it's way easier to study quantum computing - because we basically have it available at hand! But one question; Was the queen in the 4th slot? Isn't the computer supposed to know the cards first?
+Birkes It is a search algorithm. The computer stored the queen in slot 4 (around 1:55), but it doesn't 'remember' the exact location where it stored. A classical computer would have to search for the queen by going to each of the possible slots and checking if the queen is there, until it finds it. It could find the queen on the first try (and be faster than a quantum computer!), or it could find the queen in the last place it looks. When there are many slots in which the queen could be hiding, the quantum algorithm will find the queen much faster.
The more I read about Quantum computers the less I understand. I feel like my grandparents when I explained them the Commodore 64 and the concept of bits and bytes. It was all so clear to me and I couldn't really understand why they where not able to "get it". Now we have Quantum computers and now I am like my grandparents. I try to understand it, but it makes no sense in my head.
No idea what is going on.
explanation as to how the simulator works fall short of details quite quickly. "You draw this and you get that" was not really what I needed to understand.
If the second block is used to hide the card in the 4th slot, and we already know which slot the card is in, what exactly is happening in the quantum inversion step? Doesn't it already know where the card is?
How is the quantum system able to correctly "guess" the position of the queen without "knowing" anything about the system? How is it possible for the system to "perceive" something completely randomized and disconnected as a shuffled deck of cards? In short, what is the theory that describes how this is possible?
+Emanuel Hignutt, Jr., MPH That summarizes my doubts aswell. lol
The only way the quantum computer could "calculate" the position of queen would be to somehow "sense" the wavefunction of the queen card and thereby locate its position. Correct?
I think we're somehow missing the point here since we can only think in terms of usual logic. That or IBM is playing an elaborate trick on us.
wait I am confused. it can calculate where the queen will be without any initial input information?
Amazing technology, I never thought such a powerful research tool would ever be able to exist like this and available to the public! Amazing learning tool!
Hey, Grover! Guess what. I only pretended to want to find the queen, but I really wanted the jack. How about you find the right card without me telling you which one I want.
I need a new quantum brain to have any chance of understanding what he just said.....
Good explanation on how to easily win in Blackjack :)
I don't understand how this works... could you not use the same process to predict the lotto numbers?
as an English major I feel so dumb watching this I want to cry
that mean, you can find the number of LOTO ? :)
So could you run the algorithm to find the factors of large semiprime numbers with this, or is that algorithm too complicated?
+Simon Carlile you could, but only for small numbers. For large numbers you need many more qubits (hundreds at least).
+Simon Carlile You can implement Shor's algorithm to factorize semiprime numbers. The complexity of the algorithm is not the issue - the limiting factor is the difficulty of building a processor with enough qubits to factorize large numbers.
I don't need a quantum computer to guess that the Queen is in slot 4, if I set it in the 4th slot at the start. That sounds completely bogus.
This is insane. I almost can't believe this is possible
Now I need to grab a good resource on quantum computing fundamentals :-)
+Ramy Kamel courses.edx.org/courses/BerkeleyX/CS191x/2013_Spring/info
I love what you're doing, IBM, now it's way easier to study quantum computing - because we basically have it available at hand! But one question; Was the queen in the 4th slot? Isn't the computer supposed to know the cards first?
+Birkes It is a search algorithm.
The computer stored the queen in slot 4 (around 1:55), but it doesn't 'remember' the exact location where it stored. A classical computer would have to search for the queen by going to each of the possible slots and checking if the queen is there, until it finds it. It could find the queen on the first try (and be faster than a quantum computer!), or it could find the queen in the last place it looks. When there are many slots in which the queen could be hiding, the quantum algorithm will find the queen much faster.
Time to google grover's algorithm
I'm maybe too dumb but i didn't quite get it yet...
Quantum computing is going to bring forth a bunch of awesome tech. Can't wait!
let's do some quantum experiments! :)
I didnt get what this has to do with the chance of finding the queen in 4 cards xd, dont know whats the input
Can we say that now, we can solve complex mathematic problems ?
You lost me at the quantum inversion step.
+David Hughes here the Grover's algorithm is explained in more detail: courses.edx.org/courses/BerkeleyX/CS191x/2013_Spring/info
Now, make a "quantum deep blue"
assembly language meets visual basic? how about a python api???? pretty plz sugar and spice.
nice quantum computing
uhhh... i still dont get it. ?? fukn magic I say.
What ? :D
Cool 5Qubit, dwave had 4Qubit.
couldn't understand a thing...
L'a pô compris ! Lol
Don't understand much of that, but it sounds awesome !
nice
great tbh
?
Exquisite