QUANT-PHCRJun 9, 2013

Investigating the linear structure of Boolean functions based on Simon's period-finding quantum algorithm

arXiv:1306.2008v21 citations
AI Analysis

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes