{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2A42AFN2ZTZ7L2B7D5AOTUTC6Q","short_pith_number":"pith:2A42AFN2","schema_version":"1.0","canonical_sha256":"d039a015baccf3f5e83f1f40e9d262f421cb7fdf2346ae2ed5679db0e4273724","source":{"kind":"arxiv","id":"2411.04898","version":1},"attestation_state":"computed","paper":{"title":"Convergence efficiency of quantum gates and circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","cs.CC","cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Linghang Kong, Zimu Li, Zi-Wen Liu","submitted_at":"2024-11-07T17:40:19Z","abstract_excerpt":"We consider quantum circuit models where the gates are drawn from arbitrary gate ensembles given by probabilistic distributions over certain gate sets and circuit architectures, which we call stochastic quantum circuits. Of main interest in this work is the speed of convergence of stochastic circuits with different gate ensembles and circuit architectures to unitary t-designs. A key motivation for this theory is the varying preference for different gates and circuit architectures in different practical scenarios. In particular, it provides a versatile framework for devising efficient circuits "},"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":"2411.04898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-07T17:40:19Z","cross_cats_sorted":["cond-mat.str-el","cs.CC","cs.IT","math-ph","math.IT","math.MP"],"title_canon_sha256":"18b43f3f479b22ff8fd97da55cb46449405367f26b821aca010b8e7bda5d1670","abstract_canon_sha256":"c58d7c8256806663a0004f2e33db5d9535d3e5129423437e3ec0c472f2c319af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:35.861199Z","signature_b64":"Z6ZxyU/+2+zgBdJgl1DFtsFfpKgzjQjpdie8UHlSrQ4o6eKcsPKcLCyIZgrAyAKt4DNpCIpZcVneY99j0VGMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d039a015baccf3f5e83f1f40e9d262f421cb7fdf2346ae2ed5679db0e4273724","last_reissued_at":"2026-07-05T09:32:35.860642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:35.860642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence efficiency of quantum gates and circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","cs.CC","cs.IT","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Linghang Kong, Zimu Li, Zi-Wen Liu","submitted_at":"2024-11-07T17:40:19Z","abstract_excerpt":"We consider quantum circuit models where the gates are drawn from arbitrary gate ensembles given by probabilistic distributions over certain gate sets and circuit architectures, which we call stochastic quantum circuits. Of main interest in this work is the speed of convergence of stochastic circuits with different gate ensembles and circuit architectures to unitary t-designs. A key motivation for this theory is the varying preference for different gates and circuit architectures in different practical scenarios. In particular, it provides a versatile framework for devising efficient circuits "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04898","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/2411.04898/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":"2411.04898","created_at":"2026-07-05T09:32:35.860693+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04898v1","created_at":"2026-07-05T09:32:35.860693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04898","created_at":"2026-07-05T09:32:35.860693+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A42AFN2ZTZ7","created_at":"2026-07-05T09:32:35.860693+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A42AFN2ZTZ7L2B7","created_at":"2026-07-05T09:32:35.860693+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A42AFN2","created_at":"2026-07-05T09:32:35.860693+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10783","citing_title":"On the KAK Decomposition and Equivalence Classes","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2A42AFN2ZTZ7L2B7D5AOTUTC6Q","json":"https://pith.science/pith/2A42AFN2ZTZ7L2B7D5AOTUTC6Q.json","graph_json":"https://pith.science/api/pith-number/2A42AFN2ZTZ7L2B7D5AOTUTC6Q/graph.json","events_json":"https://pith.science/api/pith-number/2A42AFN2ZTZ7L2B7D5AOTUTC6Q/events.json","paper":"https://pith.science/paper/2A42AFN2"},"agent_actions":{"view_html":"https://pith.science/pith/2A42AFN2ZTZ7L2B7D5AOTUTC6Q","download_json":"https://pith.science/pith/2A42AFN2ZTZ7L2B7D5AOTUTC6Q.json","view_paper":"https://pith.science/paper/2A42AFN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04898&json=true","fetch_graph":"https://pith.science/api/pith-number/2A42AFN2ZTZ7L2B7D5AOTUTC6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/2A42AFN2ZTZ7L2B7D5AOTUTC6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A42AFN2ZTZ7L2B7D5AOTUTC6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A42AFN2ZTZ7L2B7D5AOTUTC6Q/action/storage_attestation","attest_author":"https://pith.science/pith/2A42AFN2ZTZ7L2B7D5AOTUTC6Q/action/author_attestation","sign_citation":"https://pith.science/pith/2A42AFN2ZTZ7L2B7D5AOTUTC6Q/action/citation_signature","submit_replication":"https://pith.science/pith/2A42AFN2ZTZ7L2B7D5AOTUTC6Q/action/replication_record"}},"created_at":"2026-07-05T09:32:35.860693+00:00","updated_at":"2026-07-05T09:32:35.860693+00:00"}