{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FPNWTBKTPNIHSVTQGI4N73DM4S","short_pith_number":"pith:FPNWTBKT","schema_version":"1.0","canonical_sha256":"2bdb6985537b507956703238dfec6ce4a2eafc7a12efdfe33e9a643ef33d26a2","source":{"kind":"arxiv","id":"2209.00768","version":2},"attestation_state":"computed","paper":{"title":"Non-IID Quantum Federated Learning with One-shot Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Haimeng Zhao","submitted_at":"2022-09-02T00:38:44Z","abstract_excerpt":"Federated learning refers to the task of machine learning based on decentralized data from multiple clients with secured data privacy. Recent studies show that quantum algorithms can be exploited to boost its performance. However, when the clients' data are not independent and identically distributed (IID), the performance of conventional federated algorithms is known to deteriorate. In this work, we explore the non-IID issue in quantum federated learning with both theoretical and numerical analysis. We further prove that a global quantum channel can be exactly decomposed into local channels 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":"2209.00768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-09-02T00:38:44Z","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"title_canon_sha256":"5d7b0a13e86e0b68516b09d256ec30f1fc32d58fc01fbddf7d331831bee620fe","abstract_canon_sha256":"471fa89cdf61d60b894f0f0cb4c8ada675f47ba0fbe5a9bf821c8996f27abce5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:02.595927Z","signature_b64":"hynd7vCic+IduELo4wXJgWVP/pd5x+x1sLDPe8azR3OHxCGHctrc+cuIundzYG3Xe7y+UPq/qleJ6oo8VYe0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bdb6985537b507956703238dfec6ce4a2eafc7a12efdfe33e9a643ef33d26a2","last_reissued_at":"2026-07-05T05:34:02.595475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:02.595475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-IID Quantum Federated Learning with One-shot Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Haimeng Zhao","submitted_at":"2022-09-02T00:38:44Z","abstract_excerpt":"Federated learning refers to the task of machine learning based on decentralized data from multiple clients with secured data privacy. Recent studies show that quantum algorithms can be exploited to boost its performance. However, when the clients' data are not independent and identically distributed (IID), the performance of conventional federated algorithms is known to deteriorate. In this work, we explore the non-IID issue in quantum federated learning with both theoretical and numerical analysis. We further prove that a global quantum channel can be exactly decomposed into local channels t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.00768","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/2209.00768/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":"2209.00768","created_at":"2026-07-05T05:34:02.595542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.00768v2","created_at":"2026-07-05T05:34:02.595542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.00768","created_at":"2026-07-05T05:34:02.595542+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPNWTBKTPNIH","created_at":"2026-07-05T05:34:02.595542+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPNWTBKTPNIHSVTQ","created_at":"2026-07-05T05:34:02.595542+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPNWTBKT","created_at":"2026-07-05T05:34:02.595542+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18656","citing_title":"LLM-QFL: Distilling Large Language Model for Quantum Federated Learning","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FPNWTBKTPNIHSVTQGI4N73DM4S","json":"https://pith.science/pith/FPNWTBKTPNIHSVTQGI4N73DM4S.json","graph_json":"https://pith.science/api/pith-number/FPNWTBKTPNIHSVTQGI4N73DM4S/graph.json","events_json":"https://pith.science/api/pith-number/FPNWTBKTPNIHSVTQGI4N73DM4S/events.json","paper":"https://pith.science/paper/FPNWTBKT"},"agent_actions":{"view_html":"https://pith.science/pith/FPNWTBKTPNIHSVTQGI4N73DM4S","download_json":"https://pith.science/pith/FPNWTBKTPNIHSVTQGI4N73DM4S.json","view_paper":"https://pith.science/paper/FPNWTBKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.00768&json=true","fetch_graph":"https://pith.science/api/pith-number/FPNWTBKTPNIHSVTQGI4N73DM4S/graph.json","fetch_events":"https://pith.science/api/pith-number/FPNWTBKTPNIHSVTQGI4N73DM4S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPNWTBKTPNIHSVTQGI4N73DM4S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPNWTBKTPNIHSVTQGI4N73DM4S/action/storage_attestation","attest_author":"https://pith.science/pith/FPNWTBKTPNIHSVTQGI4N73DM4S/action/author_attestation","sign_citation":"https://pith.science/pith/FPNWTBKTPNIHSVTQGI4N73DM4S/action/citation_signature","submit_replication":"https://pith.science/pith/FPNWTBKTPNIHSVTQGI4N73DM4S/action/replication_record"}},"created_at":"2026-07-05T05:34:02.595542+00:00","updated_at":"2026-07-05T05:34:02.595542+00:00"}