For the first time in the world, NTT devised a new quantum algorithm that demonstrates the verifiable superiority (quantum superiority) of quantum computers for problems using functions whose output does not have a “structure” such as periodicity. This is the first proposal of a verifiable quantum superiority algorithm based on an essentially new idea in about 30 years since Shor’s prime factorization algorithm (1994). This achievement is expected to promote research into algorithms for problems that have been considered difficult to find practical quantum algorithms, and to expand the scope of application of future quantum computers.