{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6O7W2CUZTASP3NWTQJ5FATJWHL","short_pith_number":"pith:6O7W2CUZ","schema_version":"1.0","canonical_sha256":"f3bf6d0a999824fdb6d3827a504d363ad5e2413b1cb6d1eba17bf10c40ac87d2","source":{"kind":"arxiv","id":"2306.13123","version":2},"attestation_state":"computed","paper":{"title":"Quantum speedup for combinatorial optimization with flat energy landscapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Hannes Pichler, Jin-Guo Liu, Madelyn Cain, Mikhail D. Lukin, Rhine Samajdar, Sambuddha Chattopadhyay","submitted_at":"2023-06-22T18:00:00Z","abstract_excerpt":"Designing quantum algorithms with a speedup over their classical analogs is a central challenge in quantum information science. Motivated by recent experimental observations of a superlinear quantum speedup in solving the Maximum Independent Set problem on certain unit-disk graph instances [Ebadi et al., Science 376, 6598 (2022)], we develop a theoretical framework to analyze the relative performance of the optimized quantum adiabatic algorithm and a broad class of classical Markov chain Monte Carlo algorithms. We outline conditions for the quantum adiabatic algorithm to achieve a quadratic sp"},"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":"2306.13123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-06-22T18:00:00Z","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el"],"title_canon_sha256":"1795ad7c8a299fb7dcd3edd50788beb0dcc972343b914fc8fb13232da77c52fd","abstract_canon_sha256":"e0e5d1ed5f172796f1c30cddd356fd977b9c2caf51090a96eab742e302ee021f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:37.800774Z","signature_b64":"I1Bjs/iEYEQ7fA5wcy2sEP2a2/9AeB1VOW8m1S6J5eseBF+ZZ2EpSS9NTNcLzJ3uRqf3S452rRdmSh21MZ/vAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3bf6d0a999824fdb6d3827a504d363ad5e2413b1cb6d1eba17bf10c40ac87d2","last_reissued_at":"2026-07-05T06:28:37.800224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:37.800224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum speedup for combinatorial optimization with flat energy landscapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Hannes Pichler, Jin-Guo Liu, Madelyn Cain, Mikhail D. Lukin, Rhine Samajdar, Sambuddha Chattopadhyay","submitted_at":"2023-06-22T18:00:00Z","abstract_excerpt":"Designing quantum algorithms with a speedup over their classical analogs is a central challenge in quantum information science. Motivated by recent experimental observations of a superlinear quantum speedup in solving the Maximum Independent Set problem on certain unit-disk graph instances [Ebadi et al., Science 376, 6598 (2022)], we develop a theoretical framework to analyze the relative performance of the optimized quantum adiabatic algorithm and a broad class of classical Markov chain Monte Carlo algorithms. We outline conditions for the quantum adiabatic algorithm to achieve a quadratic sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.13123","kind":"arxiv","version":2},"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/2306.13123/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":"2306.13123","created_at":"2026-07-05T06:28:37.800306+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.13123v2","created_at":"2026-07-05T06:28:37.800306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.13123","created_at":"2026-07-05T06:28:37.800306+00:00"},{"alias_kind":"pith_short_12","alias_value":"6O7W2CUZTASP","created_at":"2026-07-05T06:28:37.800306+00:00"},{"alias_kind":"pith_short_16","alias_value":"6O7W2CUZTASP3NWT","created_at":"2026-07-05T06:28:37.800306+00:00"},{"alias_kind":"pith_short_8","alias_value":"6O7W2CUZ","created_at":"2026-07-05T06:28:37.800306+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.02590","citing_title":"Partitioned-Constraint QAOA (PC-QAOA): Structural State Preparation and Penalty Enforcement for Quantum Optimization","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6O7W2CUZTASP3NWTQJ5FATJWHL","json":"https://pith.science/pith/6O7W2CUZTASP3NWTQJ5FATJWHL.json","graph_json":"https://pith.science/api/pith-number/6O7W2CUZTASP3NWTQJ5FATJWHL/graph.json","events_json":"https://pith.science/api/pith-number/6O7W2CUZTASP3NWTQJ5FATJWHL/events.json","paper":"https://pith.science/paper/6O7W2CUZ"},"agent_actions":{"view_html":"https://pith.science/pith/6O7W2CUZTASP3NWTQJ5FATJWHL","download_json":"https://pith.science/pith/6O7W2CUZTASP3NWTQJ5FATJWHL.json","view_paper":"https://pith.science/paper/6O7W2CUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.13123&json=true","fetch_graph":"https://pith.science/api/pith-number/6O7W2CUZTASP3NWTQJ5FATJWHL/graph.json","fetch_events":"https://pith.science/api/pith-number/6O7W2CUZTASP3NWTQJ5FATJWHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6O7W2CUZTASP3NWTQJ5FATJWHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6O7W2CUZTASP3NWTQJ5FATJWHL/action/storage_attestation","attest_author":"https://pith.science/pith/6O7W2CUZTASP3NWTQJ5FATJWHL/action/author_attestation","sign_citation":"https://pith.science/pith/6O7W2CUZTASP3NWTQJ5FATJWHL/action/citation_signature","submit_replication":"https://pith.science/pith/6O7W2CUZTASP3NWTQJ5FATJWHL/action/replication_record"}},"created_at":"2026-07-05T06:28:37.800306+00:00","updated_at":"2026-07-05T06:28:37.800306+00:00"}