Strilanc

11 ms·

91.
by Strilanc 2y ago
The interesting part of this project is compiling doom into a weird target architecture: a .qasm circuit file. This requires you to do things like decompose additions into TOFFOLI gates. But the code in the repo doesn't include that pa
92.
by Strilanc 2y ago
> I have not seen even a theoretical framework allowing both to be increased simultaneously. The threshold theorem [1], showing this can be done in principle, was proven more than a decade ago. But you don't have to believe the th
93.
by Strilanc 2y ago
The threshold is where you transition from needing infinite qubits to make an error corrected logical qubit, to needing a mere finite number. So... somewhere between 1 and infinity (exclusive). Actually, because "in theory there's
94.
by Strilanc 2y ago
It's impossible produce a result incompatible with classical mechanics in a single constant-sized observation, because the classical players can get any result by just playing randomly. The advantage that GHZ has, similar to the Mermin
95.
by Strilanc 2y ago
If you want to try your hand at violating Bell inequalities, there are widgets in [1] that allow you to input strategies (as javascript) for Alice and Bob. It continuously performs Monte Carlo sampling of the strategies and presents their s
96.
by Strilanc 2y ago
When I went to the APS March Meeting earlier this year, I talked with the editor of a scientific journal and asked them if they were worried about LLM generated papers. They said actually their main worry wasn't LLM-generated papers, i
97.
by Strilanc 2y ago
No, that's not true at all. For example, a chemistry simulation can be done in first quantization; where the state is a list of superposed 2s-complement integers indicating the positions of the electrons (as opposed to a more direct o
98.
by Strilanc 2y ago
Quantum/classical is orthogonal to the analog/digital distinction. There are analog quantum computers and digital quantum computers. Analog quantum computers (like annealers) are simpler to make, and they have a lot more play w.r.
99.
by Strilanc 2y ago
Not unless you can isolate the computer from environmental noise exponentially well. Otherwise you'll need to spend exponential energy on entropy removal / error correction (e.g. keeping the dilution fridge running).
100.
by Strilanc 2y ago
Ah, but the ternary operator solution requires repeating the name of the variable twice. And obviously, since you're writing in Java, your variable name will be at least 50 characters long. Thus making `Objects.requireNonNullElse` shor
101.
by Strilanc 2y ago
It's very strange to me that the teacher would push the students from the correct solution using a loop, towards an incorrect solution using a logarithm. A logarithm could work in a language like C where ints can't get too large,
102.
by Strilanc 2y ago
Yeah that's roughly it. In classical computers all errors can be simplified as being bit flip errors (0 instead of 1, 1 instead of 0). Like, power loss is a lot of bit flip errors that happened to target the bits that should have been
103.
by Strilanc 2y ago
If you have a more modern estimate I'll take it. Very interesting about the CMOS sensors distinguishing +- 2 electrons (40K / 2^14).
104.
by Strilanc 2y ago
Yeah, I agree it's unusual to describe "increased brightness" as "bigger distance repetition code". But I think it'll be a useful analogy in context, and I'd of course explain that.
105.
by Strilanc 2y ago
It's because unintended measurement is a type of error in a quantum computer. Like, if an electron passing near your qubit would get pushed left if your qubit was 0 and right if was 1, then you will see errors when electrons pass by. R
106.
by Strilanc 2y ago
I think you're picturing a different level of the network stack than I had in mind. Yes, above the physical level they will be explicitly using very sophisticated codes. But I think physically it is the case that messages are transmitt
107.
by Strilanc 2y ago
Wasn't expecting my question to hit top of HN. I guess I'll give some context for why I asked it. I work in quantum error correction, and was trying to collect interesting and quantitative examples of repetition codes being used i
108.
by Strilanc 2y ago
Another danger is some sort of bug in Lean itself. This isn't unprecedented in theorem provers [1][2]. These might be hard to hit by accident... but there are larger and larger collaborations where arbitrarily people fill in steps (lik
109.
by Strilanc 2y ago
Wasn't the exponential increase in data and compute always part of the scaling hypothesis? That's my memory of it from reading [1] years ago. Most of the field thought scaling would hurt, openai thought you'd get logarithmic
110.
Satisfaction and progress in open-ended work(blog.andymatuschak.org)
2 points by Strilanc 3y ago|0 comments
111.
by Strilanc 3y ago
I would describe classical correlations as downgraded entanglement. Correlation is what's left when entanglement decoheres / undergoes uncontrolled phase noise. Things you should be able to do, like win the Mermin-Peres magic squa
112.
by Strilanc 3y ago
"Thinking, Fast and Slow" was written before the replication crisis was found. I wouldn't call it "debunked", but some of the research it used didn't replicate. For example, see https://replicationin
113.
by Strilanc 3y ago
I maintain that Dyakonov's arguments are completely missing the mark. I predict this will be experimentally obvious, instead of just theoretically obvious from linearity, within 5 years (due to the realization of logical qubits with li
114.
by Strilanc 3y ago
That paper[1] is a joke. The main argument it makes is based on counting amplitudes, and noting there are far too many to ever control: > The hypothetical quantum computer is a system with an unimaginable number of continuous degrees of
115.
by Strilanc 3y ago
For quantum computers to break RSA2048, the current quality of physical qubits needs to go up 10x and the quantity needs to go up 10000x. These are rough numbers. The next major milestone to watch for is a logical qubit with fidelity 1000x
116.
by Strilanc 3y ago
When you apply a statistical test, the various outcomes cause Bayesian updates that correspond to adding or subtracting fixed bits of evidence. When you repeat the test (and the repetitions are independent), the amount of bits of evidence y
117.
by Strilanc 3y ago
Search "decibels" in https://www.yudkowsky.net/rational/bayes for the explanation. I think you're just wrong about needing everything to be in the form X:1 or 1:X. When I compute the ratio of 1000000:1 d
118.
by Strilanc 3y ago
A log-odds of b bits means an odds of 2^b : 1 which means a probability of p = 2^b / (2^b + 1). In the original comment, the evidence update was stated as going from 20:1 to 1:1000000 and it was claimed this was approximately 24 bits o
119.
by Strilanc 3y ago
It's important to understand that when they said "bits" they didn't mean information in the Shannon entropy sense, but rather in the log-odds evidence sense. Gaining a Shannon entropy bit means learning the answer to a y
120.
by Strilanc 3y ago
A government site has implicit authority. You could use that implicit authority to make a scam look more authentic. It also will have a lot of traffic; a lot of opportunities for the scam to work if you do manage to get in the middle. For e

More ›