Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication Related

Topics

Entanglement Theory Quantum Correlations Quantum State Preparation Representation Open Quantum Systems Decoherence Quantum Simulation

On the Approximate Non-Deterministic Degree of Total Boolean Functions

arXiv

Authors: Samruddhi Pednekar, Supartha Podder

Year

2026

Paper ID

68426

Status

Preprint

Abstract Read

~2 min

Abstract Words

239

Citations

Abstract

The approximate non-deterministic degree of a Boolean function f, denoted mathsf{ndeg}_ε(f) written $mathsf{N}_ε(ffor brevity), is the minimum degree of a real polynomialpsuch that0 \le |p(x)| \le εwheneverf(x) = 0, and|p(x)| \ge 1wheneverf(x) = 1. Unlike exact non-deterministic degree, which only requires the polynomial to be nonzero on1-inputs, this measure enforces a uniform gap: the polynomial must stay close to zero on all0-inputs and bounded away from zero on all1-inputs. The rational degree conjecture, open for over three decades, was recently resolved by Kothari, Kovacs-Deak, Wang, and Yang, who showed that for every total Boolean functionf, \[ deg(f) le widetilde Oleft$operatorname{rdeg}(f$^3right). \] In their paper, they explicitly propose a stronger conjecture: that approximate degree is polynomially bounded by\mathsf{N}_ε(f)and\mathsf{N}_εoverline{f}jointly, i.e., for every total Boolean functionfand every constant0<ε<1$, \[ \widetilde{deg}(f) \le \operatorname{poly}mathsf N_ε(f, \mathsf N_εoverline f). \] This conjecture, if true, would imply a polynomial version of the rational degree result and bring us closer to resolving de Wolf's longstanding non-deterministic degree conjecture. In this work, we make the first systematic progress on this problem, establishing the conjecture for several broad and natural function classes: monotone and unate functions, functions of bounded alternation number, symmetric functions, k-uniform hypergraph properties, and read-k Disjunctive Normal Form (DNF) formulas.

Why This Paper Matters

This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
It adds a 2026 reference point for readers tracking recent quantum research.
The approximate non-deterministic degree of a Boolean function f, denoted mathsfndeg_ε(f) written mathsfN_ε(ffor brevity), is the minimum degree of a real polynomialpsuch that0...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:2605.23336 [2] arXiv https://arxiv.org/abs/2605.23336 [3] Publisher https://arxiv.org/abs/2605.23336

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal • updated 2026-06-07 05:23:58

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.