Amit Sinha4:32
Yeah, that's a great question and part of the reason why people are still in denial is because we've been talking about quantum computing for a while. IBM was a pioneer and continues to be a pioneer in quantum computing, chipsets and infrastructure. But more recently, if you look at all the hyperscalers, Google, Microsoft, AWS, and more recently Nvidia and Cisco, they've all announced their bigger, faster, better quantum processors. So in many ways, I feel like this is the early days of transistors. Remember the Intel 4004 and the first few chips. And so where we are is in those early days of quantum computing, but the rate at which advances are happening is staggering. And most of the companies are addressing two problems. One is, how do I have more qbits, quantum bits similar to the early days of transistors? How do I pack more transistors and get more memory and more processing capabilities? The other aspect is how do I fix error correction so I can get more logical qbits out of the same physical number of qbits? Because errors in quantum computing is a big problem that needs to be solved. So my thesis is that quantum computing will have a ChatGPT moment where one day people will get up and wonder, wow, how did this disruption happen? Well, it's been cooking for a while, and all of the big tech firms are in a race for quantum supremacy because they view this as the next big thing. Now, the challenges and the advantages and disadvantages, quantum computing is a double-edged sword. If you looked at the Google announcement, they claimed that their willow chip was able to do a computation in five minutes. That would've taken the lifetime of the universe on the fastest supercomputer that's available today. So that's the massive compute capabilities that quantum computing can unleash and it can solve problems that are just infeasible today. But the flip side that we've known for a very long time is that it breaks current cryptography. The current cryptography, John, like you and I discussed, is based on these one-way math problems, like factoring large numbers into primes or discrete logarithms. So we've known for a while that Shor's algorithm can break RSA. If RSA is broken today, the internet would melt down. Similarly, we know Diffie-Hellman can be broken, and these are foundational algorithms that allow us to share keys, do encryption, do authentication. Similarly, Grover's algorithm for search exists for quantum computers that can cut down SHA256 and make it only as effective as half the number of bits. So those are the challenges. What I'd say is we are still in the early days of quantum computing, but the rate of advance is very rapid and all the big tech firms are on this race for quantum supremacy, and it's going to happen on an unpredictable timeline.