ArchiveAnon !dTGY7OMD/g ID: ddab04 Explaining this all as simply as possible Dec. 17, 2017, 3:06 p.m. No.42   🗄️.is 🔗kun   >>6139 >>67

I'm the person who has been working on making a really simple explanation of everything. I've been attempting to cover everything anyone who wildly stumbles upon this might not know (so for example how RSA works, what big O notation means, what a nested loop is, as well as obviously explaining the grid and the whole point of all of this). Here's most of what I've done so far. I haven't had a lot of free time so I thought the most useful use of my time would be working on that "map" that VQC suggested we make. Obviously anyone is welcome to either suggest that this is complete shit or make changes or point out anything incorrect or work on their own version or anything like that. This work isn't about the individuals. It's about the result we get by working together. That's why if we can all get on the same level in terms of understanding, things might get done more quickly.

ArchiveAnon !dTGY7OMD/g ID: ddab04 Dec. 17, 2017, 3:07 p.m. No.43   🗄️.is 🔗kun

That said, I've been stuck on the quantum computing part for several days now. I understand the concepts, but after searching everywhere I could think to, there seems to genuinely be no explanation of how quantum algorithms are run that doesn't completely gloss over very important parts.

 

So using prime factorization as an example, we could have a huge list of numbers with a qubit associated with each one, and in order to find the number in the list we're looking for we would rely on finding the qubit with the highest probability. Each qubit would be represented as a wave, and, to begin with, they would all have the same amplitude/probability (so for example if there were 8 numbers in the list then each qubit or group of qubits represented with one coefficient would be represented as 1/8 probability).

>Then you do a global operation on all of the qubits which inverts the amplitude of the answer you want

>Then you do another global operation on all of the qubits which amplifies the difference between each amplitude and those of the equal superposition states, which greatly amplifies the one you want

>Then you can repeat the last step to amplify it even more

>Then you'll find the answer with a really high probability, and you can verify it with a regular computer

I cannot for the life of me find anything anywhere that explains how these steps actually work instead of just rewording what I wrote. How in the hell do you do some kind of global operation on the qubits that inverts the amplitude of the answer you want? You'd have to know the answer already in order to know what to invert, and that defeats the purpose of looking it up. This one has been bugging me the most. I also haven't been able to find an explanation of the second step, in which the differences between the amplitudes are used to make the one you inverted the highest probability, but that seems like it would only be a matter of some kind of equation or whatever. It also seems like it would take O(n) time, though, which would make it take as long to do as prime factorization on a regular computer, rendering the whole thing useless. I can't find any good explanations for either of these things (not to mention that I still have no idea how this grid even relates to quantum computing in the slightest, although I might if I understood these steps). I really hope someone here can explain these things to me, not only for my own benefit and understanding, but so that I can hopefully turn it into a simple explanation for everyone else who has no idea what this means, since I always seemed to be good at that.

AA ID: ddab04 Dec. 17, 2017, 11:11 p.m. No.186   🗄️.is 🔗kun   >>187 >>189

>>54

>we have a small team working on this stuff here and lurking

I know, I'm the BO

>could you post a simple step by step for a non-coder to get this to work?

I'll get right on it. If you weren't aware, the code has been rewritten in a few other languages. I'll probably only be able to put a guide together for Python and Java, since I've never really used C# or Rust.

 

>>67

Good to know it was worth the time. Thanks! My goal with this, as well as making a map like VQC suggested, is to turn it into a guide that explains the entirety of the process, including how the grid can act as a quantum computer (which I actually don't really grasp myself yet) and how it can be applied to other things. Hopefully I can get a bit more free time at some point and work harder on it than I currently can.

>You should include a virus scan of it

If someone was going to put malicious Javascript into a pdf, wouldn't they also forge the virus scan? Wouldn't it make more sense for someone other than me to do that? I also don't know how

 

>>65

>>68

It's pretty good. It explains many things better than I'd written so far. I can see where you're going with the vector diagram too. Two things I can think to critique: it's probably better to have all the information in one place rather than linking to videos (especially in an infographic since you can't highlight and copy text), and I'm hoping this is leading to an explanation of how to use Shor's algorithm on the grid, because I still have no idea how that's meant to work. My own personal problem is that there are several little things I don't get about quantum computing that I'm having such a hard time finding simple enough explanations for, and without understanding those little things I don't seem to be able to grasp the bigger picture. It seems like this explanation is getting there (obviously it isn't finished), so I'm hoping if you're continuing with it that you're using the grid as an example.

Anonymous ID: ddab04 Dec. 18, 2017, 1:19 a.m. No.242   🗄️.is 🔗kun   >>278

>>241

I'm going to have to change the pdf then. I wrote it based on {f, b, a, x, d, n}. I wondered why the fuck we were doing that. That made no sense to me.

Anonymous ID: ddab04 Dec. 18, 2017, 2:10 p.m. No.352   🗄️.is 🔗kun   >>357

>>278

Well I'd also tried to rewrite it in Java but I didn't know how HashMaps worked. I was the one who added the image generator to your code.

Anonymous ID: ddab04 Dec. 20, 2017, 2:49 a.m. No.707   🗄️.is 🔗kun   >>713

>>590

Feel free too if you want. We do have pdf support, and we have several pdf-related boards (/pdfs/, /pdf/, /zundel/, about ten more when I use the search function just now) so it's not like everyone's opposed to pdfs as a file format. It would make it less likely that anyone would unintentionally run malicious Javascript that they might think I put into it of course. I just personally prefer typing it out.

 

>>652

It's what I'm here for thus far, so you're welcome. If you have any suggestions let me know. I'm not really sure what I should be focusing on next because I'm struggling to get my head around the relationship between the grid and quantum computing (I'm the annoying one from the other thread who keeps whining about it).

Anonymous ID: ddab04 Dec. 20, 2017, 4:03 p.m. No.728   🗄️.is 🔗kun   >>730

>>713

Well, I don't blame them. As interested in a lot of declassified CIA documents as I am sometimes (particularly the remote viewing ones) I don't tend to look at them since they're always pdfs. Is there anything you need me to fix about it before you turn it into an infographic or whatever? I typed it out in one go kinda quickly and didn't really go over it.

Anonymous ID: ddab04 Dec. 20, 2017, 4:46 p.m. No.732   🗄️.is 🔗kun   >>735

>>730

Have you thought of starting from near the bottom of where you currently are and pasting the pieces together in a different Paint-style program when you're done?