Open positions: Quantum computing hardware startup engineering team

Yes. There are plenty of algorithms that run fine on conventional computing and don't have any fast quantum algorithms for breaking them, even in theory.

But there is also the practice - a standard, well-known RSA algorithm is completely unbreakable (with any current algorithms) if the bit size is big enough. A 2048-bit code is going to be unbreakable with any conventional computer in practice (765 bits is the current record, I believe). Breaking 2048-bit code with a quantum computer would take a

20-million q-bit computer, running continuously for 8 hours (in theory). Current models can run about a dozen q-bits for a few milliseconds.

And no matter how big and powerful conventional or quantum computers get, any calculations always have a minimum energy required. Moving to

4096-bit RSA is peanuts - but cracking it would probably take all the energy from the sun's lifetime, no matter what type of computer is used.

Smarter algorithms for factoring big numbers are a risk for current popular encryption algorithms, and could change things dramatically. Quantum computers are not a risk.

They choose their problem well: Generating 'certified' random sequences. Unverifiable.

Jeroen Belleman

Jeroen, Do you think entanglement is real? Bell's inequality. The entangled 2 photon system is the cleanest I know of.

It's the next gen two slit interference exp. Available in (college/uni) adv. labs all over. (If 1 photon interference didn't f with your mind... try 2. :^)

George H.

Entanglement, certainly. Spooky action at a distance, no.

Jeroen Belleman