Modern encryption methods, such as RSA, are based on the fact that even the most powerful classical computers are not able to quickly decompose a large number into prime factors. However, quantum computers promise to considerably accelerate this process, thanks to an algorithm proposed by Peter Shor in 1994, which demonstrated that a quantum computer could break RSA encryption. Over the last 30 years, scientists have been actively developing quantum computers, but up until now they have not been able to create a powerful enough device to execute Shor’s algorithm. It requires a quantum computer with about 20 million qubits, while modern