For the first time, we can directly probe the logical failure rates needed for applications like RSA factoring, which requires around 1 billion logical cycles across ~1,000 logical qubits.
We used Crevasse to simulate the fault-tolerant protocols from Pinnacle 1. Together with new circuits we’ve developed for RSA factoring, its performance lets us use smaller error-correcting codes than we originally expected.
We’ve run trillions of simulations to test our fault-tolerant quantum architectures, thanks to our new decoder, Crevasse. We think it’s the first QLDPC decoder with both the speed and accuracy needed for utility-scale quantum computing.
Release: iceberg-quantum.com/blog/rel…
excited to share some new work on modular and efficient surgery for quantum ldpc codes. check out the blog post.
iceberg-quantum.com/blog/mod…
excited to share some of what we’ve been cooking up at Iceberg. we introduce fast surgery, a method for performing logic in qldpc codes quicker. check out our blog post.
iceberg-quantum.com/blog/fas…
