{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J55YXGMXREWSLMYAWW7KY7VIRC","short_pith_number":"pith:J55YXGMX","schema_version":"1.0","canonical_sha256":"4f7b8b9997892d25b300b5beac7ea888bf4ead859aae0cb75edc405c12c8c97c","source":{"kind":"arxiv","id":"2402.02585","version":1},"attestation_state":"computed","paper":{"title":"Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Anastasios Kyrillidis, Bhuvanesh Sundar, David Quiroga, Guido Pagano, Kaden R. A. Hazzard, Leonardo Duenas-Osorio, Roger Paredes, Zewen Zhang","submitted_at":"2024-02-04T19:01:27Z","abstract_excerpt":"The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT problems (All-SAT). G-QAOA is less resource-intensive and more adaptable for 3-SAT and Max-SAT than Grover's algorithm, and it surpasses conventional QAOA in it"},"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":"2402.02585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-04T19:01:27Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"2c1bf39e84a168aae1e1d3ed1564d3af383804ae779cee72e66fac6beac3991a","abstract_canon_sha256":"b2cbe22da0946e3206f1c7c305966c5827de234f716f9179e9b02fdbccc4519c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:37.762814Z","signature_b64":"rwxpA8m2DozWXjiiUOUCLjdkBri3JwAkf23f/T4TdOWso/Ic9Zig9TTpKOWH13JfkX0edvBwlNJxVag+JyQGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f7b8b9997892d25b300b5beac7ea888bf4ead859aae0cb75edc405c12c8c97c","last_reissued_at":"2026-07-05T10:04:37.762323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:37.762323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Anastasios Kyrillidis, Bhuvanesh Sundar, David Quiroga, Guido Pagano, Kaden R. A. Hazzard, Leonardo Duenas-Osorio, Roger Paredes, Zewen Zhang","submitted_at":"2024-02-04T19:01:27Z","abstract_excerpt":"The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT problems (All-SAT). G-QAOA is less resource-intensive and more adaptable for 3-SAT and Max-SAT than Grover's algorithm, and it surpasses conventional QAOA in it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02585","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/2402.02585/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":"2402.02585","created_at":"2026-07-05T10:04:37.762383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.02585v1","created_at":"2026-07-05T10:04:37.762383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02585","created_at":"2026-07-05T10:04:37.762383+00:00"},{"alias_kind":"pith_short_12","alias_value":"J55YXGMXREWS","created_at":"2026-07-05T10:04:37.762383+00:00"},{"alias_kind":"pith_short_16","alias_value":"J55YXGMXREWSLMYA","created_at":"2026-07-05T10:04:37.762383+00:00"},{"alias_kind":"pith_short_8","alias_value":"J55YXGMX","created_at":"2026-07-05T10:04:37.762383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17575","citing_title":"Warehouse optimization using a trapped-ion quantum processor","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J55YXGMXREWSLMYAWW7KY7VIRC","json":"https://pith.science/pith/J55YXGMXREWSLMYAWW7KY7VIRC.json","graph_json":"https://pith.science/api/pith-number/J55YXGMXREWSLMYAWW7KY7VIRC/graph.json","events_json":"https://pith.science/api/pith-number/J55YXGMXREWSLMYAWW7KY7VIRC/events.json","paper":"https://pith.science/paper/J55YXGMX"},"agent_actions":{"view_html":"https://pith.science/pith/J55YXGMXREWSLMYAWW7KY7VIRC","download_json":"https://pith.science/pith/J55YXGMXREWSLMYAWW7KY7VIRC.json","view_paper":"https://pith.science/paper/J55YXGMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.02585&json=true","fetch_graph":"https://pith.science/api/pith-number/J55YXGMXREWSLMYAWW7KY7VIRC/graph.json","fetch_events":"https://pith.science/api/pith-number/J55YXGMXREWSLMYAWW7KY7VIRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J55YXGMXREWSLMYAWW7KY7VIRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J55YXGMXREWSLMYAWW7KY7VIRC/action/storage_attestation","attest_author":"https://pith.science/pith/J55YXGMXREWSLMYAWW7KY7VIRC/action/author_attestation","sign_citation":"https://pith.science/pith/J55YXGMXREWSLMYAWW7KY7VIRC/action/citation_signature","submit_replication":"https://pith.science/pith/J55YXGMXREWSLMYAWW7KY7VIRC/action/replication_record"}},"created_at":"2026-07-05T10:04:37.762383+00:00","updated_at":"2026-07-05T10:04:37.762383+00:00"}