Sensitivity of symmetric Boolean functions

DOI10.1007/S11128-025-04714-9MaRDI QIDQ6977555zbMATH OpenFDO

Authors Guo-Liang Xu, Mengsi Zhang, Binbin Zhang, Tian-Yin Wang, Yumei Zhang

Publication date 28 May 2025

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

Full work available at URL https://doi.org/10.1007/S11128-025-04714-9

Mathematics Subject Classification ID

Quantum computation (81P68) Boolean functions (94D10)

Cites work

• A New Approach to the Sensitivity Conjecture
• Characterization of exact two-query quantum algorithms
• Complexity measures and decision tree complexity: a survey.
• Exact quantum query complexity of \(\mathrm{EXACT}_{k,l}^n\)
• From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3829252 (Why is no real title available?)
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• On exact quantum query complexity
• On promise problems: a survey
• On the degree of Boolean functions as real polynomials
• On the sensitivity complexity of \(k\)-uniform hypergraph properties
• Parity decision tree in classical-quantum separations for certain classes of Boolean functions
• Quantum query as a state decomposition
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Randomized decision tree complexity of Deutsch-Jozsa problem and a generalization
• Rapid solution of problems by quantum computation
• Revisiting Deutsch-Jozsa algorithm
• The complexity of promise problems with applications to public-key cryptography

This page was built for publication: Sensitivity of symmetric Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977555)