{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Z6OCGHVNMVZS5OXKX2IJX2NUZ3","short_pith_number":"pith:Z6OCGHVN","schema_version":"1.0","canonical_sha256":"cf9c231ead65732ebaeabe909be9b4cee4c4e8ed1eb479c1310303b248277fff","source":{"kind":"arxiv","id":"2607.25941","version":1},"attestation_state":"computed","paper":{"title":"Sampling hard circuits with verifiably high fidelity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhinav Deshpande, Ali Javadi-Abhari, Alireza Seif, Bill Fefferman, Ian Hincks, Jay M. Gambetta, Jay-U Chung, Simon Martiel, Soumik Ghosh","submitted_at":"2026-07-28T16:26:56Z","abstract_excerpt":"Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine their complexity-theoretic hardness with two capabilities needed for scalable quantum computing more generally: suppressing hardware errors, and verifying the quantum computation itself. Here we address both issues by introducing structured circuits, which, in addition to provable hardness guarantees, admit an encoding in a quantum code. This allows us to simultaneously reach high fidelities at high circuit depths, and "},"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":"2607.25941","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-28T16:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"654c25ab6ddf95540574bebc33ef052b0d8656003f193d059545b33d7019c40d","abstract_canon_sha256":"fa88e911ce33d6bf95d073745f6cd98eea2df8a7345b8962f3239a9b4151d0e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:26:12.326118Z","signature_b64":"937x99RGLq5r15oVCjN661LZMw7DB/mIxvhbb8pOcSkARQDADgqb35CUsGmSkyukQKLHs5RpVpxhymczTPVDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf9c231ead65732ebaeabe909be9b4cee4c4e8ed1eb479c1310303b248277fff","last_reissued_at":"2026-07-29T01:26:12.325280Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:26:12.325280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling hard circuits with verifiably high fidelity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhinav Deshpande, Ali Javadi-Abhari, Alireza Seif, Bill Fefferman, Ian Hincks, Jay M. Gambetta, Jay-U Chung, Simon Martiel, Soumik Ghosh","submitted_at":"2026-07-28T16:26:56Z","abstract_excerpt":"Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine their complexity-theoretic hardness with two capabilities needed for scalable quantum computing more generally: suppressing hardware errors, and verifying the quantum computation itself. Here we address both issues by introducing structured circuits, which, in addition to provable hardness guarantees, admit an encoding in a quantum code. This allows us to simultaneously reach high fidelities at high circuit depths, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25941","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/2607.25941/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":"2607.25941","created_at":"2026-07-29T01:26:12.325715+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.25941v1","created_at":"2026-07-29T01:26:12.325715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25941","created_at":"2026-07-29T01:26:12.325715+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6OCGHVNMVZS","created_at":"2026-07-29T01:26:12.325715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6OCGHVNMVZS5OXK","created_at":"2026-07-29T01:26:12.325715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6OCGHVN","created_at":"2026-07-29T01:26:12.325715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.13110","citing_title":"Classical Simulation and Design Frontiers for IBM's Doped Clifford Sampling Experiment","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z6OCGHVNMVZS5OXKX2IJX2NUZ3","json":"https://pith.science/pith/Z6OCGHVNMVZS5OXKX2IJX2NUZ3.json","graph_json":"https://pith.science/api/pith-number/Z6OCGHVNMVZS5OXKX2IJX2NUZ3/graph.json","events_json":"https://pith.science/api/pith-number/Z6OCGHVNMVZS5OXKX2IJX2NUZ3/events.json","paper":"https://pith.science/paper/Z6OCGHVN"},"agent_actions":{"view_html":"https://pith.science/pith/Z6OCGHVNMVZS5OXKX2IJX2NUZ3","download_json":"https://pith.science/pith/Z6OCGHVNMVZS5OXKX2IJX2NUZ3.json","view_paper":"https://pith.science/paper/Z6OCGHVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.25941&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6OCGHVNMVZS5OXKX2IJX2NUZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6OCGHVNMVZS5OXKX2IJX2NUZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6OCGHVNMVZS5OXKX2IJX2NUZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6OCGHVNMVZS5OXKX2IJX2NUZ3/action/storage_attestation","attest_author":"https://pith.science/pith/Z6OCGHVNMVZS5OXKX2IJX2NUZ3/action/author_attestation","sign_citation":"https://pith.science/pith/Z6OCGHVNMVZS5OXKX2IJX2NUZ3/action/citation_signature","submit_replication":"https://pith.science/pith/Z6OCGHVNMVZS5OXKX2IJX2NUZ3/action/replication_record"}},"created_at":"2026-07-29T01:26:12.325715+00:00","updated_at":"2026-07-29T01:26:12.325715+00:00"}