Viewing profile — Strilanc

That is not true. A spanning tree of physical links is sufficient to make a network where anyone can talk to anyone else. The key ingredient here is entanglement swapping [1]. Enta…

The recommendation is to not use QKD. This is the correct recommendation. QKD solves key agreement if you have an authenticated line . But authentication is the harder more crucial…

The dominant cost in Shor's algorithm is the elliptic curve point addition subroutine. That subroutine can be implemented using reversible classical gates. For that kind of impleme…

This was exactly the premise of my sigbovik April Fool's paper in 2025 [1]: for small numbers, Shor's algorithm succeeds quickly when fed random samples. And when your circuit is t…

Good post. Entirely correct, and well known amongst quantum researchers, but under appreciated in general. Grover attacks are very blatantly impractical. When someone describes Gro…

> That graph suggests that even with the best error correction in the graph, it is impossible to factor RSA-4 with less then 10^4 qubits. Which seems very odd. It's because the plo…

The newest transaction mechanism (taproot; P2TR) exposes the public key of the receiver as part of the transaction. If it becomes more commonly used, the supply of bitcoins with ex…

The DoS attack in this scenario is someone just submitting reasonable-looking but ultimately bad precommitments as fast as possible. The intuition is that precommitments must be ha…

Yes, that would be a concern. You could require a proof of work to submit a precommitment, so that DoSing was at least expensive to do. You could have some sort of deposit mechanis…

Caution: that 10M estimate assumes gate error rates 10x lower than the ones assumed in the papers from TFA.

You are assuming that progress on factoring will be smooth, but this is unlikely to be true. The scaling challenges of quantum computers are very front-loaded. I know this sounds c…

This is for rescue, not for payment. Once you've moved the coins to quantum-secure wallet, the delay would no longer be needed. ...probably some people would be very inconvenienced…

The best proposal I have heard for rescuing P2SH wallets after cryptographically relevant quantum computers exist is to require vulnerable wallets to precommit to transactions a da…

> [0.1% gate error rate] is still wildly out of reach This is false. When Fowler et al assumed 0.1% gate error rates would be reached for his estimates in 2012 [0], that was ostent…

Minor update: Dominik condensed the blog posts into a pre-print: https://arxiv.org/abs/2603.09901

That slide deck is complaining that correct work on quantum attacks should be seen as negligible priority or as distractions. TFA is complaining that JVG isn't even correct . They …

No, 15 is unique in that all multiplications by a known constant coprime to 15 correspond to bit rotations and/or bit flips. For 2047 that only occurs for a teeny tiny fraction of …

What do you mean? The original 2019 supremacy experiment was eventually simulated, as better classical methods were found, but the followups are still holding strong (for example […

What reviewers? It's not a peer reviewed article.

Agree. Scott is exactly correct when he just straight calls it crap. It's inaccurate to say it wins on small numbers because on small numbers you would use classical computers. By …

The very first demonstration of factoring 15 with a quantum computer, back in 2001, used a valid modular exponentiation circuit [1]. The trickiest part of the circuit is they compi…

For each chick they do 24 trials divided into 4 blocks with retraining on the ambiguous shape and actual rewards after each block. During the actual tests they didn't give rewards.…

Wasn't this study immediately debunked due to bad statistical methods? See https://zenodo.org/records/18002186 > Using simple simulations,we show that this pattern arises naturally…