Quantum Circuit Research Advances Highlight Cryptography Risks

Recent research in quantum computing has focused on the efficiency of quantum circuits and their potential impact on cryptographic security. Developments in this area are driven by ongoing work from researchers including Craig Gidney, a software engineer at Google’s Quantum AI team.

In 2025, Gidney co-authored studies that analyzed the resources needed for quantum algorithms to address cryptographic challenges. One paper estimated that Shor’s algorithm could be used to break secp256k1 elliptic-curve cryptography with as few as 1,200 logical qubits and tens of millions of Toffoli gates, potentially executable in minutes on certain superconducting quantum systems.

Another 2025 publication introduced Decoded Quantum Interferometry (DQI) circuits, which were shown to achieve verifiable quantum advantage for the Optimal Polynomial Intersection problem. The resource estimates for these circuits reached approximately 5.72 million Toffoli gates, indicating the scale of computation required for such tasks.

Gidney’s work also distinguished between fast-clock and slow-clock quantum architectures. The research noted that fast-clock systems could allow on-spend attacks on public mempool transactions in cryptocurrency networks, highlighting specific risks related to transaction security.

What the numbers show

• Shor’s algorithm could break secp256k1 using about 1,200 logical qubits.
• Decoded Quantum Interferometry circuits require around 5.72 million Toffoli gates.
• Factoring a 2048-bit RSA integer may be possible in under a week with fewer than one million noisy qubits.

In addition to algorithmic research, Gidney has published several techniques for optimizing quantum circuits. These include methods for reducing T-gate counts in adders and improving the resource efficiency of Shor’s algorithm and other quantum arithmetic operations.

Gidney also developed a tool called 'Stim', which is a fast stabilizer circuit simulator. This simulator is capable of analyzing large surface-code circuits within seconds, supporting the evaluation and testing of quantum error correction schemes.

Further contributions include a streamlined version of Shor’s algorithm published in 2025. This work showed that factoring a 2048-bit RSA integer could be achieved in less than a week using under one million noisy qubits, offering a new perspective on the practical requirements for quantum cryptanalysis.

Gidney holds patents related to quantum circuit optimization. These patents cover techniques for moving surface-code patches and reducing T-gate counts, supporting ongoing improvements in quantum hardware and software design.

* This article is based on publicly available information at the time of writing.