Pith Number

pith:FJJJXFHG

pith:2026:FJJJXFHGI5QCRRONX3PKUVRQSF

not attested not anchored not stored refs pending

Quantum-Accelerated Gowers $U_2$ Norm for Bent Boolean Functions

C. A. Jothiwashran, Rajdeep Dwivedi, Sugata Gangopadhyay, Vishvendra Singh Poonia

Quantum circuit evaluates Gowers U2 norm using 3n qubits and O(n^2) gates for bent function search

arxiv:2604.25503 v3 · 2026-04-28 · quant-ph

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{FJJJXFHGI5QCRRONX3PKUVRQSF}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

the quantum evaluation circuit requires only 3n qubits and O(n^2) two-qubit gates per function query, whereas the classical computation of the exact Gowers U2 norm demands O(2^{2n}) arithmetic operations an exponential overhead that renders it infeasible for n ≳ 25

C2weakest assumption

The quantum circuit correctly evaluates the Gowers U2 norm up to sampling noise that does not derail the genetic algorithm's ability to reach the bent threshold, and that fault-tolerant hardware will be available to run the circuit at the claimed gate counts.

C3one line summary

A quantum circuit computes the Gowers U2 norm using 3n qubits and O(n^2) gates to accelerate genetic search for bent Boolean functions, providing exponential advantage over classical O(2^{2n}) evaluation for n greater than 25.

Receipt and verification

First computed	2026-05-26T01:03:31.289818Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

2a529b94e6476028c5cdbedeaa563091542c36c35a98b014b682538938ec0d6c

Aliases

arxiv: 2604.25503 · arxiv_version: 2604.25503v3 · doi: 10.48550/arxiv.2604.25503 · pith_short_12: FJJJXFHGI5QC · pith_short_16: FJJJXFHGI5QCRRON · pith_short_8: FJJJXFHG

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 2a529b94e6476028c5cdbedeaa563091542c36c35a98b014b682538938ec0d6c

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "e879f7e2361ca499a4b134519241fa83eb0505bd042bc62c88ab3001aa1422ba",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2026-04-28T11:05:20Z",
    "title_canon_sha256": "b2de9d37f35851793a5851da15708e06a46099643f9ea54a4669acd6b8a07822"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2604.25503",
    "kind": "arxiv",
    "version": 3
  }
}