Tag Archives: #quantumcomputer

Sequels

Our math and science author Eef has published a series of articles on Math. These articles are best read in the correct sequence for easy understanding.

Here is the order in which to read the math articles:

  1. P vs NP
  2. RSA-encryption
  3. Shor’s Algorithm
  4. a 4th article related to quantum computing is rumored to follow…

Happy 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 →

P vs NP – A promise fulfilled

P versus NP – An early encounter

My first programming experience was in the early 80’s. I had bought myself a Texas instruments 58-c programmable calculator, and I was curious what could be done with such a device. That turned out to be very modest.
The calculator was capable of 480 program steps but held then zero memories for data storage. Each memory used for data consumed 8 program steps, so with the storage of e.g. 10 integers, the programming space was diminished with 80 steps.
The 58-c’s memory was retained even after switching off the calculator, but before creating another program, memory first had to be erased. Continue reading →