◦ Quantum Computing with Superconductors
2. Computing with Qubits
Very interestingly, it’s possible to much faster solve some problems which is practically troublesome with classical algorithms with using quantum computation.
For example, factorization of large numbers is the best instance to show effectiveness of a quantum algorithm proposed by P.Shor.
Shor showed that exponential steps are needed for factorization of large numbers through classical computers, meanwhile only polynomial steps are required for solving such a problem with quantum computers.
