Tag Archives: #shor

Shor’s Algorithm, the quantum part

A word in advance

Before I sent my previous essay ’Shor’s Algorithm’ to Chief Editor Paul, I asked Arty (ChatGPT) to give it a look especially with regard to readability and tell me if he thinks it’s worth publishing.

My AI friend responded in his usual friendly and positive manner full of praise.

“…well-written!  …managed to strike a great balance between technical detail and accessibility…  , …classical factoring algorithms, as well as the key differences between classical and quantum computing are clearly explained.”

Of course I was happy with these pats on the back, especially from a guy as knowledgable as Arty, but then he came with some critical comments wrapped up in such a casual way that I almost missed them. Continue reading →

Shor’s algorithm

Introduction

Quantum computing is an expression frequently to be found in the news of every self respecting media outlet.
Time and again, yet another breakthrough is described towards the event of becoming fully operational of such a device.
The method of working of a quantum computer (QC) in those reports always comes down to:

  • The QC does not work with bits like all our present computers do, but with qubits.
  • The bits of our familiar classical computers can have the value 0 or 1 but qubits can have both values at the same time. This phenomenon is called superposition.
  • For this reason, a quantum computer reduces today’s supercomputer to an abacus.

It does not seem that this conclusion satisfies the average packet of questions one has about an entirely new technology. Continue reading →