{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ND33ZA6FHBVSMUJTQPFF66PAFZ","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":"8f1175bd037387e2d92468f7959029d3e4702f8402ee131666d2b9ee26b12927","cross_cats_sorted":["cond-mat.stat-mech","hep-th","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-30T08:48:14Z","title_canon_sha256":"c9db5e7bd50cb2c5a8bdadec3373aa59cf78f481a42c72aef53b0ba59866c57e"},"schema_version":"1.0","source":{"id":"2310.19355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.19355","created_at":"2026-07-05T07:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"2310.19355v1","created_at":"2026-07-05T07:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19355","created_at":"2026-07-05T07:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"ND33ZA6FHBVS","created_at":"2026-07-05T07:06:49Z"},{"alias_kind":"pith_short_16","alias_value":"ND33ZA6FHBVSMUJT","created_at":"2026-07-05T07:06:49Z"},{"alias_kind":"pith_short_8","alias_value":"ND33ZA6F","created_at":"2026-07-05T07:06:49Z"}],"graph_snapshots":[{"event_id":"sha256:27d9e892f53537f7ae58d888c5007d68821990632cc073a5d7a5b8e7e7e88ad1","target":"graph","created_at":"2026-07-05T07:06:49Z","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/2310.19355/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and $D$-dimensional graphs form approximate unitary designs, that is, they generate unitaries from distributions close to the Haar measure on the unitary group $U(q^n)$ after polynomially many gates. Here, we extend those results by proving that RQCs comprised of $O(\\mathrm{poly}(n,k))$ gates on a wide class of graphs form approximate unitary $k$-designs. We prove that ","authors_text":"Nicholas Hunter-Jones, Shivan Mittal","cross_cats":["cond-mat.stat-mech","hep-th","math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-30T08:48:14Z","title":"Local random quantum circuits form approximate designs on arbitrary architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19355","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:e911d498eae3f4bdb523ab18c50a95f957c4831a2c1c5e6166df271f4a26fb88","target":"record","created_at":"2026-07-05T07:06:49Z","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":"8f1175bd037387e2d92468f7959029d3e4702f8402ee131666d2b9ee26b12927","cross_cats_sorted":["cond-mat.stat-mech","hep-th","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-30T08:48:14Z","title_canon_sha256":"c9db5e7bd50cb2c5a8bdadec3373aa59cf78f481a42c72aef53b0ba59866c57e"},"schema_version":"1.0","source":{"id":"2310.19355","kind":"arxiv","version":1}},"canonical_sha256":"68f7bc83c5386b26513383ca5f79e02e72cf0009441da3fccda8cffd443489c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68f7bc83c5386b26513383ca5f79e02e72cf0009441da3fccda8cffd443489c7","first_computed_at":"2026-07-05T07:06:49.925111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:06:49.925111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3gDQBEG3njlYXsOk+x8y3wE2+QprdNQnDAyhT81an5PyJODelJ2iBPD71VAdfbwFG6NxXgbIRpwtwk30DPAOAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:06:49.925595Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.19355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e911d498eae3f4bdb523ab18c50a95f957c4831a2c1c5e6166df271f4a26fb88","sha256:27d9e892f53537f7ae58d888c5007d68821990632cc073a5d7a5b8e7e7e88ad1"],"state_sha256":"18fdcd50971be81ae2e64f0b131c323bf558924cf9228a32b7df6f2c97951b6f"}