Quantum

Shor's algorithm compiled on cat qubits: 22 593 qubits for RSA-2048 in 3.14 days

Read full article at source ↗

Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 30/10/2026, 06:43:25 UTC.

Briefings

A research paper presents a resource estimation for Shor's algorithm on superconducting cat qubits, detailing circuit designs and physical layouts for factoring RSA-2048. The study identifies that RSA-2048 requires approximately 23,000 cat qubits and 3.14 days under ideal conditions, with a bit-flip error rate of 5e-4. The authors also provide benchmarks for factoring ECDLP and FFDLP-512, and discuss trade-offs between space and time using error correction cycles.

Key points

• RSA-2048 factoring requires about 23,000 cat qubits and 3.14 days under ideal conditions with a 5e-4 error rate.
• Factoring ECDLP on secp256k1 requires at most 30,000 cat qubits and 1 hour, while FFDLP-512 needs 6,700 cat qubits and 21 minutes.

Context

This study provides an end-to-end resource estimation for Shor's algorithm on superconducting cat qubits, covering mathematical descriptions, logical circuits, and physical qubit allocation. It compares two architectures: one using repetition cat codes and another using LDPC cat codes, with a new parity-Cnot gate and active injection procedure for cat qubits.

Limitations

The resource estimates assume a 10 microseconds reaction time and a 1 microsecond error-correction cycle time. The analysis does not account for bit-flip errors, which would significantly increase qubit requirements. The study also does not provide a complete physical chip layout, only circuit-level designs and schedules.

Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 30/10/2026, 12:05:34 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.

View archived briefing on IPFS
bafybeibgoknrfkzjeamvo3l5gtiydxb5ubdcksznjgwbq6wuqkmitnl26q