{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AVKK7GQUC6BSA4QYC52RXGKESM","short_pith_number":"pith:AVKK7GQU","schema_version":"1.0","canonical_sha256":"0554af9a14178320721817751b9944930bc0fb8851ef23201e0e8ded040c990a","source":{"kind":"arxiv","id":"1208.0692","version":4},"attestation_state":"computed","paper":{"title":"Local random quantum circuits are approximate polynomial-designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram W. Harrow, Fernando G. S. L. Brandao, Michal Horodecki","submitted_at":"2012-08-03T08:59:49Z","abstract_excerpt":"We prove that local random quantum circuits acting on n qubits composed of O(t^{10} n^2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t > 3.\n  The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveir"},"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":"1208.0692","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-03T08:59:49Z","cross_cats_sorted":[],"title_canon_sha256":"2a6b162393b90f65e93770b60305c411703b1875b821c8dad2db01e451a25ba7","abstract_canon_sha256":"57bf441c242437a3b39a994e78a212dc120abc5f3b28d3d46dfbb74c6df14ba6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:02.624946Z","signature_b64":"XgQJ7vaWLHVkChfjL4wQQr0QkNNLNt/wqBRQLRUt7GuWT98Av4XKuEJYtNBKX6Vi3Gv66zPj1RYY6jByMBNhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0554af9a14178320721817751b9944930bc0fb8851ef23201e0e8ded040c990a","last_reissued_at":"2026-05-17T23:41:02.624147Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:02.624147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local random quantum circuits are approximate polynomial-designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram W. Harrow, Fernando G. S. L. Brandao, Michal Horodecki","submitted_at":"2012-08-03T08:59:49Z","abstract_excerpt":"We prove that local random quantum circuits acting on n qubits composed of O(t^{10} n^2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t > 3.\n  The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0692","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1208.0692","created_at":"2026-05-17T23:41:02.624283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0692v4","created_at":"2026-05-17T23:41:02.624283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0692","created_at":"2026-05-17T23:41:02.624283+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVKK7GQUC6BS","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVKK7GQUC6BSA4QY","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVKK7GQU","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.03680","citing_title":"A Hierarchy of Spectral Gap Certificates for Frustration-Free Spin Systems","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2604.10122","citing_title":"Unitary Designs from Two Chaotic Hamiltonians and a Random Pauli Operation","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVKK7GQUC6BSA4QYC52RXGKESM","json":"https://pith.science/pith/AVKK7GQUC6BSA4QYC52RXGKESM.json","graph_json":"https://pith.science/api/pith-number/AVKK7GQUC6BSA4QYC52RXGKESM/graph.json","events_json":"https://pith.science/api/pith-number/AVKK7GQUC6BSA4QYC52RXGKESM/events.json","paper":"https://pith.science/paper/AVKK7GQU"},"agent_actions":{"view_html":"https://pith.science/pith/AVKK7GQUC6BSA4QYC52RXGKESM","download_json":"https://pith.science/pith/AVKK7GQUC6BSA4QYC52RXGKESM.json","view_paper":"https://pith.science/paper/AVKK7GQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0692&json=true","fetch_graph":"https://pith.science/api/pith-number/AVKK7GQUC6BSA4QYC52RXGKESM/graph.json","fetch_events":"https://pith.science/api/pith-number/AVKK7GQUC6BSA4QYC52RXGKESM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVKK7GQUC6BSA4QYC52RXGKESM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVKK7GQUC6BSA4QYC52RXGKESM/action/storage_attestation","attest_author":"https://pith.science/pith/AVKK7GQUC6BSA4QYC52RXGKESM/action/author_attestation","sign_citation":"https://pith.science/pith/AVKK7GQUC6BSA4QYC52RXGKESM/action/citation_signature","submit_replication":"https://pith.science/pith/AVKK7GQUC6BSA4QYC52RXGKESM/action/replication_record"}},"created_at":"2026-05-17T23:41:02.624283+00:00","updated_at":"2026-05-17T23:41:02.624283+00:00"}