Why Haven't Quantum Computers Cracked 21 Yet? Unraveling the Mystery Behind the Quantum Computing Revolution
The world of quantum computing has been hyped as the next big thing, promising a revolution in computing power. But is it all just marketing hype? And what about the fear that quantum computers could crack every encryption algorithm we use today? Well, it turns out that's not the case just yet. At least not for the number 21.
The crux of the matter lies in the exponential increase in the number of quantum gates required to perform factoring. In 2001, quantum computers could factor 15 using a mere 21 two-qubit entangling gates. But when it comes to factoring 21, the number of gates skyrockets to 2,405, an astonishing 115 times more. This is due to the intricate workings of Shor's algorithm and the overhead of quantum error correction.
This revelation casts a shadow over the idea of a post-quantum cryptography world, as recently highlighted in a paper by Dennish Willsch et al. The paper underscores the challenges that both analog and digital quantum computers face in performing factorization. For instance, a digital quantum computer would need a staggering several million physical qubits to factor 2048-bit RSA integers.
So, while quantum computing is undoubtedly a fascinating and rapidly advancing field, it's important to temper our expectations. The journey towards practical quantum computing and its potential impact on cryptography is far from over, and it's a complex path filled with technical hurdles.
