query-complexity

A toolkit for teaching, learning, and doing research in Boolean function analysis. Fourier analysis, property testing, query complexity, hypercontractivity, pseudorandomness, and more

Framework for empirically exploring query complexity questions

The project applied database principles to a real-world mental health problem, emphasizing reliable data management, and showcased practical solutions to mental health challenges.

GraphQL security gateway for query analysis, complexity controls, and policy enforcement.

Matching high-precision bounds for online quantum expectation estimation with coherent state-preparation access, showing how batch deadlines govern source-query cost despite unrestricted retained memory.

Matching forward–inverse quantum query bounds for known-state transition testing, with Dicke probes, a Poisson–Müntz converse, and a 30-milestone learning route.

Determine in one query whether a 3-bit Boolean function is constant or balanced (oracle: f = x₀ ⊕ x₁ ⊕ x₂).

Tight quantum-query bounds for coherent Markov powering: cheap one-step access can hide costly clean powers, while conditional bridges enable compilation.

Proof artifacts and reproduction code for exact adaptivity thresholds in priced equality queries under complete equivalence promises.

Sharp quantum query thresholds for autonomous reflection dephasing: constant, square-root, and linear simulation costs for one, two, and three noise primitives.

Quantum memory thresholds for learning Pauli correlations of bounded weight and detecting preserved correlations, with proofs, reproducible checks, and a Watrous learning route.

GraphQL operation guard for a supplied AST: fragment-aware depth limit with cycle guard, per-field complexity scoring, operation allowlist/denylist, and introspection blocking. graphql-js is optional — accepts its document shape structurally, zero hard dependencies.

Query bounds for unitary-jump dynamics: square-root cost for coherent field simulation at fixed error, and linear cost forced by an observer emitting one photon on average.

Exact computational verification for memory under unknown future access

Optimal quantum and classical search laws for hidden Markov oracle omissions, separating query complexity from elapsed oracle time.

Exact rational certificates settling nine open cases of the Ambainis-Iraids-Nagaj EXACT_{k,l}^n conjecture (exact quantum query complexity)

Analyze and limit the cost of GraphQL queries using configurable field costs

Pure Relative Structured Matrix Approximation with Square-Root Matvecs DOI: https://doi.org/10.5281/zenodo.21698599