{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:ULETYJJZV6SJFCBGJ3T5QQFEW7","short_pith_number":"pith:ULETYJJZ","schema_version":"1.0","canonical_sha256":"a2c93c2539afa49288264ee7d840a4b7f1db45d9d8a50e4a08c3fd2b6f3116da","source":{"kind":"arxiv","id":"0802.1919","version":3},"attestation_state":"computed","paper":{"title":"Random Quantum Circuits are Approximate 2-designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram W. Harrow, Richard A. Low","submitted_at":"2008-02-13T21:02:17Z","abstract_excerpt":"Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed unitary. However, this requires exponential time. We show that random circuits of only polynomial length will approximate the first and second moments of the Haar distribution, thus forming approximate 1- and 2-designs. Previous constructions required longer circuits and worked only for specific gate sets. As a corollary of our main result, we also improve previous bounds on the convergence rate of random walks on t"},"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":"0802.1919","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-02-13T21:02:17Z","cross_cats_sorted":[],"title_canon_sha256":"3719e4434024ba6521164e4707be137dae36051d1f6379ffbb0bd03587808c18","abstract_canon_sha256":"384eac2db8ffe7e237bb39ace6a885c41603e101dd8b2ad54084a86bae009386"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:01.077183Z","signature_b64":"2yR0LtvXcde9Yk+qt9i8Hpp64ROOfqWMX6LiptBTvvhglIA2oQQ0WJncSSR1132jPSkhRCZpmfyv3HqzUdGcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2c93c2539afa49288264ee7d840a4b7f1db45d9d8a50e4a08c3fd2b6f3116da","last_reissued_at":"2026-05-18T02:16:01.076670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:01.076670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Quantum Circuits are Approximate 2-designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aram W. Harrow, Richard A. Low","submitted_at":"2008-02-13T21:02:17Z","abstract_excerpt":"Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed unitary. However, this requires exponential time. We show that random circuits of only polynomial length will approximate the first and second moments of the Haar distribution, thus forming approximate 1- and 2-designs. Previous constructions required longer circuits and worked only for specific gate sets. As a corollary of our main result, we also improve previous bounds on the convergence rate of random walks on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1919","kind":"arxiv","version":3},"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":"0802.1919","created_at":"2026-05-18T02:16:01.076788+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.1919v3","created_at":"2026-05-18T02:16:01.076788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1919","created_at":"2026-05-18T02:16:01.076788+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULETYJJZV6SJ","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULETYJJZV6SJFCBG","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULETYJJZ","created_at":"2026-05-18T12:25:58.018023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22022","citing_title":"Entanglement and information scrambling in long-range measurement-only circuits","ref_index":77,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULETYJJZV6SJFCBGJ3T5QQFEW7","json":"https://pith.science/pith/ULETYJJZV6SJFCBGJ3T5QQFEW7.json","graph_json":"https://pith.science/api/pith-number/ULETYJJZV6SJFCBGJ3T5QQFEW7/graph.json","events_json":"https://pith.science/api/pith-number/ULETYJJZV6SJFCBGJ3T5QQFEW7/events.json","paper":"https://pith.science/paper/ULETYJJZ"},"agent_actions":{"view_html":"https://pith.science/pith/ULETYJJZV6SJFCBGJ3T5QQFEW7","download_json":"https://pith.science/pith/ULETYJJZV6SJFCBGJ3T5QQFEW7.json","view_paper":"https://pith.science/paper/ULETYJJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.1919&json=true","fetch_graph":"https://pith.science/api/pith-number/ULETYJJZV6SJFCBGJ3T5QQFEW7/graph.json","fetch_events":"https://pith.science/api/pith-number/ULETYJJZV6SJFCBGJ3T5QQFEW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULETYJJZV6SJFCBGJ3T5QQFEW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULETYJJZV6SJFCBGJ3T5QQFEW7/action/storage_attestation","attest_author":"https://pith.science/pith/ULETYJJZV6SJFCBGJ3T5QQFEW7/action/author_attestation","sign_citation":"https://pith.science/pith/ULETYJJZV6SJFCBGJ3T5QQFEW7/action/citation_signature","submit_replication":"https://pith.science/pith/ULETYJJZV6SJFCBGJ3T5QQFEW7/action/replication_record"}},"created_at":"2026-05-18T02:16:01.076788+00:00","updated_at":"2026-05-18T02:16:01.076788+00:00"}