Pages that link to "Item:Q669952"

The following pages link to A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952):

Displaying 11 items.

• Application of Grover's algorithm to check non-resiliency of a Boolean function (Q276563) (← links)
• Efficient quantum algorithm for the parity problem of a certain function (Q1740738) (← links)
• Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems (Q2121215) (← links)
• Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions (Q2681633) (← links)
• From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
• An exact quantum algorithm for testing 3-junta in Boolean functions with one uncomplemented product (Q2684236) (← links)
• Quantum private comparison of size using \(d\)-level Bell states with a semi-honest third party (Q2690313) (← links)
• Multi-party quantum summation without a third party based on \(d\)-dimensional Bell states (Q2690477) (← links)
• Parity decision tree in classical-quantum separations for certain classes of Boolean functions (Q2690505) (← links)
• (Q5417637) (← links)
• SOFSEM 2005: Theory and Practice of Computer Science (Q5711559) (← links)