Viewing profile — s1dev
s1dev
HN member- Joined
- Sun, Dec 01, 2019, 3:55 AM UTC
- HN karma
- 112
- Public activity
- 45 items
- HN profile
- View on Hacker News ↗
About s1dev
No profile information was provided.
Recent public activity
-
comment
Comment #42197534
When maintaining a quantum memory, you measure parity checks of the quantum error correcting code. These parity checks don't contain any information about the logical state, just (…
-
comment
Comment #40565783
I often wondered why MIMO was such an investigated topic. It would make sense if the Shannon limit is higher for this channel. Is there a foundational paper or review that shows th…
-
comment
Comment #40565726
I believe that a classical radio receiver is measuring a coherent state. This is a much lower level notion than people normally think about in QEC since the physical DoF are usuall…
-
comment
Comment #40074359
Are Q-switched / pulsed lasers common in industrial applications?
-
comment
Comment #40045979
What bank is this and are they available nationwide?
-
comment
Comment #40025291
For a circuit of size C, the size of a fault tolerant circuit to compute the same thing is O(C polylog C) https://arxiv.org/abs/quant-ph/9906129
-
comment
Comment #39914977
I’m generally in agreement with the anti-bash camp, but I can name about that many :) - Mutating default arguments to functions, so subsequent calls have different behavior - Somew…
-
comment
Comment #39187728
A few things come to mind from more modern aircraft like the 787/A350: Fly by wire (flight envelope protection), electronically actuated control surfaces (less hydraulics / reduced…
-
comment
Comment #38714142
I want to point out that the experiment was at Harvard in the Lukin group. There is a proposal for constant-rate encodings using large quantum low-density parity check codes via at…
-
comment
Comment #38149419
This is pretty neat! I think it's worth doing more analysis on the entropy cells separately from the entropy extractor. For example, the von Neumann extractor requires exchangeabil…
-
comment
Comment #37157572
Is there some good intuition why P-complete problems are difficult to parallelize? This is the first I've heard of it (but then again, I'm usually interested in more obscure comple…
-
comment
Comment #36577398
This is not quite true. You only need to keep the qubits at a fixed temperature as you scale the system, so the resources required to add additional qubits grow only polynomially w…
-
comment
Comment #35856700
I hear good things about this book “how to prove it” I also like Knuth’s art of computer programming book which is more about proving correctness of algorithms In general, stuff li…
-
comment
Comment #34357040
Yes. Breaking things in aviation frequently results in a body count
-
comment
Comment #34178053
The correction card is legally required equipment and there are a few maintenance items that trigger a requirement to update it
-
comment
Comment #33765543
What experimental evidence of quantum gravity is there? I like to argue for theoretical evidence of quantum gravity, but afaik there hasn’t been any experiments to rule out classic…
-
comment
Comment #33398131
It is worth noting that all known classical algorithms to solve this problem scale exponentially with the problem size, and fundamentally there is no reason why putting 60 or 70 qu…
-
comment
Comment #32434432
I once ran across an application that had a heap footprint for which the size was fixed at runtime. The data locality loss from the indirection killed the performance. In principle…
-
comment
Comment #32216135
More or less, we're just before the finish line. About 20% lower noise and we'll be there. For every little bit past that, the overhead gets reduced immensely https://arxiv.org/abs…
-
comment
Comment #32204993
Quantum error correction is a key ingredient for future realizations of fault-tolerant quantum computers. Physics is local, so errors in far separated regions of the device are onl…
- story
-
comment
Comment #31777114
From a theoretical point of view, this is evidence that quantum computing is a more powerful model of computation. I think it would be hard to argue that a model of computation tha…
-
comment
Comment #31481027
I don’t think anyone does grad school expecting that it’s going to be a good investment. Most people I know do it because they can’t imagine themselves doing anything other than re…
-
comment
Comment #31051019
There is an extremely broad range of scaling between linear and exponential… Even in architectures with nearest neighbor gates, the (multiplicative) overhead stemming from error co…
-
comment
Comment #28555176
Here's a few references https://doi.org/10.1145/2492101.1555372 https://doi.org/10.1145/2786763.2694348 https://doi.org/10.1109/DSN.2015.57