Post Your Answer
4 months ago in Quantum Computing By Rinku
Can quantum computers really outperform classical supercomputers?
I am trying to situate quantum computing within my broader computer architecture research. The claims of exponential speedup are compelling, but the demonstrated examples factoring with Shor's algorithm on a few qubits, or the random circuit sampling problems feel far removed from useful scientific computing. I want to understand where the field actually stands, not where the press releases say it stands.
Â
All Answers (2 Answers In All)
By Venu M Answered 2 months ago
Replied 1 week ago
By Rinku
Thanks! That clears things up.
Reply to Venu M
By Hitesh Answered 2 months ago
Exactly. Another way to think about it is that quantum computers provide algorithmic speedups for particular tasks. For example, Shor’s algorithm can factor large numbers exponentially faster than classical algorithms, and Grover’s algorithm offers quadratic speedups for searching unsorted data. But for general-purpose calculations, classical supercomputers are still more practical and reliable.
Replied 1 month ago
By Rinku
Ah, I see now. Thanks for the examples. it really helps to understand
Reply to Hitesh
Related Questions