{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TINBHEHGFFBNZGE4C54VDU7TXS","short_pith_number":"pith:TINBHEHG","schema_version":"1.0","canonical_sha256":"9a1a1390e62942dc989c177951d3f3bc8e04988d279d00cce2b33604be0d186c","source":{"kind":"arxiv","id":"2404.14493","version":2},"attestation_state":"computed","paper":{"title":"On verifiable quantum advantage with peaked circuit sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Scott Aaronson, Yuxuan Zhang","submitted_at":"2024-04-22T18:00:06Z","abstract_excerpt":"Over a decade after its proposal, the idea of using quantum computers to sample hard distributions has remained a key path to demonstrating quantum advantage. Yet a severe drawback remains: verification seems to require classical computation exponential in the system size, $n$. As an attempt to overcome this difficulty, we propose a new candidate for quantum advantage experiments with otherwise random \"peaked circuits\", i.e., quantum circuits whose outputs have high concentrations on a computational basis state. Naturally, the heavy output string can be used for classical verification. In this"},"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":"2404.14493","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-22T18:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"65eb7f9a107a5795df269539c40d7a331f7f34bb10188212eb0ccdfee77851e8","abstract_canon_sha256":"46056142c281532c568b2495141211f47eab10e473c7636d2b533262bc994fd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:15.472585Z","signature_b64":"pycexh/8jsxCLuKqiJqFfFwzQv7Xt7coWhGWZIG05SFXz+OTU4+TPJ53fDq9hj2dDbgjnChNVGh4BgdHWWYMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a1a1390e62942dc989c177951d3f3bc8e04988d279d00cce2b33604be0d186c","last_reissued_at":"2026-07-05T08:21:15.472139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:15.472139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On verifiable quantum advantage with peaked circuit sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Scott Aaronson, Yuxuan Zhang","submitted_at":"2024-04-22T18:00:06Z","abstract_excerpt":"Over a decade after its proposal, the idea of using quantum computers to sample hard distributions has remained a key path to demonstrating quantum advantage. Yet a severe drawback remains: verification seems to require classical computation exponential in the system size, $n$. As an attempt to overcome this difficulty, we propose a new candidate for quantum advantage experiments with otherwise random \"peaked circuits\", i.e., quantum circuits whose outputs have high concentrations on a computational basis state. Naturally, the heavy output string can be used for classical verification. In this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14493","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/2404.14493/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":"2404.14493","created_at":"2026-07-05T08:21:15.472192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.14493v2","created_at":"2026-07-05T08:21:15.472192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14493","created_at":"2026-07-05T08:21:15.472192+00:00"},{"alias_kind":"pith_short_12","alias_value":"TINBHEHGFFBN","created_at":"2026-07-05T08:21:15.472192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TINBHEHGFFBNZGE4","created_at":"2026-07-05T08:21:15.472192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TINBHEHG","created_at":"2026-07-05T08:21:15.472192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07816","citing_title":"A Sparse and Truncated State Vector Simulator for Peaked Circuits","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03729","citing_title":"Ensemble Engineering to Overcome Destructive Cancellation in Quantum Measurements","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25983","citing_title":"Evaluating System-Level Fidelity with Peaked Random Circuits","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2503.20683","citing_title":"New perspectives on quantum kernels through the lens of entangled tensor kernels","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03729","citing_title":"Ensemble Engineering to Overcome Destructive Cancellation in Quantum Measurements","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21908","citing_title":"Efficient Classical Simulation of Heuristic Peaked Quantum Circuits","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TINBHEHGFFBNZGE4C54VDU7TXS","json":"https://pith.science/pith/TINBHEHGFFBNZGE4C54VDU7TXS.json","graph_json":"https://pith.science/api/pith-number/TINBHEHGFFBNZGE4C54VDU7TXS/graph.json","events_json":"https://pith.science/api/pith-number/TINBHEHGFFBNZGE4C54VDU7TXS/events.json","paper":"https://pith.science/paper/TINBHEHG"},"agent_actions":{"view_html":"https://pith.science/pith/TINBHEHGFFBNZGE4C54VDU7TXS","download_json":"https://pith.science/pith/TINBHEHGFFBNZGE4C54VDU7TXS.json","view_paper":"https://pith.science/paper/TINBHEHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.14493&json=true","fetch_graph":"https://pith.science/api/pith-number/TINBHEHGFFBNZGE4C54VDU7TXS/graph.json","fetch_events":"https://pith.science/api/pith-number/TINBHEHGFFBNZGE4C54VDU7TXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TINBHEHGFFBNZGE4C54VDU7TXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TINBHEHGFFBNZGE4C54VDU7TXS/action/storage_attestation","attest_author":"https://pith.science/pith/TINBHEHGFFBNZGE4C54VDU7TXS/action/author_attestation","sign_citation":"https://pith.science/pith/TINBHEHGFFBNZGE4C54VDU7TXS/action/citation_signature","submit_replication":"https://pith.science/pith/TINBHEHGFFBNZGE4C54VDU7TXS/action/replication_record"}},"created_at":"2026-07-05T08:21:15.472192+00:00","updated_at":"2026-07-05T08:21:15.472192+00:00"}