{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DF3GYGXFEKGDEHBAXSHFNK4QTZ","short_pith_number":"pith:DF3GYGXF","schema_version":"1.0","canonical_sha256":"19766c1ae5228c321c20bc8e56ab909e79684d8674bc6691cf11651b8936c1c6","source":{"kind":"arxiv","id":"1809.06957","version":2},"attestation_state":"computed","paper":{"title":"Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram Harrow, Saeed Mehraban","submitted_at":"2018-09-18T22:28:15Z","abstract_excerpt":"We prove that $poly(t) \\cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the \"monomial\" measure, meaning that the monomials of a random circuit from this family have expectation close to the value that would result from the Haar measure. Previously, the best bound was $poly(t)\\cdot n$ due to Brandao-Harrow-Horodecki (BHH) for $D=1$. We also improve the \"scrambling\" and \"decoupling\" bounds for spatially local random circuits due to Brown and Fawzi.\n  O"},"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":"1809.06957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-09-18T22:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"38bf2d1b11ba7e432666afb742d3ae247a29b7554e106b67bb8717e1acf07e9e","abstract_canon_sha256":"1e0995a2184bfb3e2c423bc3afe185a3064f410a3fe02408744deebc751b8124"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:50.507364Z","signature_b64":"vTAOULtnp/4dyCNFeorhOD6BSyT4l2B1uklg+4Qq8s2I9cT94xVkUlfsh9pR7kYgtnHbrAuRdi3WK9olpqpsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19766c1ae5228c321c20bc8e56ab909e79684d8674bc6691cf11651b8936c1c6","last_reissued_at":"2026-07-05T06:06:50.506932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:50.506932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram Harrow, Saeed Mehraban","submitted_at":"2018-09-18T22:28:15Z","abstract_excerpt":"We prove that $poly(t) \\cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the \"monomial\" measure, meaning that the monomials of a random circuit from this family have expectation close to the value that would result from the Haar measure. Previously, the best bound was $poly(t)\\cdot n$ due to Brandao-Harrow-Horodecki (BHH) for $D=1$. We also improve the \"scrambling\" and \"decoupling\" bounds for spatially local random circuits due to Brown and Fawzi.\n  O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06957","kind":"arxiv","version":2},"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/1809.06957/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":"1809.06957","created_at":"2026-07-05T06:06:50.506989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06957v2","created_at":"2026-07-05T06:06:50.506989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06957","created_at":"2026-07-05T06:06:50.506989+00:00"},{"alias_kind":"pith_short_12","alias_value":"DF3GYGXFEKGD","created_at":"2026-07-05T06:06:50.506989+00:00"},{"alias_kind":"pith_short_16","alias_value":"DF3GYGXFEKGDEHBA","created_at":"2026-07-05T06:06:50.506989+00:00"},{"alias_kind":"pith_short_8","alias_value":"DF3GYGXF","created_at":"2026-07-05T06:06:50.506989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11557","citing_title":"Wavelet Variance Equipartition as a Threshold for World-Model Quality and Quantum Kernel TN-Simulability","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15441","citing_title":"Quantum computation at the edge of chaos","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DF3GYGXFEKGDEHBAXSHFNK4QTZ","json":"https://pith.science/pith/DF3GYGXFEKGDEHBAXSHFNK4QTZ.json","graph_json":"https://pith.science/api/pith-number/DF3GYGXFEKGDEHBAXSHFNK4QTZ/graph.json","events_json":"https://pith.science/api/pith-number/DF3GYGXFEKGDEHBAXSHFNK4QTZ/events.json","paper":"https://pith.science/paper/DF3GYGXF"},"agent_actions":{"view_html":"https://pith.science/pith/DF3GYGXFEKGDEHBAXSHFNK4QTZ","download_json":"https://pith.science/pith/DF3GYGXFEKGDEHBAXSHFNK4QTZ.json","view_paper":"https://pith.science/paper/DF3GYGXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06957&json=true","fetch_graph":"https://pith.science/api/pith-number/DF3GYGXFEKGDEHBAXSHFNK4QTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DF3GYGXFEKGDEHBAXSHFNK4QTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DF3GYGXFEKGDEHBAXSHFNK4QTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DF3GYGXFEKGDEHBAXSHFNK4QTZ/action/storage_attestation","attest_author":"https://pith.science/pith/DF3GYGXFEKGDEHBAXSHFNK4QTZ/action/author_attestation","sign_citation":"https://pith.science/pith/DF3GYGXFEKGDEHBAXSHFNK4QTZ/action/citation_signature","submit_replication":"https://pith.science/pith/DF3GYGXFEKGDEHBAXSHFNK4QTZ/action/replication_record"}},"created_at":"2026-07-05T06:06:50.506989+00:00","updated_at":"2026-07-05T06:06:50.506989+00:00"}