{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FZ2Q4KCPA4E7I2E34TXNRNVH7T","short_pith_number":"pith:FZ2Q4KCP","canonical_record":{"source":{"id":"1608.07461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-26T13:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"746f6bccecb6e6adda74bce6390eefdbeb6acda9f9c6ce19ffb7bbe31f1b18b3","abstract_canon_sha256":"915a8f45a9ebba05759ccff4d10744af2688214205f015dc547369999676cc48"},"schema_version":"1.0"},"canonical_sha256":"2e750e284f0709f4689be4eed8b6a7fcf933b135cd8cdc84950c0ac0e4293e50","source":{"kind":"arxiv","id":"1608.07461","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07461","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07461v2","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07461","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"FZ2Q4KCPA4E7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FZ2Q4KCPA4E7I2E3","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FZ2Q4KCP","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FZ2Q4KCPA4E7I2E34TXNRNVH7T","target":"record","payload":{"canonical_record":{"source":{"id":"1608.07461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-26T13:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"746f6bccecb6e6adda74bce6390eefdbeb6acda9f9c6ce19ffb7bbe31f1b18b3","abstract_canon_sha256":"915a8f45a9ebba05759ccff4d10744af2688214205f015dc547369999676cc48"},"schema_version":"1.0"},"canonical_sha256":"2e750e284f0709f4689be4eed8b6a7fcf933b135cd8cdc84950c0ac0e4293e50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:13.789330Z","signature_b64":"bOMJ7M3X317vvmc9/m1gBua9HTR/7mX0Cg7pW/Hy4oGIA5BcgOLOA8lF4pLk+OCXu0GhoSmPf0coBpn2nF58Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e750e284f0709f4689be4eed8b6a7fcf933b135cd8cdc84950c0ac0e4293e50","last_reissued_at":"2026-05-18T00:02:13.788755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:13.788755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.07461","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cPXpeir1hjxlMVVwuVTyo5jEzl2q0Vssff2d8HPp2pXxIHfPs85dK6MAY3sIYTUdZBPwpwmQNMghTTPNyqKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:16:31.516031Z"},"content_sha256":"b29f3eabfcc2e9d6c2179a8af75db64fe51f91d43e30f3ace58671f8198d5224","schema_version":"1.0","event_id":"sha256:b29f3eabfcc2e9d6c2179a8af75db64fe51f91d43e30f3ace58671f8198d5224"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FZ2Q4KCPA4E7I2E34TXNRNVH7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Four-Round LOCC Protocol Outperforms All Two-Round Protocols in Reducing the Entanglement Cost for A Distributed Quantum Information Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akihito Soeda, Eyuri Wakakuwa, Mio Murao","submitted_at":"2016-08-26T13:51:44Z","abstract_excerpt":"We prove that there is a trade-off relation between the entanglement cost and the number of rounds of communication, for two distant parties to accomplish a bidirectional quantum information task by local operations and classical communication (LOCC). We consider an implementation of a class of two-qubit controlled-unitary gate by LOCC assisted by shared entanglement, in an information theoretical scenario of asymptotically many input pairs and vanishingly small error. We prove the trade-off relation by showing that one ebit of entanglement per pair is necessary to be consumed for implementing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07461","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDpc7xl+FhZeKhu/lI6LHWPzn7uI2cYMvMy3YUvS9Zl4xHn6/TP4aP5EO5CenENkq7PAZujrfOacAnDGIv4tAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:16:31.516855Z"},"content_sha256":"4339296a35b212b3a502e82b6c729f183d30f2996767cc8e173fcc514cb01fe7","schema_version":"1.0","event_id":"sha256:4339296a35b212b3a502e82b6c729f183d30f2996767cc8e173fcc514cb01fe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZ2Q4KCPA4E7I2E34TXNRNVH7T/bundle.json","state_url":"https://pith.science/pith/FZ2Q4KCPA4E7I2E34TXNRNVH7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZ2Q4KCPA4E7I2E34TXNRNVH7T/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T15:16:31Z","links":{"resolver":"https://pith.science/pith/FZ2Q4KCPA4E7I2E34TXNRNVH7T","bundle":"https://pith.science/pith/FZ2Q4KCPA4E7I2E34TXNRNVH7T/bundle.json","state":"https://pith.science/pith/FZ2Q4KCPA4E7I2E34TXNRNVH7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZ2Q4KCPA4E7I2E34TXNRNVH7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FZ2Q4KCPA4E7I2E34TXNRNVH7T","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"915a8f45a9ebba05759ccff4d10744af2688214205f015dc547369999676cc48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-26T13:51:44Z","title_canon_sha256":"746f6bccecb6e6adda74bce6390eefdbeb6acda9f9c6ce19ffb7bbe31f1b18b3"},"schema_version":"1.0","source":{"id":"1608.07461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07461","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07461v2","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07461","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"FZ2Q4KCPA4E7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FZ2Q4KCPA4E7I2E3","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FZ2Q4KCP","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:4339296a35b212b3a502e82b6c729f183d30f2996767cc8e173fcc514cb01fe7","target":"graph","created_at":"2026-05-18T00:02:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We prove that there is a trade-off relation between the entanglement cost and the number of rounds of communication, for two distant parties to accomplish a bidirectional quantum information task by local operations and classical communication (LOCC). We consider an implementation of a class of two-qubit controlled-unitary gate by LOCC assisted by shared entanglement, in an information theoretical scenario of asymptotically many input pairs and vanishingly small error. We prove the trade-off relation by showing that one ebit of entanglement per pair is necessary to be consumed for implementing","authors_text":"Akihito Soeda, Eyuri Wakakuwa, Mio Murao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-26T13:51:44Z","title":"A Four-Round LOCC Protocol Outperforms All Two-Round Protocols in Reducing the Entanglement Cost for A Distributed Quantum Information Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07461","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b29f3eabfcc2e9d6c2179a8af75db64fe51f91d43e30f3ace58671f8198d5224","target":"record","created_at":"2026-05-18T00:02:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"915a8f45a9ebba05759ccff4d10744af2688214205f015dc547369999676cc48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-26T13:51:44Z","title_canon_sha256":"746f6bccecb6e6adda74bce6390eefdbeb6acda9f9c6ce19ffb7bbe31f1b18b3"},"schema_version":"1.0","source":{"id":"1608.07461","kind":"arxiv","version":2}},"canonical_sha256":"2e750e284f0709f4689be4eed8b6a7fcf933b135cd8cdc84950c0ac0e4293e50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e750e284f0709f4689be4eed8b6a7fcf933b135cd8cdc84950c0ac0e4293e50","first_computed_at":"2026-05-18T00:02:13.788755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:13.788755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bOMJ7M3X317vvmc9/m1gBua9HTR/7mX0Cg7pW/Hy4oGIA5BcgOLOA8lF4pLk+OCXu0GhoSmPf0coBpn2nF58Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:13.789330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b29f3eabfcc2e9d6c2179a8af75db64fe51f91d43e30f3ace58671f8198d5224","sha256:4339296a35b212b3a502e82b6c729f183d30f2996767cc8e173fcc514cb01fe7"],"state_sha256":"d8317c73f04cc5e97151a28c52e78b6b325733d9d30722b5b223894d8d805fe1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVnTI9Ch/oFOKfSsjryDJCNOrEmpzAFvBJCSfu8obJ6dIs7VFfQK/Qbz9G41c1suC7deybnoRcaJ66vqmNAaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:16:31.521880Z","bundle_sha256":"87bc4acb6428b99c0b7fdbbba3533d42b0389bd78330f3f62914973b6fdb1d97"}}