Strilanc

45 ms·

511.
Performance retrospective of an html5 quantum circuit simulator(algorithmicassertions.com)
1 points by Strilanc 10y ago|0 comments
512.
by Strilanc 10y ago
Outputting floats instead of discrete values actually sounds like a very exploitable hole to me. It reminds me of the classic "check if your model corresponds to reality" example where a one-time pad is broken: the standard said &
513.
by Strilanc 10y ago
> the great majority of HN discussions start with a comment like this one: It's seriously flawed, etc. That's easily the best part of HN and reddit. A great help with the Murray Gell-Mann Amnesia effect. I don't think it
514.
by Strilanc 10y ago
The protocol from the paper already includes a 'verify token' function. I don't see how teleporting the token, vs using a more typical quantum channel like a fiber optic line, would increase any of the risks. ... ... Maybe th
515.
by Strilanc 10y ago
The conversion into a classical check bit sounds kind of trivial, since the bank has to do the verification of the check. Just add some EPR pairs to the token and use them for teleportation. The measurement results of the teleportation are
516.
by Strilanc 10y ago
They literally mean "not spending any energy doing the computation". We spend energy on computation for two fundamental reasons: 1) zeroing data and 2) error correction. You avoid zeroing data by doing reversible computation. You
517.
by Strilanc 10y ago
That is some impressively terrible UX for a website.
518.
by Strilanc 10y ago
I really don't get the appeal of IIT. Smells like curve fitting, which would be fine except they don't have anything solid to fit against . I agree with essentially everything Scott Aaronson has said about it [1][2]: > When w
519.
by Strilanc 10y ago
I try to call it inductive programming whenever possible. Because that's what it is: a programmatic form of proof by induction. The analogy isn't exact (e.g. it could also refer to just recursion), but it's a lot more apt tha
520.
by Strilanc 10y ago
Doing it client-side defeats the purpose of certificate pinning. Three years after you rolled out pinning, new users would still be using max ages that were clamped too low.
521.
by Strilanc 10y ago
Try the video series Quantum Computing for the Determined [1] My simulator, Quirk [2], is a bit easier to experiment with than IBM's. But it still assumes you know the basics. 1: https://www.youtube.com/playlist?list=PL
522.
by Strilanc 10y ago
> a modal dialog box pops up about subscribing to the newsletter I was wondering why I had the site marked as untrusted to execute javascript. That answers that.
523.
by Strilanc 10y ago
Server software might be able to help with some of the foot-gunning mentioned in Scott Helme's writeup. For example, web servers that were just configured to do cert pinning for the first time could default to giving a 5-hour grace per
524.
by Strilanc 10y ago
It's not the same kind of quantum computer. D-Wave makes an annealer. They also have a history of making grandiose claims. I think getting to fifty proper qubits will be a much bigger deal than D-Wave getting to even ten thousand &quot
525.
by Strilanc 10y ago
https://en.wikipedia.org/wiki/Logistic_function#In_ecology:_...
526.
by Strilanc 10y ago
This is a great talk. Like, I am going to be linking people to this for years. It mentions the basics, goes over an example use, and just generally has the perfect amount of "this could be cool". The one thing that bothered me,
527.
by Strilanc 10y ago
Yet another press release that fails to reference the study it's talking about. Not to mention giving no quantitative details about its lead ('Trounced'? By how much?). The study is "Predicting non-small cell lung cancer
528.
by Strilanc 10y ago
Seems to work fine for -1: f(-1, -1) = sum_{n=0}^b 2^n (floor(-1/2^n) mod 2) (floor(-1/2^n) mod 2) = sum_{n=0}^b 2^n * 1 * 1 = 1 + 10 + 100 + 1000 + ... [in binary] = ...11111 [in the 2-adics] = -1
529.
by Strilanc 10y ago
Before the invention of the transistor, people also thought that classical computers would require layers of error correction to function reliably. From [1]: > The practical problems that concerned von Neumann and the designers of the E
530.
by Strilanc 10y ago
I suspect that the reason you'd see a stronger "skill" signal in the fantasy results than in the sport itself is that professional players are a hugely skewed sample. When a player starts doing noticeably badly, they get drop
531.
by Strilanc 10y ago
Pick any `b` you want, even infinity, and evaluate: sum_n^b 2^n (floor(0/2^n) mod 2) (floor(-1/2^n) mod 2) sum_n^b 2^n * 0 * 1 sum_n^b 0 0
532.
by Strilanc 10y ago
> The given function is clearly only defined over naturals. The post doesn't specify. Programming languages do define it over the negatives, however. I just didn't want anyone going into python and asserting that a & b &g
533.
by Strilanc 10y ago
A counterexample is 0 & -1 == 0.
534.
by Strilanc 10y ago
For 1: I didn't mean to imply anything about the work being easy or hard, by the way. I was just contrasting against the difficulty of proving BQP=BPP. (e.g. I might refer to Terence Tao's work on Navier-Stokes [1] as 'solvin
535.
by Strilanc 10y ago
It is 12:00am. I just read your "implement an alternate scalable terminal QFT algorithm" note. So, because of the restrictions on earlier operations, our input is a bunch of separable qubits. That helps a lot. At first I was think
536.
by Strilanc 10y ago
(You lost the exponent in the quote. It's 2^n, not 2n.)
537.
by Strilanc 10y ago
Humans can't solve the halting problem either. Here's a nice simple one for you: def collatz(n): while n > 1: n = n/2 if n%2==0 else 3*n+1 Is the above program guaranteed to halt for all intege
538.
by Strilanc 10y ago
It lets you bypass some classical limits. It's a well known idea. For example, John Preskill mentioned entangled telescopes in a non-technical talk back in February [1]. A specific case is "NOON" states [2]: > NOON states
539.
by Strilanc 10y ago
My opinion of this paper is not very high. It's not totally confused or crankery or anything like that, but the author doesn't show the data structure they propose doing anything well. Also they seem to think that it will somehow
540.
by Strilanc 10y ago
In a cosmology with Boltzmann brains, your memories of opening doors and not seeing random fluctuations are more likely to be part of a random fluctuation than to be caused by having actually experienced that. Heck, your moment-to-moment ex

More ›