Apart from sampling problems, other applications have been proposed for demonstrating quantum supremacy, such as Shor’s algorithm for factoring integers which are extremely important in encryption.
Apart from sampling problems, other applications have been proposed for demonstrating quantum supremacy, such as Shor’s algorithm for factoring integers which are extremely important in encryption. However, implementing Shor’s algorithm for large numbers is not feasible with existing technology and is hence not the preferred oversampling algorithm for demonstrating supremacy.