{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:W4K2HZ6V6SWWPKBQWF5UY3MVXP","short_pith_number":"pith:W4K2HZ6V","schema_version":"1.0","canonical_sha256":"b715a3e7d5f4ad67a830b17b4c6d95bbe3d7da940335eb6618d0981fa63e4140","source":{"kind":"arxiv","id":"2303.16944","version":2},"attestation_state":"computed","paper":{"title":"On the moments of random quantum circuits and robust quantum complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonas Haferkamp","submitted_at":"2023-03-29T18:06:03Z","abstract_excerpt":"We prove new lower bounds on the growth of robust quantum circuit complexity -- the minimal number of gates $C_{\\delta}(U)$ to approximate a unitary $U$ up to an error of $\\delta$ in operator norm distance. More precisely we show two bounds for random quantum circuits with local gates drawn from a subgroup of $SU(4)$. First, for $\\delta=\\Theta(2^{-n})$, we prove a linear growth rate: $C_{\\delta}\\geq d/\\mathrm{poly}(n)$ for random quantum circuits on $n$ qubits with $d\\leq 2^{n/2}$ gates. Second, for $ \\delta=\\Omega(1)$, we prove a square-root growth of complexity: $C_{\\delta}\\geq \\sqrt{d}/\\mat"},"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":"2303.16944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-03-29T18:06:03Z","cross_cats_sorted":[],"title_canon_sha256":"0df58c64a14f4f8060ddc131d684588e359e0acf2cf6c97a4958a0bc02a551f4","abstract_canon_sha256":"cd6a1ae8807e96c36b0f136848156785ce6b9d25ad759c7f414ed0c4262c1f2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:16:36.118704Z","signature_b64":"PsljBZvPoz8mHXMoh45qc67Xmu4zlAHN4oRhP+VLiI6T8jL/UftrGhxxLg7Z4aLTxf3ex6FKm/TPOwerqyKXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b715a3e7d5f4ad67a830b17b4c6d95bbe3d7da940335eb6618d0981fa63e4140","last_reissued_at":"2026-07-05T06:16:36.118320Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:16:36.118320Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the moments of random quantum circuits and robust quantum complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonas Haferkamp","submitted_at":"2023-03-29T18:06:03Z","abstract_excerpt":"We prove new lower bounds on the growth of robust quantum circuit complexity -- the minimal number of gates $C_{\\delta}(U)$ to approximate a unitary $U$ up to an error of $\\delta$ in operator norm distance. More precisely we show two bounds for random quantum circuits with local gates drawn from a subgroup of $SU(4)$. First, for $\\delta=\\Theta(2^{-n})$, we prove a linear growth rate: $C_{\\delta}\\geq d/\\mathrm{poly}(n)$ for random quantum circuits on $n$ qubits with $d\\leq 2^{n/2}$ gates. Second, for $ \\delta=\\Omega(1)$, we prove a square-root growth of complexity: $C_{\\delta}\\geq \\sqrt{d}/\\mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16944","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/2303.16944/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":"2303.16944","created_at":"2026-07-05T06:16:36.118381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16944v2","created_at":"2026-07-05T06:16:36.118381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16944","created_at":"2026-07-05T06:16:36.118381+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4K2HZ6V6SWW","created_at":"2026-07-05T06:16:36.118381+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4K2HZ6V6SWWPKBQ","created_at":"2026-07-05T06:16:36.118381+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4K2HZ6V","created_at":"2026-07-05T06:16:36.118381+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W4K2HZ6V6SWWPKBQWF5UY3MVXP","json":"https://pith.science/pith/W4K2HZ6V6SWWPKBQWF5UY3MVXP.json","graph_json":"https://pith.science/api/pith-number/W4K2HZ6V6SWWPKBQWF5UY3MVXP/graph.json","events_json":"https://pith.science/api/pith-number/W4K2HZ6V6SWWPKBQWF5UY3MVXP/events.json","paper":"https://pith.science/paper/W4K2HZ6V"},"agent_actions":{"view_html":"https://pith.science/pith/W4K2HZ6V6SWWPKBQWF5UY3MVXP","download_json":"https://pith.science/pith/W4K2HZ6V6SWWPKBQWF5UY3MVXP.json","view_paper":"https://pith.science/paper/W4K2HZ6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16944&json=true","fetch_graph":"https://pith.science/api/pith-number/W4K2HZ6V6SWWPKBQWF5UY3MVXP/graph.json","fetch_events":"https://pith.science/api/pith-number/W4K2HZ6V6SWWPKBQWF5UY3MVXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4K2HZ6V6SWWPKBQWF5UY3MVXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4K2HZ6V6SWWPKBQWF5UY3MVXP/action/storage_attestation","attest_author":"https://pith.science/pith/W4K2HZ6V6SWWPKBQWF5UY3MVXP/action/author_attestation","sign_citation":"https://pith.science/pith/W4K2HZ6V6SWWPKBQWF5UY3MVXP/action/citation_signature","submit_replication":"https://pith.science/pith/W4K2HZ6V6SWWPKBQWF5UY3MVXP/action/replication_record"}},"created_at":"2026-07-05T06:16:36.118381+00:00","updated_at":"2026-07-05T06:16:36.118381+00:00"}