Geometric influences on quantum Boolean cubes

DOI10.1016/J.JFA.2025.111132MaRDI QIDQ6936120zbMATH OpenFDO

Authors David P. Blecher, Li Gao, Bang Xu

Publication date 2 September 2025

Published in Journal of Functional Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JFA.2025.111132

zbMATH Keywords

geometric influencesBoolean cubesnoise operators

Mathematics Subject Classification ID

Norms (inequalities, more than one norm, etc.) of linear operators (47A30) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
• A quantitative Arrow theorem
• Analysis of Boolean Functions
• Boolean functions for cryptography and coding theory
• Boolean functions whose Fourier transform is concentrated on the first two levels.
• Constant depth circuits, Fourier transform, and learnability
• Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
• How much are increasing sets positively correlated?
• Hypercontractive measures, Talagrand's inequality, and influences
• Hypercontractivity in noncommutative L₁ spaces
• Johnson-Schechtman inequalities in the free probability theory
• KKL theorem for the influence of a set of variables
• Learning Monotone Decision Trees in Polynomial Time
• Multiplicativity of completely bounded p-norms implies a new additivity result
• Noise sensitivity of Boolean functions and applications to percolation
• Noncommutative Bohnenblust--Hille inequalities
• On Russo's approximate zero-one law
• On boundaries and influences
• On the Fourier tails of bounded functions over the discrete cube
• On the distribution of the Fourier spectrum of Boolean functions
• On the hardness of approximating Multicut and Sparsest-Cut
• On the hardness of approximating minimum vertex cover
• Quantitative relation between noise sensitivity and influences
• Quantum Boolean functions
• Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions
• Quantum logarithmic Sobolev inequalities and rapid mixing
• Some optimal inapproximability results
• Talagrand inequality at second order and application to Boolean analysis
• The PCP theorem by gap amplification
• Towards a proof of the Fourier-entropy conjecture?

This page was built for publication: Geometric influences on quantum Boolean cubes

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