{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UTMEHPQ472Z7BRQMM6S3RAU3AH","short_pith_number":"pith:UTMEHPQ4","schema_version":"1.0","canonical_sha256":"a4d843be1cfeb3f0c60c67a5b8829b01c17e9eb238085e73c553c9d669996a6b","source":{"kind":"arxiv","id":"2309.08405","version":1},"attestation_state":"computed","paper":{"title":"Classical simulation of peaked shallow quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gosset, Sergey Bravyi, Yinchen Liu","submitted_at":"2023-09-15T14:01:13Z","abstract_excerpt":"An $n$-qubit quantum circuit is said to be peaked if it has an output probability that is at least inverse-polynomially large as a function of $n$. We describe a classical algorithm with quasipolynomial runtime $n^{O(\\log{n})}$ that approximately samples from the output distribution of a peaked constant-depth circuit. We give even faster algorithms for circuits composed of nearest-neighbor gates on a $D$-dimensional grid of qubits, with polynomial runtime $n^{O(1)}$ if $D=2$ and almost-polynomial runtime $n^{O(\\log{\\log{n}})}$ for $D>2$. Our sampling algorithms can be used to estimate output p"},"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":"2309.08405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-15T14:01:13Z","cross_cats_sorted":[],"title_canon_sha256":"c1e268b431c8635db443266e03f1876194cf796946c131e3c212ecf1a86fd88e","abstract_canon_sha256":"c47068663efddd3e0213f109206ea6019074d7e34cb23e3549f916b68df8a146"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:06.260494Z","signature_b64":"6S7drmlaluFpEDtUf+QAbMZmsD2UyW3lI6VSiQCjIe4QWCX71i5mKqr9GDDycvAwya3H5t8Wejv80CZ6uSDWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4d843be1cfeb3f0c60c67a5b8829b01c17e9eb238085e73c553c9d669996a6b","last_reissued_at":"2026-07-05T06:51:06.260129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:06.260129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical simulation of peaked shallow quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gosset, Sergey Bravyi, Yinchen Liu","submitted_at":"2023-09-15T14:01:13Z","abstract_excerpt":"An $n$-qubit quantum circuit is said to be peaked if it has an output probability that is at least inverse-polynomially large as a function of $n$. We describe a classical algorithm with quasipolynomial runtime $n^{O(\\log{n})}$ that approximately samples from the output distribution of a peaked constant-depth circuit. We give even faster algorithms for circuits composed of nearest-neighbor gates on a $D$-dimensional grid of qubits, with polynomial runtime $n^{O(1)}$ if $D=2$ and almost-polynomial runtime $n^{O(\\log{\\log{n}})}$ for $D>2$. Our sampling algorithms can be used to estimate output p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08405","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/2309.08405/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":"2309.08405","created_at":"2026-07-05T06:51:06.260182+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.08405v1","created_at":"2026-07-05T06:51:06.260182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08405","created_at":"2026-07-05T06:51:06.260182+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTMEHPQ472Z7","created_at":"2026-07-05T06:51:06.260182+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTMEHPQ472Z7BRQM","created_at":"2026-07-05T06:51:06.260182+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTMEHPQ4","created_at":"2026-07-05T06:51:06.260182+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH","json":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH.json","graph_json":"https://pith.science/api/pith-number/UTMEHPQ472Z7BRQMM6S3RAU3AH/graph.json","events_json":"https://pith.science/api/pith-number/UTMEHPQ472Z7BRQMM6S3RAU3AH/events.json","paper":"https://pith.science/paper/UTMEHPQ4"},"agent_actions":{"view_html":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH","download_json":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH.json","view_paper":"https://pith.science/paper/UTMEHPQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.08405&json=true","fetch_graph":"https://pith.science/api/pith-number/UTMEHPQ472Z7BRQMM6S3RAU3AH/graph.json","fetch_events":"https://pith.science/api/pith-number/UTMEHPQ472Z7BRQMM6S3RAU3AH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/action/storage_attestation","attest_author":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/action/author_attestation","sign_citation":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/action/citation_signature","submit_replication":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/action/replication_record"}},"created_at":"2026-07-05T06:51:06.260182+00:00","updated_at":"2026-07-05T06:51:06.260182+00:00"}