{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:J2MJYYD6WCNMYJKTNUSD6QP35K","short_pith_number":"pith:J2MJYYD6","schema_version":"1.0","canonical_sha256":"4e989c607eb09acc25536d243f41fbea8d7b2e38de0e9a5b2c611431743bc031","source":{"kind":"arxiv","id":"2002.06840","version":3},"attestation_state":"computed","paper":{"title":"Communication Cost of Quantum Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giulio Chiribella, Masahito Hayashi, Yuxiang Yang","submitted_at":"2020-02-17T08:51:42Z","abstract_excerpt":"A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. Here we extend this problem to the quantum domain, analyzing the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client from a parametric family of quantum processes. We derive a general lower bound on the communication cost, establishing a relation with the precision lim"},"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":"2002.06840","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-02-17T08:51:42Z","cross_cats_sorted":[],"title_canon_sha256":"981620ceb4f0ffec1de47f15048515da7815716a6ca9d1e9fc15d0a68243cc47","abstract_canon_sha256":"789033f615e8d62f6c8d7e33a815153301a08848afc07271e7b7af29e32306f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:46:00.234039Z","signature_b64":"JqTlcVEbcoffvbR4rlWtu/k4mibDIa6RKFd59K1aCSUhyfczoqW0CIZxeiCgxXKfFPpKSSHZo8TZM1QwPnTaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e989c607eb09acc25536d243f41fbea8d7b2e38de0e9a5b2c611431743bc031","last_reissued_at":"2026-07-05T01:46:00.233559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:46:00.233559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Cost of Quantum Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giulio Chiribella, Masahito Hayashi, Yuxiang Yang","submitted_at":"2020-02-17T08:51:42Z","abstract_excerpt":"A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. Here we extend this problem to the quantum domain, analyzing the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client from a parametric family of quantum processes. We derive a general lower bound on the communication cost, establishing a relation with the precision lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.06840","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.06840/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":"2002.06840","created_at":"2026-07-05T01:46:00.233613+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.06840v3","created_at":"2026-07-05T01:46:00.233613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.06840","created_at":"2026-07-05T01:46:00.233613+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2MJYYD6WCNM","created_at":"2026-07-05T01:46:00.233613+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2MJYYD6WCNMYJKT","created_at":"2026-07-05T01:46:00.233613+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2MJYYD6","created_at":"2026-07-05T01:46:00.233613+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/J2MJYYD6WCNMYJKTNUSD6QP35K","json":"https://pith.science/pith/J2MJYYD6WCNMYJKTNUSD6QP35K.json","graph_json":"https://pith.science/api/pith-number/J2MJYYD6WCNMYJKTNUSD6QP35K/graph.json","events_json":"https://pith.science/api/pith-number/J2MJYYD6WCNMYJKTNUSD6QP35K/events.json","paper":"https://pith.science/paper/J2MJYYD6"},"agent_actions":{"view_html":"https://pith.science/pith/J2MJYYD6WCNMYJKTNUSD6QP35K","download_json":"https://pith.science/pith/J2MJYYD6WCNMYJKTNUSD6QP35K.json","view_paper":"https://pith.science/paper/J2MJYYD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.06840&json=true","fetch_graph":"https://pith.science/api/pith-number/J2MJYYD6WCNMYJKTNUSD6QP35K/graph.json","fetch_events":"https://pith.science/api/pith-number/J2MJYYD6WCNMYJKTNUSD6QP35K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2MJYYD6WCNMYJKTNUSD6QP35K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2MJYYD6WCNMYJKTNUSD6QP35K/action/storage_attestation","attest_author":"https://pith.science/pith/J2MJYYD6WCNMYJKTNUSD6QP35K/action/author_attestation","sign_citation":"https://pith.science/pith/J2MJYYD6WCNMYJKTNUSD6QP35K/action/citation_signature","submit_replication":"https://pith.science/pith/J2MJYYD6WCNMYJKTNUSD6QP35K/action/replication_record"}},"created_at":"2026-07-05T01:46:00.233613+00:00","updated_at":"2026-07-05T01:46:00.233613+00:00"}