A quantum algorithm for approximating the influences of Boolean functions and its applications

DOI10.1007/S11128-015-0954-8zbMath1317.81063arXiv1409.1416OpenAlexW2049869894MaRDI QIDQ2355587

Li Yang, Hong-Wei Li

Publication date: 24 July 2015

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.1416

zbMATH Keywords

quantum algorithmBernstein-Vazirani algorithminfluence of Boolean function

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (18)

Efficient quantum algorithms of finding the roots of a polynomial function ⋮ Creating very true quantum algorithms for quantum energy based computing ⋮ Kochen-Specker theorem as a precondition for quantum computing ⋮ Quantum cryptography based on the Deutsch-Jozsa algorithm ⋮ Distributed Bernstein-Vazirani algorithm ⋮ Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions ⋮ Quantum cryptography, quantum communication, and quantum computer in a noisy environment ⋮ A classical probability space exists for the measurement theory based on the truth values ⋮ A quantum algorithm for testing and learning resiliency of a Boolean function ⋮ Necessary and sufficient condition for quantum computing ⋮ Quantum communication based on an algorithm of determining a matrix ⋮ Quantum algorithms on Walsh transform and Hamming distance for Boolean functions ⋮ Quantum algorithm for determining a complex number string ⋮ New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm ⋮ Some theoretically organized algorithm for quantum computers ⋮ Quantum algorithm for the root-finding problem ⋮ Quantum cryptographic property testing of multi-output Boolean functions ⋮ Solving Bernstein and Vazirani's problem with the 2-bit permutation function

Cites Work

• Unnamed Item
• A structure theorem for Boolean functions with small total influences
• Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
• Quantum algorithms revisited
• Quantum algorithms for testing and learning Boolean functions
• Quantum complexity theory
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: A quantum algorithm for approximating the influences of Boolean functions and its applications