For a uniform random Boolean function on p bits, its low-degree Fourier coefficients uniquely determine it with high probability precisely when d exceeds p/2 by an O(sqrt(p log p)) window.
hub
Probability Inequalities for Sums of Bounded Ra n- dom Variables
25 Pith papers cite this work. Polarity classification is still indexing.
25
Pith papers citing it
hub tools
citation-role summary
background 2
method 2
citation-polarity summary
representative citing papers
Proves density-one lower bound g_k(n) ≥ (3(k-1)/log 12 - ε) log n for almost all n and pointwise upper bound g_k(n) ≤ (k-1)log2 n + log2 log n + O_k(1).
Adaptive feed-forward circuits outperform non-adaptive parallel schemes in mitigating error from noisy two-outcome qubit measurements, with advantage appearing at three uses and growing unbounded with more uses.
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
S2-WEF detects dynamic free-riders in federated learning by simulating attack WEF patterns from prior global models, combining them with mutual deviation scores, and using two-dimensional clustering without proxy data or pre-training.
STE is a differentiable method to compute continuous analogues of the Top Cycle and Uncovered Set from pairwise comparison data for stable set-valued evaluation of cyclic agent interactions.
Finite-size security proof for discrete-modulated CV-QKD under general attacks using dimension reduction and entropy accumulation yields positive rates at block sizes of order 10^8.
Introduces approximation-preserving coresets that guarantee cost preservation for near-optimal solutions and proves that even tiny approximation-factor distortion forbids coresets of that size.
Coupling-Grouped XY-QAOA enables joint anomaly-feature selection via a constraint-preserving grouped-angle QAOA variant, achieving 45.9-61.3% circuit depth reduction and larger feasible executions (64 qubits at p=2) on IBM Heron hardware compared to standard approaches.
Ablation experiment in Shplait finds that detailed type error messages improve AI agents' type-error repair rates over minimal messages or dynamic errors, with type systems adding further benefit.
QML-PipeGuard is a framework for runtime behavioral fingerprinting of QML pipelines that absorbs benign drift while detecting adversarial channel substitution via informationally complete measurements.
SVAR-FM uses simulator clamping to produce interventional distributions and flow matching to identify time series causal structures, with an error bound that predicts sign reversal of causal effects below a simulator accuracy threshold.
QESEM is a characterization-based error mitigation technique that achieves unbiased estimates with substantially reduced runtime cost compared to probabilistic error cancellation while outperforming zero-noise extrapolation on utility-scale circuits.
Two strategies are introduced for transmission over unknown binary erasure channels: a two-phase method achieving O(T^{2/3}) regret with one query and a windowing method achieving O(sqrt(T)) regret with O(log T) queries.
Proves PAC consistency and explicit convergence rates for learned transport integrated (LtI) quadrature using neural ODE flows for general targets and empirical quantile maps for product targets.
The authors give an Õ(n + √(wt))-time algorithm for Subset Sum.
Unifying framework for CTree, MOB and GUIDE shows model scores without dichotomization yield higher power for covariate selection than residuals or dichotomized scores in many scenarios.
The Stakeholder Grounding Exercise shows neural text embeddings are 19-26pp less reliable than human experts at capturing semantic distinctions, with misalignment strongly correlated to poorer clustering performance (ρ=0.9), replicated across Danish policy and US AI domains.
Arqon delivers reliable quantum network service via admission control and scheduling that satisfies defined reliability requirements for accepted demands in static topologies, with O(k^3) and O(N^3) complexity.
A framework applies frequent itemset mining with the negFIN algorithm and unsupervised learning to identify cities sharing co-occurring land use patterns from Copernicus Urban Atlas data.
A model-free method builds confidence sets for latent parameters to proxy sim-to-real discrepancies and estimates the quantile function of that proxy to produce a distribution-level fidelity profile for simulators.
The paper introduces a modular, hardware-agnostic architecture using entanglement packets for scheduling network operations in quantum networks to enable end-to-end entanglement generation integrated with local program execution, demonstrated via simulation on a 6-node star topology.
For two orthogonal black-box n-qubit states, a poly(n, 1/ε)-size approximating unitary exists that maps basis states to them while resetting all auxiliaries on every input.
NPAP is a Python package built on NetworkX that supplies 13 partitioning strategies and two aggregation profiles for network graph reduction via a strategy pattern allowing custom extensions.
citing papers explorer
-
Soft Tournament Equilibrium
STE is a differentiable method to compute continuous analogues of the Top Cycle and Uncovered Set from pairwise comparison data for stable set-valued evaluation of cyclic agent interactions.
-
Arqon: A suite of control applications enabling a reliable quantum network
Arqon delivers reliable quantum network service via admission control and scheduling that satisfies defined reliability requirements for accepted demands in static topologies, with O(k^3) and O(N^3) complexity.