7 ms·

Hi! I put this guide together and I'm really glad you brought this point up. When I thought of creating this guide, I wanted to make it really easy for beginner

Hi! I put this guide together and I'm really glad you brought this point up. When I thought of creating this guide, I wanted to make it really easy for beginners to graduate level by level up to quantum gates, which inspired me to instead break the information down in a series. This Part-1 guide in the series is mean't to educate even complete noobs from how a basic computer works and how we have reached the limits of making them any more powerful. While you are accurate when you say Quantum algorithms can help us exploit the quantum behaviour of qubits, we are particularly interested and motivated to utilize them because we can exponentially increase our computing power. I have another follow-up guide coming that would take the readers a few more levels up very soon.

justinpombrio 9y ago
> we are particularly interested and motivated to utilize [quantum computers] because we can exponentially increase our computing power. On some problems. Quantum computers are --- to the best of our knowledge --- exponentially faster at computing some things (e.g. discrete log and factoring), quadratically faster at others (e.g. NP-complete problems), and no better than classical computers at others. (I assume you know this since you're writing an article on quantum computers, but want to clarify for others.)
- utkarshs12 9y ago
  Well, I kind of knew that people might associate the increment in computing power with that required in their daily computing needs like watching Youtube videos for example; for the same reason I made sure to explicitly mention in the Introduction, that - "it [Quantum Computers] promises tremendous computing power enough to help us solve some really tough mathematical problems that are holding back our progress in a number of fields."
Shikadi 9y ago
It might be worth noting that this seems more to do with why different transistor types are being used (fin-fets, nano tubes, etc) since we really haven't reached the physical limit of "traditional" transistors yet. I'd also argue that the motivation behind quantum computers is very much unrelated to limitations on transistor sizes, and more about the algorithms that can potentially be much faster than on traditional logic, such as shor's factoring algorithm

justinpombrio 9y ago

> we are particularly interested and motivated to utilize [quantum computers] because we can exponentially increase our computing power. On some problems. Quantum computers are --- to the best of our knowledge --- exponentially faster at computing some things (e.g. discrete log and factoring), quadratically faster at others (e.g. NP-complete problems), and no better than classical computers at others. (I assume you know this since you're writing an article on quantum computers, but want to clarify for others.)

utkarshs12 9y ago
Well, I kind of knew that people might associate the increment in computing power with that required in their daily computing needs like watching Youtube videos for example; for the same reason I made sure to explicitly mention in the Introduction, that - "it [Quantum Computers] promises tremendous computing power enough to help us solve some really tough mathematical problems that are holding back our progress in a number of fields."

Shikadi 9y ago

It might be worth noting that this seems more to do with why different transistor types are being used (fin-fets, nano tubes, etc) since we really haven't reached the physical limit of "traditional" transistors yet. I'd also argue that the motivation behind quantum computers is very much unrelated to limitations on transistor sizes, and more about the algorithms that can potentially be much faster than on traditional logic, such as shor's factoring algorithm