{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:I7C5RUZXJLXX7GU44XOPHVKSV6","short_pith_number":"pith:I7C5RUZX","canonical_record":{"source":{"id":"2206.05642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-06-12T02:35:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1e70f354c0008934eee5d7bcde727ebafc393cb086854d258de456d38cc7983e","abstract_canon_sha256":"f5d74416be780f13d202d8427654b0272348c5dd9c159eef4dda3ac98f263fb3"},"schema_version":"1.0"},"canonical_sha256":"47c5d8d3374aef7f9a9ce5dcf3d552af8c8a34641216d4a5ac8fc6077abedf82","source":{"kind":"arxiv","id":"2206.05642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.05642","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"2206.05642v1","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05642","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"I7C5RUZXJLXX","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"pith_short_16","alias_value":"I7C5RUZXJLXX7GU4","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"pith_short_8","alias_value":"I7C5RUZX","created_at":"2026-07-05T04:31:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:I7C5RUZXJLXX7GU44XOPHVKSV6","target":"record","payload":{"canonical_record":{"source":{"id":"2206.05642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-06-12T02:35:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1e70f354c0008934eee5d7bcde727ebafc393cb086854d258de456d38cc7983e","abstract_canon_sha256":"f5d74416be780f13d202d8427654b0272348c5dd9c159eef4dda3ac98f263fb3"},"schema_version":"1.0"},"canonical_sha256":"47c5d8d3374aef7f9a9ce5dcf3d552af8c8a34641216d4a5ac8fc6077abedf82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:01.361984Z","signature_b64":"RVDsTlaogDLl66Ea5FJuC/BwP16Y+1WD+cwX3g02NMsOBYbMhr53Ag+MbUz/1Skd0qqX6W7vYMMhXKXb4DOUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47c5d8d3374aef7f9a9ce5dcf3d552af8c8a34641216d4a5ac8fc6077abedf82","last_reissued_at":"2026-07-05T04:31:01.361529Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:01.361529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.05642","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-05T04:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKyTiT/qLIUxjkHIBLCsDNqafWE6xnh7wGOZiQP0E2FTVsFY+0Bob3Pef0Bwr2qTE4SnEQGCPTbL4tie4eRRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:33:53.355311Z"},"content_sha256":"a1c67b7adf7c967cd5fd385a58b3b454bf51afc17754175b008bf8e221f193fb","schema_version":"1.0","event_id":"sha256:a1c67b7adf7c967cd5fd385a58b3b454bf51afc17754175b008bf8e221f193fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:I7C5RUZXJLXX7GU44XOPHVKSV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average-case hardness of estimating probabilities of random quantum circuits with a linear scaling in the error exponent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Hari Krovi","submitted_at":"2022-06-12T02:35:51Z","abstract_excerpt":"We consider the hardness of computing additive approximations to output probabilities of random quantum circuits. We consider three random circuit families, namely, Haar random, $p=1$ QAOA, and random IQP circuits. Our results are as follows. For Haar random circuits with $m$ gates, we improve on prior results by showing $\\mathsf{coC_=P}$ hardness of average-case additive approximations to an imprecision of $2^{-O(m)}$. Efficient classical simulation of such problems would imply the collapse of the polynomial hierarchy. For constant depth circuits i.e., when $m=O(n)$, this linear scaling in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05642","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/2206.05642/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-05T04:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OuCsRa97ShpDhZbLVDODPiVKu1jdL8Xn+BIFYcLlJkdrEQvxxQz0OOGlJQrusVnn8Q4ptujrGX2JVMKZC2+qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T13:33:53.355870Z"},"content_sha256":"50137dfb23b8cca1523660b0f731d752e6c071a912c9984bb396a4edf030761f","schema_version":"1.0","event_id":"sha256:50137dfb23b8cca1523660b0f731d752e6c071a912c9984bb396a4edf030761f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7C5RUZXJLXX7GU44XOPHVKSV6/bundle.json","state_url":"https://pith.science/pith/I7C5RUZXJLXX7GU44XOPHVKSV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7C5RUZXJLXX7GU44XOPHVKSV6/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-08-12T13:33:53Z","links":{"resolver":"https://pith.science/pith/I7C5RUZXJLXX7GU44XOPHVKSV6","bundle":"https://pith.science/pith/I7C5RUZXJLXX7GU44XOPHVKSV6/bundle.json","state":"https://pith.science/pith/I7C5RUZXJLXX7GU44XOPHVKSV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7C5RUZXJLXX7GU44XOPHVKSV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:I7C5RUZXJLXX7GU44XOPHVKSV6","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":"f5d74416be780f13d202d8427654b0272348c5dd9c159eef4dda3ac98f263fb3","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-06-12T02:35:51Z","title_canon_sha256":"1e70f354c0008934eee5d7bcde727ebafc393cb086854d258de456d38cc7983e"},"schema_version":"1.0","source":{"id":"2206.05642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.05642","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"2206.05642v1","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05642","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"I7C5RUZXJLXX","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"pith_short_16","alias_value":"I7C5RUZXJLXX7GU4","created_at":"2026-07-05T04:31:01Z"},{"alias_kind":"pith_short_8","alias_value":"I7C5RUZX","created_at":"2026-07-05T04:31:01Z"}],"graph_snapshots":[{"event_id":"sha256:50137dfb23b8cca1523660b0f731d752e6c071a912c9984bb396a4edf030761f","target":"graph","created_at":"2026-07-05T04:31:01Z","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/2206.05642/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the hardness of computing additive approximations to output probabilities of random quantum circuits. We consider three random circuit families, namely, Haar random, $p=1$ QAOA, and random IQP circuits. Our results are as follows. For Haar random circuits with $m$ gates, we improve on prior results by showing $\\mathsf{coC_=P}$ hardness of average-case additive approximations to an imprecision of $2^{-O(m)}$. Efficient classical simulation of such problems would imply the collapse of the polynomial hierarchy. For constant depth circuits i.e., when $m=O(n)$, this linear scaling in th","authors_text":"Hari Krovi","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-06-12T02:35:51Z","title":"Average-case hardness of estimating probabilities of random quantum circuits with a linear scaling in the error exponent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05642","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:a1c67b7adf7c967cd5fd385a58b3b454bf51afc17754175b008bf8e221f193fb","target":"record","created_at":"2026-07-05T04:31:01Z","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":"f5d74416be780f13d202d8427654b0272348c5dd9c159eef4dda3ac98f263fb3","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-06-12T02:35:51Z","title_canon_sha256":"1e70f354c0008934eee5d7bcde727ebafc393cb086854d258de456d38cc7983e"},"schema_version":"1.0","source":{"id":"2206.05642","kind":"arxiv","version":1}},"canonical_sha256":"47c5d8d3374aef7f9a9ce5dcf3d552af8c8a34641216d4a5ac8fc6077abedf82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47c5d8d3374aef7f9a9ce5dcf3d552af8c8a34641216d4a5ac8fc6077abedf82","first_computed_at":"2026-07-05T04:31:01.361529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:01.361529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RVDsTlaogDLl66Ea5FJuC/BwP16Y+1WD+cwX3g02NMsOBYbMhr53Ag+MbUz/1Skd0qqX6W7vYMMhXKXb4DOUBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:01.361984Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.05642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1c67b7adf7c967cd5fd385a58b3b454bf51afc17754175b008bf8e221f193fb","sha256:50137dfb23b8cca1523660b0f731d752e6c071a912c9984bb396a4edf030761f"],"state_sha256":"3a6fefd1bae5cf06af3172ad7478b65af0450719f6a3278eb53ceda6c710a2e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pa97uyBobPb/kB/Q8G/hQ7XqZQIRgpTUjqillBNSVReW4UqGQrGUQgw6/1PXdsv0k1HzwKME9DFgYt++3Tx7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T13:33:53.360414Z","bundle_sha256":"7d78f2a5a3bb55b086544bb0f91df383f219dd41efb008324566a3e1da29df17"}}