{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FJJJXFHGI5QCRRONX3PKUVRQSF","short_pith_number":"pith:FJJJXFHG","schema_version":"1.0","canonical_sha256":"2a529b94e6476028c5cdbedeaa563091542c36c35a98b014b682538938ec0d6c","source":{"kind":"arxiv","id":"2604.25503","version":3},"attestation_state":"computed","paper":{"title":"Quantum-Accelerated Gowers $U_2$ Norm for Bent Boolean Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Quantum circuit evaluates Gowers U2 norm using 3n qubits and O(n^2) gates for bent function search","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. A. Jothiwashran, Rajdeep Dwivedi, Sugata Gangopadhyay, Vishvendra Singh Poonia","submitted_at":"2026-04-28T11:05:20Z","abstract_excerpt":"Bent Boolean functions extremal objects that maximally resist affine approximation are notoriously hard to construct for large numbers of variables. We propose a hybrid quantum-classical genetic algorithm (GA) that uses a quantum circuit to evaluate the Gowers $U_2$ norm as the evolutionary fitness function. Our central contribution is a complexity-theoretic separation: the quantum evaluation circuit requires only $3n$ qubits and $\\bigO(n^2)$ two-qubit gates per function query, whereas the classical computation of the exact Gowers $U_2$ norm demands $\\bigO(2^{2n})$ arithmetic operations an exp"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2604.25503","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-28T11:05:20Z","cross_cats_sorted":[],"title_canon_sha256":"b2de9d37f35851793a5851da15708e06a46099643f9ea54a4669acd6b8a07822","abstract_canon_sha256":"e879f7e2361ca499a4b134519241fa83eb0505bd042bc62c88ab3001aa1422ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:31.290631Z","signature_b64":"D58+rNtsq4s9Xo0uwzeNent3ZYqL4DIExCObw2DO7UNeNwt+1Fphl4D8x10JpdHTxRXMGsS4xdcyZmIJPTAQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a529b94e6476028c5cdbedeaa563091542c36c35a98b014b682538938ec0d6c","last_reissued_at":"2026-05-26T01:03:31.289818Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:31.289818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Accelerated Gowers $U_2$ Norm for Bent Boolean Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Quantum circuit evaluates Gowers U2 norm using 3n qubits and O(n^2) gates for bent function search","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. A. Jothiwashran, Rajdeep Dwivedi, Sugata Gangopadhyay, Vishvendra Singh Poonia","submitted_at":"2026-04-28T11:05:20Z","abstract_excerpt":"Bent Boolean functions extremal objects that maximally resist affine approximation are notoriously hard to construct for large numbers of variables. We propose a hybrid quantum-classical genetic algorithm (GA) that uses a quantum circuit to evaluate the Gowers $U_2$ norm as the evolutionary fitness function. Our central contribution is a complexity-theoretic separation: the quantum evaluation circuit requires only $3n$ qubits and $\\bigO(n^2)$ two-qubit gates per function query, whereas the classical computation of the exact Gowers $U_2$ norm demands $\\bigO(2^{2n})$ arithmetic operations an exp"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"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","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Quantum circuit evaluates Gowers U2 norm using 3n qubits and O(n^2) gates for bent function search","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"def9ea45b0c068416dae9bc6fa414adc625076b63bb0ec33cb69dd6347a527c5"},"source":{"id":"2604.25503","kind":"arxiv","version":3},"verdict":{"id":"d8eff787-086f-4eea-a29b-0555716f3893","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T16:36:16.613412Z","strongest_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","one_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.","pipeline_version":"pith-pipeline@v0.9.0","weakest_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.","pith_extraction_headline":"Quantum circuit evaluates Gowers U2 norm using 3n qubits and O(n^2) gates for bent function search"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.25503/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T04:39:26.599052Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:06:04.269779Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d5564a49047929ab834dd326a5070d48ed68e554d773c89534cbf0cc2fa9c504"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2604.25503","created_at":"2026-05-26T01:03:31.289968+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.25503v3","created_at":"2026-05-26T01:03:31.289968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.25503","created_at":"2026-05-26T01:03:31.289968+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJJJXFHGI5QC","created_at":"2026-05-26T01:03:31.289968+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJJJXFHGI5QCRRON","created_at":"2026-05-26T01:03:31.289968+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJJJXFHG","created_at":"2026-05-26T01:03:31.289968+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF","json":"https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF.json","graph_json":"https://pith.science/api/pith-number/FJJJXFHGI5QCRRONX3PKUVRQSF/graph.json","events_json":"https://pith.science/api/pith-number/FJJJXFHGI5QCRRONX3PKUVRQSF/events.json","paper":"https://pith.science/paper/FJJJXFHG"},"agent_actions":{"view_html":"https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF","download_json":"https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF.json","view_paper":"https://pith.science/paper/FJJJXFHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.25503&json=true","fetch_graph":"https://pith.science/api/pith-number/FJJJXFHGI5QCRRONX3PKUVRQSF/graph.json","fetch_events":"https://pith.science/api/pith-number/FJJJXFHGI5QCRRONX3PKUVRQSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF/action/storage_attestation","attest_author":"https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF/action/author_attestation","sign_citation":"https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF/action/citation_signature","submit_replication":"https://pith.science/pith/FJJJXFHGI5QCRRONX3PKUVRQSF/action/replication_record"}},"created_at":"2026-05-26T01:03:31.289968+00:00","updated_at":"2026-05-26T01:03:31.289968+00:00"}