On classical algorithms running on quantum computing (both simulation and real hardware)
Summarize this article with:
Hello, everyone. I have been trying to explore more about quantum computing, based on my background in mathematics, algorithms, and artificial intelligence. I don't know very much, in fact. This question may be naive, but I have run some tests on the implementation of a single perceptron on a classical computer and on quantum hardware (using Qiskit). I can provide the notes if anyone is interested in reading them (since I don't intend to try publishing). As I don't really like or rely on LLMs, I would like to ask if anyone has seen a paper or something published about why (based on my childish tests) the performance (I have compared, as I said in the title, simulation and real hardware) is worse than on a classical computer. My thoughts on this are: Current quantum simulation and hardware are not able to be faster for mundane/classical algorithms? For certain classical algorithms, there is no possibility of any performance increase? I have bought a book, Quantum Computation and Quantum Information by Nielsen and Chuang. I think after reading the book I may be able to understand more. But for now, any thoughts, comments, or notes on this topic? submitted by /u/No-Cap4379 [link] [comments]