Breaking Down RSA: How QLDPC Codes Cut Quantum Computing Requirements by an Order of Magnitude

What if I told you that the number of qubits needed to break RSA encryption just dropped from over a million to around 100,000? That's exactly what researchers at Iceberg Quantum achieved by combining quantum low-density parity-check (QLDPC) error correction with algorithmic optimizations—potentially accelerating quantum cryptography timelines by years.

Why this episode matters

This episode dives into groundbreaking research that could reshape quantum computing's practical timeline. We explore how QLDPC codes overcome the physical constraints of surface codes, why hardware diversity is driving new error correction approaches, and what this means for the race toward cryptographically relevant quantum computers.

Perfect for quantum researchers, cryptography professionals, and anyone curious about the engineering challenges between today's quantum devices and tomorrow's code-breaking machines.

What you'll learn

• Why QLDPC codes outperform surface codes — How throwing out nearest-neighbor connectivity assumptions unlocks better physical-to-logical qubit ratios across multiple hardware platforms
• The algorithmic tricks that matter — How shared register reads and parallelization techniques can dramatically reduce runtime on slower quantum hardware platforms like trapped ions and neutral atoms
• What "hardware agnostic" really means — Why developing error correction methods that work across superconducting, trapped ion, photonic, and neutral atom platforms is crucial for the quantum ecosystem
• How generalized ladder surgery enables logical operations — The breakthrough that made QLDPC codes viable for full quantum computation, not just quantum memory storage
• Why decoding remains the bottleneck — The real-time classical computation challenges that still need solving to make fault-tolerant quantum computing practical
• The business model emerging around quantum architecture — How companies like Iceberg are positioning themselves as the "ARM or Nvidia" of quantum computing through specialized fault-tolerant designs
• What cryptographers should know now — Why the timeline for cryptographically relevant quantum computers may be compressing faster than expected, and why algorithmic improvements matter as much as hardware scaling

Resources & links

• Iceberg Quantum's Pinnacle paper — "Reducing the Overhead of Quantum Error Correction with QLDPC Codes"
• Craig Gidney's foundational Shor's algorithm optimization work
• Scott Aaronson's blog analysis of the research implications

Sponsor

Key insights & quotes

• "We think this is an immensely fundamentally valuable thing to do — when hardware improvements and reduced resource requirements converge, we'll be able to do something useful." — Larry, Iceberg Quantum CSO
• "It would probably be a big mistake to assume that the numbers are not going to keep going down" — on future resource requirement reductions for RSA breaking
• "At every level of scaling, new challenges emerge — it's not just a matter of taking a zero off your number" — Paul Webster on why order-of-magnitude improvements translate to real timeline changes
• "There's no obvious reason why something like the Pinnacle architecture wouldn't have an obvious impact once hardware companies reach hundreds of thousands of qubits" — on practical implementation timelines
• "This is why it's so important to have this broader perspective and not be too dependent on the assumptions of one hardware platform" — on the value of hardware-agnostic approaches