Investigating the linear structure of Boolean functions based on Simon's period-finding quantum algorithm
This addresses a computational bottleneck in cryptography and complexity theory, offering a quantum advantage for a specific task.
The authors tackled the problem of efficiently determining the linear structure of Boolean functions, which lacks efficient classical solutions, by proposing a quantum algorithm based on Simon's period-finding algorithm, achieving an efficient quantum solution.
It is believed that there is no efficient classical algorithm to determine the linear structure of Boolean function. We investigate an extension of Simon's period-finding quantum algorithm, and propose an efficient quantum algorithm to determine the linear structure of Boolean function.