Related papers: Sensitivity, Affine Transforms and Quantum Communi…
An XOR function is a function of the form g(x,y) = f(x + y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise…
In this paper we shed new light on the AdS/CFT duality by interpreting the CFT as the Fourier space of AdS. We make use of well known integral geometry techniques to derive the Fourier transformation of a function defined on the AdS…
The orientation of the order parameter of quantum magnets can be used to store information in a dense and efficient way. Switching this order parameter corresponds to writing data. To understand how this can be done, we study a precessional…
Microwave and submillimeter molecular transition frequencies between nearly degenerated rotational levels, tunneling transitions, and mixed tunneling-rotational transitions show an extremely high sensitivity to the values of the…
Motivated by the multivariate wavelet theory, and by the spectral theory of transfer operators, we construct an abstract affine structure and a multiresolution associated to a matrix-valued weight. We describe the one-to-one correspondence…
Recent investigations have found that the strongly constrained and appropriately normed (SCAN) meta-GGA exchange-correlation functional significantly over-magnetizes elemental Fe, Co, and Ni solids. For the paradigmatic case, bcc Fe, the…
The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…
We establish novel connections between magic in quantum circuits and communication complexity. In particular, we show that functions computable with low magic have low communication cost. Our first result shows that the $\mathsf{D}\|$…
For any standard Borel space $B$, let $\mathcal{P}(B)$ denote the space of Borel probability measures on $B$. In relation to a difficult problem of Aldous in exchangeability theory, and in connection with arithmetic combinatorics, Austin…
Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial…
We provide new query complexity separations against sensitivity for total Boolean functions: a power $3$ separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power $2.22$ separation…
In this paper, we provide a solution to the open problem of computing the Fourier transform of a binary function defined over $n$-bit vectors taking $m$-bit vector values. In particular, we introduce the two-modular Fourier transform (TMFT)…
The Fractional Fourier Transform is a ubiquitous signal processing tool in basic and applied sciences. The Fractional Fourier Transform generalizes every property and application of the Fourier Transform. Despite the practical importance of…
This paper proposes an anti-interference affine frequency division multiplexing (AFDM) system to ensure reliability and resource efficiency under malicious high-power interference originating from adversarial devices in high-mobility…
Transformer models rely on High-Performance Computing (HPC) resources for inference, where soft errors are inevitable in large-scale systems, making the reliability of the model particularly critical. Existing fault tolerance frameworks for…
Atoms and molecules can serve as sensitive probes of a possible variation of the fine structure constant $\alpha$ and electron-to-proton mass ratio $\mu$. Two types of sensitivity coefficients are often used to quantify and compare the…
We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the…
We propose a new waveform suitable for integrated sensing and communications (ISAC) systems facing doubly-dispersive (DD) channel conditions, as typically encountered in high mobility scenarios. Dubbed Affine Filter Bank Modulation (AFBM),…
Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem for over 40 years. An early result by Morgenstern from 1973, provides an $\Omega(n…
Characterizing the express power of the Transformer architecture is critical to understanding its capacity limits and scaling law. Recent works provide the circuit complexity bounds to Transformer-like architecture. On the other hand,…