Alexander Condello

Sure, yeah. So one of the problems that we solve to pick an example would be imagine that you have a collection of people, this collection of people has relationships between them, and they're either friendly or hostile. So you know, imagine you and and all of your co workers, some people in the building, you know, you're friends with some people in the building, maybe you don't get along so well with and some people in the building you don't know at all. So there's sort of three types of relationships within this network. You have friendly relationships, hostile relationships, and no relationships. Now, imagine that you want to divide this group into two teams. You want to have a red team and a blue team, such that within each team everyone is very And between these two teams, all the hostile relationships, because that makes for, you know, a fun competition, you want to have a company soccer game or something like that? Well, this is a problem that's really well suited to our system. And the reason for that is that our cubits, as I mentioned earlier, start their computation in superposition. So they're both sort of negative one in one or both zero and one. And they end their computation in a classical state. So they've picked either zero or one, which corresponds to those two teams that I've described. The other thing that is important to understand about our cubits is that they're connected pairwise. So one cubit has a relationship with another qubit. But there's no sort of three way relationships. I don't have relationships between three cubits which corresponds to app, our social network that I described before, where I'm friends with you, but I'm not so much friends with this other person. So fundamentally pairwise relationships, and at the end of it, you want to minimize the number of violations to a rule. So I want to pick an answer such that I have as few violations, I have as few hostile relationships within my team and as few friendly relationships across teams as possible. So that is about the most classic problem that you can put on our system that you can imagine how this is really hard to do without a visual solving, obviously, describing this, you know, over an audio format is kind of tricky. So what I would really encourage everyone to do is go check out leap, which is our online platform for solving these sorts of problems. You can go to leap, and you can click through one of our demos, which shows this problem I just described, and it uses Romeo and Juliet as the front of the science, social networking, the problem