Siddharth Chander

Quantum Advantage: How Do Quantum Computers Perform Faster than Classical Computers in Some Situations?

Started Apr. 8, 2022

Abstract or project description

First, the paper will explain the basics of quantum computers by comparing quantum computers to classical computers, like the difference between classical bits and qubits. Also, the paper would include information about the specific differences between classical computers and quantum computers that are relevant to the problems I will discuss in my paper, for example, how often quantum gates work vs. classical gates. Then, I would research why quantum computers are believed to be faster than classical computers. There is no proof that our current classical algorithms are the fastest, even though quantum algorithms can theoretically beat current classical algorithms. Then, I would explain how quantum computers can be better than classical computers, potentially including cases or scenarios that help explain this. I would have to conduct some research for problems where we can find a good classical algorithm and then see how quantum algorithms can outperform these classical algorithms. I would also consider if other similarly structured problems could work similarly. Finally, I would explain the current progress of quantum supremacy and link that to the fundamental explanation I initially provided about quantum computing and classical computing. Moreover, I would have to explain how they are implementing these problems on quantum computers, finally explaining how the issues are done faster on a quantum vs. a classical computer. I can also use simple mathematical explanations can also be used for problem explanations. I might want to look into the timespans used to estimate how long it takes for classical computers to solve. Also, I can look into the idea that classical algorithms are not the best now and can become better to lower a quantum advantage.