{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZCQXENROJPEJDOYNB25EYK2IP5","short_pith_number":"pith:ZCQXENRO","schema_version":"1.0","canonical_sha256":"c8a172362e4bc891bb0d0eba4c2b487f7c56388051d0ce8cbba743610b79d45e","source":{"kind":"arxiv","id":"2512.10465","version":4},"attestation_state":"computed","paper":{"title":"Optimal Distributed Similarity Estimation of Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Congcong Zheng, Kun Wang, Ping Xu, Xutao Yu, Zaichen Zhang","submitted_at":"2025-12-11T09:40:31Z","abstract_excerpt":"As quantum processors are deployed across different hardware platforms and remote cloud laboratories, a basic physical question is whether two black-box devices realize the same quantum process, without relying on a trusted classical description. We formulate the core primitive for this comparison task as \\emph{distributed similarity estimation of quantum channels} (DSEC): given local access to two unknown channels, estimate the normalized inner product of their Choi states. We prove that the optimal query complexity of DSEC is $\\Theta(\\max\\{\\sqrt{d}/\\varepsilon,1/\\varepsilon^2\\})$, where $d$ "},"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":"2512.10465","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-11T09:40:31Z","cross_cats_sorted":[],"title_canon_sha256":"4373585e3d483aa043a3250b617f018f65b51000e908ad2120be4aa362c7af7a","abstract_canon_sha256":"9004b388add4f990bf232d5532e226535def356704936f18ec0428ba3a53dfd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:08.238327Z","signature_b64":"7HSVuo6G5iWCah3LbzkmzVw/CfW/PA1bkmT5t4/zZcO4aVcz7Cs+nokUnMfPI2RjmPJ1O4pW4L1YSRzjr9ZvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8a172362e4bc891bb0d0eba4c2b487f7c56388051d0ce8cbba743610b79d45e","last_reissued_at":"2026-06-03T01:05:08.237777Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:08.237777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Distributed Similarity Estimation of Quantum Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Congcong Zheng, Kun Wang, Ping Xu, Xutao Yu, Zaichen Zhang","submitted_at":"2025-12-11T09:40:31Z","abstract_excerpt":"As quantum processors are deployed across different hardware platforms and remote cloud laboratories, a basic physical question is whether two black-box devices realize the same quantum process, without relying on a trusted classical description. We formulate the core primitive for this comparison task as \\emph{distributed similarity estimation of quantum channels} (DSEC): given local access to two unknown channels, estimate the normalized inner product of their Choi states. We prove that the optimal query complexity of DSEC is $\\Theta(\\max\\{\\sqrt{d}/\\varepsilon,1/\\varepsilon^2\\})$, where $d$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.10465","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.10465/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":"2512.10465","created_at":"2026-06-03T01:05:08.237845+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.10465v4","created_at":"2026-06-03T01:05:08.237845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.10465","created_at":"2026-06-03T01:05:08.237845+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCQXENROJPEJ","created_at":"2026-06-03T01:05:08.237845+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCQXENROJPEJDOYN","created_at":"2026-06-03T01:05:08.237845+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCQXENRO","created_at":"2026-06-03T01:05:08.237845+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14256","citing_title":"Worst-Case Sample Complexity Bounds for Distributed Inner Product Estimation with Local Randomized Measurements","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCQXENROJPEJDOYNB25EYK2IP5","json":"https://pith.science/pith/ZCQXENROJPEJDOYNB25EYK2IP5.json","graph_json":"https://pith.science/api/pith-number/ZCQXENROJPEJDOYNB25EYK2IP5/graph.json","events_json":"https://pith.science/api/pith-number/ZCQXENROJPEJDOYNB25EYK2IP5/events.json","paper":"https://pith.science/paper/ZCQXENRO"},"agent_actions":{"view_html":"https://pith.science/pith/ZCQXENROJPEJDOYNB25EYK2IP5","download_json":"https://pith.science/pith/ZCQXENROJPEJDOYNB25EYK2IP5.json","view_paper":"https://pith.science/paper/ZCQXENRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.10465&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCQXENROJPEJDOYNB25EYK2IP5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCQXENROJPEJDOYNB25EYK2IP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCQXENROJPEJDOYNB25EYK2IP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCQXENROJPEJDOYNB25EYK2IP5/action/storage_attestation","attest_author":"https://pith.science/pith/ZCQXENROJPEJDOYNB25EYK2IP5/action/author_attestation","sign_citation":"https://pith.science/pith/ZCQXENROJPEJDOYNB25EYK2IP5/action/citation_signature","submit_replication":"https://pith.science/pith/ZCQXENROJPEJDOYNB25EYK2IP5/action/replication_record"}},"created_at":"2026-06-03T01:05:08.237845+00:00","updated_at":"2026-06-03T01:05:08.237845+00:00"}