James Wootton
@decodoku.bsky.social
Misusing quantum computers for fun and/or science. Spock at Moth Quantum. Two Ts and no Es. All nonsense here is my own doing
Reposted by James Wootton
Devastated that I didn’t make the cut James! :’(
Rapid Dissipative Ground State Preparation at Chemical Transition States
Simulating chemical reactions is a central challenge in computational chemistry, characterized by an uneven difficulty profile: while equilibrium reactant and product geometries are often classically ...
arxiv.org
February 16, 2026 at 12:21 AM
Devastated that I didn’t make the cut James! :’(
Next week I am hoping for a paper with an algorithm that helps me to proofread bluesky posts, but I think that might be QMA hard.
February 13, 2026 at 12:37 PM
Next week I am hoping for a paper with an algorithm that helps me to proofread bluesky posts, but I think that might be QMA hard.
And then another end-to-end architecture, this time looking at how the best way to use qLDPC codes for the one big application we all know about: breaking current crypto systems. The team at Iceberg Quantum show that it can be done with less that 100k physical qubits.
arxiv.org/abs/2602.11457
arxiv.org/abs/2602.11457
February 13, 2026 at 9:59 AM
And then another end-to-end architecture, this time looking at how the best way to use qLDPC codes for the one big application we all know about: breaking current crypto systems. The team at Iceberg Quantum show that it can be done with less that 100k physical qubits.
arxiv.org/abs/2602.11457
arxiv.org/abs/2602.11457
If we are comparing to 1st century Galilean miracle workers, perhaps Majoranas are more like Shimon bar Yochai: Spends years naked in a cave, but expected to suddenly emerge with superpowers.
February 4, 2026 at 10:01 AM
If we are comparing to 1st century Galilean miracle workers, perhaps Majoranas are more like Shimon bar Yochai: Spends years naked in a cave, but expected to suddenly emerge with superpowers.
Banishing 512 might be easier.
February 3, 2026 at 7:30 AM
Banishing 512 might be easier.
No, distance 3
arxiv.org/abs/2112.03708
arxiv.org/abs/2112.03708
Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code
Quantum computers hold the promise of solving computational problems which are intractable using conventional methods. For fault-tolerant operation quantum computers must correct errors occurring due ...
arxiv.org
January 30, 2026 at 10:25 AM
No, distance 3
arxiv.org/abs/2112.03708
arxiv.org/abs/2112.03708
It's a 17 qubit rotated surface code.
January 30, 2026 at 10:06 AM
It's a 17 qubit rotated surface code.
The background did indeed highlight the experience
January 30, 2026 at 6:20 AM
The background did indeed highlight the experience
Yeah, that would be an interesting and novel test. Especially now that @andreasateth.bsky.social at ETH has finally provided us some loophole free Bell tests.
January 28, 2026 at 4:16 PM
Yeah, that would be an interesting and novel test. Especially now that @andreasateth.bsky.social at ETH has finally provided us some loophole free Bell tests.
In terms of the 'early fault tolerance' naming debate. This seems a bit more on the NISQ with FTQC sprinkles side, but could also help out in the early days of full FTQC.
bsky.app/profile/deco...
bsky.app/profile/deco...
What does early FTQC mean? It seems to be an increasingly popular term, but usage seems to split into two camps.
One is FTQC but early. So you have logical qubits with a decent distance, magic state production to support logical non-Cliffords. It's just early because you don't have a lot of it.
One is FTQC but early. So you have logical qubits with a decent distance, magic state production to support logical non-Cliffords. It's just early because you don't have a lot of it.
January 27, 2026 at 10:29 AM
In terms of the 'early fault tolerance' naming debate. This seems a bit more on the NISQ with FTQC sprinkles side, but could also help out in the early days of full FTQC.
bsky.app/profile/deco...
bsky.app/profile/deco...
Quantum computing wouldn't be where it is today without the cryptographic applications of Shor's algorithm. We've been militarized for 30 years, and just pretending otherwise. But I definitely support finding ways to fill up QPUs with more inspirational applications.
January 23, 2026 at 12:33 PM
Quantum computing wouldn't be where it is today without the cryptographic applications of Shor's algorithm. We've been militarized for 30 years, and just pretending otherwise. But I definitely support finding ways to fill up QPUs with more inspirational applications.
Yes, I agree that this approach will definitely be a thing on the journey to fault-tolerance. But it should should it's own term, and "partially fault-tolerant" seems good to me.
January 20, 2026 at 7:02 AM
Yes, I agree that this approach will definitely be a thing on the journey to fault-tolerance. But it should should it's own term, and "partially fault-tolerant" seems good to me.
That's a definition I can get behind!
January 20, 2026 at 7:00 AM
That's a definition I can get behind!