The new quantum computers can beat supercomputers.

"A quantum computer has been used to generate and certify truly random numbers, something classical computers can’t do, paving the way for unhackable encryption. Credit: SciTechDaily.com (ScitechDaily, A 56-Qubit Quantum Computer Just Did What No Supercomputer Can)

Researchers have achieved a major quantum computing breakthrough: certified randomness, a process where a quantum computer generates truly random numbers, which are then proven to be genuinely random by classical supercomputers." (ScitechDaily, A 56-Qubit Quantum Computer Just Did What No Supercomputer Can)

The problem with classical computer-based encryption is that those systems cannot make real random numbers. Classical computers handle numbers as lines. The system generates a series of numbers using some algorithm, like the Riemann zeta function. 

The problem is that if the attacker knows the speed of a computer and the function that it uses it can even guess the number. There is the possibility to make the jumping algorithms, calculations that jump the point where the system picks the number back and forth. Quantum computers can create real random numbers. Or they can calculate those numeric lines in ways that the system can handle multiple points in the numeric lines at the same time. 

The ability to use complex numbers makes the system more flexible than regular binary numbers. When a system uses complex numbers for encryption those number's imaginal sequences make them hard for binary computers. Binary computers can make morphing neural networks. Where each computer or computer group handles its own imaginal sequences. A complex number is a number that can have multiple values at the same time. And that makes it hard for binary systems. 

The system must input those values at the same time to the keyhole that makes it unbreakable. The binary system cannot input multiple numeric values at the same moment. The quantum computer can send a qubit into the receiver and that thing allows it to transfer multiple numeric values into the receiver in the same moment.  

The fact is that quantum computers beat supercomputers only in the most complicated calculations. We can see the quantum computer's power in the most complicated hybrid models. The system must follow billions of objects and then compile their trajectories or other behaviors with calculations. One place where the quantum computer can be the best in business is quantum system development. Theoretically, qubit calculation is quite an easy thing. The qubit looks a little bit atom where hills are one and valleys are zeros. 

The system must use so-called complex numbers to calculate those energy valleys and hills in the 3D structure. Those complex numbers can have many imaginal sequences. Qubit with 56 states requires a minimum of 56 imaginal sequences. The system must also calculate the angles of those energy valleys and hills. And the system must drive data to the qubit in the form. That the computer can handle it.  That requires lots of accuracy. 

So, quantum computers are very powerful tools but there is a point of complexity where the quantum computer beats the binary computer. The quantum computer must adjust the qubit and then drive information into it. That takes a little bit of time. And this is the reason that the binary computer is the best tool for simple calculations. In quite simple hacking the morphing neural network can also make the code breaking very effective. 

The algorithm that encrypts data should be more complicated than just an ASCII mark that is multiplicated using a prime number. The morphing neural network can begin the prime number series at multiple points. The system that can calculate those prime numbers can destroy the data security that is based on too simple models. 

Quantum computers can involve a new layer to the morphing neural networks. The quantum computer requires massive support systems that can control its qubits. 

https://scitechdaily.com/a-56-qubit-quantum-computer-just-did-what-no-supercomputer-can/

https://en.wikipedia.org/wiki/Complex_number

https://en.wikipedia.org/wiki/Riemann_zeta_function