{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:UTMEHPQ472Z7BRQMM6S3RAU3AH","short_pith_number":"pith:UTMEHPQ4","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"},"canonical_sha256":"a4d843be1cfeb3f0c60c67a5b8829b01c17e9eb238085e73c553c9d669996a6b","source":{"kind":"arxiv","id":"2309.08405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.08405","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"2309.08405v1","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08405","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"UTMEHPQ472Z7","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"pith_short_16","alias_value":"UTMEHPQ472Z7BRQM","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"pith_short_8","alias_value":"UTMEHPQ4","created_at":"2026-07-05T06:51:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:UTMEHPQ472Z7BRQMM6S3RAU3AH","target":"record","payload":{"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"},"canonical_sha256":"a4d843be1cfeb3f0c60c67a5b8829b01c17e9eb238085e73c553c9d669996a6b","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"},"source_kind":"arxiv","source_id":"2309.08405","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibZmNSpD7cn/hE9pdSW8V5d86IjzGywdW2XUhXkSpLvKv19HuL+DtwqLsFF9ea2O5JbD1fR0V/DK3xOpOQGvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:12:03.530353Z"},"content_sha256":"204bf77e7ff943b97a5289e2bc376d4587557ee406ee54000f58f2152f270d55","schema_version":"1.0","event_id":"sha256:204bf77e7ff943b97a5289e2bc376d4587557ee406ee54000f58f2152f270d55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:UTMEHPQ472Z7BRQMM6S3RAU3AH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dcKCnaYNzRYbQLzrxd4z3EzfsbsfuLSSmh27ZW1BO2EPQROwn7xtASsdDv82TOnmlSrf+7UYIrCJUS8OkC+JBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:12:03.531265Z"},"content_sha256":"a5f025c0f7f65d0f4873994ebaef08858f7f8a9b2d7551399b1cd72b21a6ab09","schema_version":"1.0","event_id":"sha256:a5f025c0f7f65d0f4873994ebaef08858f7f8a9b2d7551399b1cd72b21a6ab09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/bundle.json","state_url":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T13:12:03Z","links":{"resolver":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH","bundle":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/bundle.json","state":"https://pith.science/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTMEHPQ472Z7BRQMM6S3RAU3AH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:UTMEHPQ472Z7BRQMM6S3RAU3AH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c47068663efddd3e0213f109206ea6019074d7e34cb23e3549f916b68df8a146","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-15T14:01:13Z","title_canon_sha256":"c1e268b431c8635db443266e03f1876194cf796946c131e3c212ecf1a86fd88e"},"schema_version":"1.0","source":{"id":"2309.08405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.08405","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"2309.08405v1","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08405","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"UTMEHPQ472Z7","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"pith_short_16","alias_value":"UTMEHPQ472Z7BRQM","created_at":"2026-07-05T06:51:06Z"},{"alias_kind":"pith_short_8","alias_value":"UTMEHPQ4","created_at":"2026-07-05T06:51:06Z"}],"graph_snapshots":[{"event_id":"sha256:a5f025c0f7f65d0f4873994ebaef08858f7f8a9b2d7551399b1cd72b21a6ab09","target":"graph","created_at":"2026-07-05T06:51:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.08405/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"David Gosset, Sergey Bravyi, Yinchen Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-15T14:01:13Z","title":"Classical simulation of peaked shallow quantum circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08405","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:204bf77e7ff943b97a5289e2bc376d4587557ee406ee54000f58f2152f270d55","target":"record","created_at":"2026-07-05T06:51:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c47068663efddd3e0213f109206ea6019074d7e34cb23e3549f916b68df8a146","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-15T14:01:13Z","title_canon_sha256":"c1e268b431c8635db443266e03f1876194cf796946c131e3c212ecf1a86fd88e"},"schema_version":"1.0","source":{"id":"2309.08405","kind":"arxiv","version":1}},"canonical_sha256":"a4d843be1cfeb3f0c60c67a5b8829b01c17e9eb238085e73c553c9d669996a6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4d843be1cfeb3f0c60c67a5b8829b01c17e9eb238085e73c553c9d669996a6b","first_computed_at":"2026-07-05T06:51:06.260129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:51:06.260129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6S7drmlaluFpEDtUf+QAbMZmsD2UyW3lI6VSiQCjIe4QWCX71i5mKqr9GDDycvAwya3H5t8Wejv80CZ6uSDWCw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:51:06.260494Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.08405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:204bf77e7ff943b97a5289e2bc376d4587557ee406ee54000f58f2152f270d55","sha256:a5f025c0f7f65d0f4873994ebaef08858f7f8a9b2d7551399b1cd72b21a6ab09"],"state_sha256":"aea0d7851606c4c7c8eea28ffdcafb2b52eadcc24bcbe1b9427e286d423874d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Is65gRCjEB5pbOkhbyxSOItMqEpboGzOxj6+rub+Y7E1K944Xshapj8ida4hyA+4+Gkc9lUuHmE+z3AnaBo4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T13:12:03.534621Z","bundle_sha256":"44e94fbb609255901925bc514b4649f71e8c944bee6a9d32eff192429d4220e9"}}