{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2VHC6VTI2XF5THJMJRNZJ6JE54","short_pith_number":"pith:2VHC6VTI","schema_version":"1.0","canonical_sha256":"d54e2f5668d5cbd99d2c4c5b94f924ef1bc2482ebbde14b2d00eec888ac05e64","source":{"kind":"arxiv","id":"2509.07276","version":1},"attestation_state":"computed","paper":{"title":"Quantum Advantage via Solving Multivariate Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Aayush Jain, Amit Sahai, Itai Dinur, Paul Lou, Pierre Briaud, Riddhi Ghosal","submitted_at":"2025-09-08T23:19:20Z","abstract_excerpt":"In this work, we propose a new way to (non-interactively, verifiably) demonstrate quantum advantage by solving the average-case $\\mathsf{NP}$ search problem of finding a solution to a system of (underdetermined) constant degree multivariate equations over the finite field $\\mathbb{F}_2$ drawn from a specified distribution. In particular, for any $d \\geq 2$, we design a distribution of degree up to $d$ polynomials $\\{p_i(x_1,\\ldots,x_n)\\}_{i\\in [m]}$ for $m<n$ over $\\mathbb{F}_2$ for which we show that there is a expected polynomial-time quantum algorithm that provably simultaneously solves $\\{"},"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":"2509.07276","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-08T23:19:20Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"118fae955418039a26581994a46f7284ab8b14b85e35769f6cf852a94c13604a","abstract_canon_sha256":"ff60254d815a35f2cd0c2408e26872b48263ceb27cad30104151b380c2254c99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:18.809779Z","signature_b64":"1jzYX84YxBX42xqp/+yeBeVbQVqSebkGrqTv1IsRvoBxyTApMVy3ro1T1JIARW7k8ld5TD5gVyWVuXAwRBKgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d54e2f5668d5cbd99d2c4c5b94f924ef1bc2482ebbde14b2d00eec888ac05e64","last_reissued_at":"2026-07-05T12:07:18.809269Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:18.809269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Advantage via Solving Multivariate Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Aayush Jain, Amit Sahai, Itai Dinur, Paul Lou, Pierre Briaud, Riddhi Ghosal","submitted_at":"2025-09-08T23:19:20Z","abstract_excerpt":"In this work, we propose a new way to (non-interactively, verifiably) demonstrate quantum advantage by solving the average-case $\\mathsf{NP}$ search problem of finding a solution to a system of (underdetermined) constant degree multivariate equations over the finite field $\\mathbb{F}_2$ drawn from a specified distribution. In particular, for any $d \\geq 2$, we design a distribution of degree up to $d$ polynomials $\\{p_i(x_1,\\ldots,x_n)\\}_{i\\in [m]}$ for $m<n$ over $\\mathbb{F}_2$ for which we show that there is a expected polynomial-time quantum algorithm that provably simultaneously solves $\\{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07276","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.07276/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2509.07276","created_at":"2026-07-05T12:07:18.809337+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.07276v1","created_at":"2026-07-05T12:07:18.809337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07276","created_at":"2026-07-05T12:07:18.809337+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VHC6VTI2XF5","created_at":"2026-07-05T12:07:18.809337+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VHC6VTI2XF5THJM","created_at":"2026-07-05T12:07:18.809337+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VHC6VTI","created_at":"2026-07-05T12:07:18.809337+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13570","citing_title":"Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00312","citing_title":"Quantum Decoding Algorithms: Quantum Speedups in Optimization","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VHC6VTI2XF5THJMJRNZJ6JE54","json":"https://pith.science/pith/2VHC6VTI2XF5THJMJRNZJ6JE54.json","graph_json":"https://pith.science/api/pith-number/2VHC6VTI2XF5THJMJRNZJ6JE54/graph.json","events_json":"https://pith.science/api/pith-number/2VHC6VTI2XF5THJMJRNZJ6JE54/events.json","paper":"https://pith.science/paper/2VHC6VTI"},"agent_actions":{"view_html":"https://pith.science/pith/2VHC6VTI2XF5THJMJRNZJ6JE54","download_json":"https://pith.science/pith/2VHC6VTI2XF5THJMJRNZJ6JE54.json","view_paper":"https://pith.science/paper/2VHC6VTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.07276&json=true","fetch_graph":"https://pith.science/api/pith-number/2VHC6VTI2XF5THJMJRNZJ6JE54/graph.json","fetch_events":"https://pith.science/api/pith-number/2VHC6VTI2XF5THJMJRNZJ6JE54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VHC6VTI2XF5THJMJRNZJ6JE54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VHC6VTI2XF5THJMJRNZJ6JE54/action/storage_attestation","attest_author":"https://pith.science/pith/2VHC6VTI2XF5THJMJRNZJ6JE54/action/author_attestation","sign_citation":"https://pith.science/pith/2VHC6VTI2XF5THJMJRNZJ6JE54/action/citation_signature","submit_replication":"https://pith.science/pith/2VHC6VTI2XF5THJMJRNZJ6JE54/action/replication_record"}},"created_at":"2026-07-05T12:07:18.809337+00:00","updated_at":"2026-07-05T12:07:18.809337+00:00"}