{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DORNK3VMGUVGQP76CGKWFNAIRU","short_pith_number":"pith:DORNK3VM","schema_version":"1.0","canonical_sha256":"1ba2d56eac352a683ffe119562b4088d12dca05345f95644828ef79f5bc04651","source":{"kind":"arxiv","id":"1507.05260","version":4},"attestation_state":"computed","paper":{"title":"Entanglement cost and entangling power of bipartite unitary and permutation operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lin Chen, Li Yu","submitted_at":"2015-07-19T08:10:14Z","abstract_excerpt":"It is known that any bipartite unitary operator of Schmidt rank three is equivalent to a controlled unitary under local unitaries. We propose a standard form of such operators. Using the form we improve the upper bound for the entanglement cost to implement such operators under local operations and classical communications (LOCC), and provide a corresponding protocol. A part of our protocol is based on a recursive-control protocol which is helpful for implementing other unitary operators. We show that any bipartite permutation unitary of Schmidt rank three can be implemented using LOCC and two"},"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":"1507.05260","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-07-19T08:10:14Z","cross_cats_sorted":[],"title_canon_sha256":"8d52c260222c6c3e69abebb5309a6ceb9972572ea4efdd1a8911f0801df7823b","abstract_canon_sha256":"95909e2169bb7d2aba62932f289e384fbe6cd582c623b89a59f62edb6e08ce47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:33.343587Z","signature_b64":"EcGV6eZa8FXBsJt8MWVEnk+C2E5SKoGgqeAi39YdDqynY/RbNJ+oWCxJbgdXfGdxW1UFKY4O3gopxjev4jpbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba2d56eac352a683ffe119562b4088d12dca05345f95644828ef79f5bc04651","last_reissued_at":"2026-05-18T01:16:33.342830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:33.342830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entanglement cost and entangling power of bipartite unitary and permutation operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lin Chen, Li Yu","submitted_at":"2015-07-19T08:10:14Z","abstract_excerpt":"It is known that any bipartite unitary operator of Schmidt rank three is equivalent to a controlled unitary under local unitaries. We propose a standard form of such operators. Using the form we improve the upper bound for the entanglement cost to implement such operators under local operations and classical communications (LOCC), and provide a corresponding protocol. A part of our protocol is based on a recursive-control protocol which is helpful for implementing other unitary operators. We show that any bipartite permutation unitary of Schmidt rank three can be implemented using LOCC and two"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05260","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":""},"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":"1507.05260","created_at":"2026-05-18T01:16:33.342935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05260v4","created_at":"2026-05-18T01:16:33.342935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05260","created_at":"2026-05-18T01:16:33.342935+00:00"},{"alias_kind":"pith_short_12","alias_value":"DORNK3VMGUVG","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DORNK3VMGUVGQP76","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DORNK3VM","created_at":"2026-05-18T12:29:17.054201+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/DORNK3VMGUVGQP76CGKWFNAIRU","json":"https://pith.science/pith/DORNK3VMGUVGQP76CGKWFNAIRU.json","graph_json":"https://pith.science/api/pith-number/DORNK3VMGUVGQP76CGKWFNAIRU/graph.json","events_json":"https://pith.science/api/pith-number/DORNK3VMGUVGQP76CGKWFNAIRU/events.json","paper":"https://pith.science/paper/DORNK3VM"},"agent_actions":{"view_html":"https://pith.science/pith/DORNK3VMGUVGQP76CGKWFNAIRU","download_json":"https://pith.science/pith/DORNK3VMGUVGQP76CGKWFNAIRU.json","view_paper":"https://pith.science/paper/DORNK3VM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05260&json=true","fetch_graph":"https://pith.science/api/pith-number/DORNK3VMGUVGQP76CGKWFNAIRU/graph.json","fetch_events":"https://pith.science/api/pith-number/DORNK3VMGUVGQP76CGKWFNAIRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DORNK3VMGUVGQP76CGKWFNAIRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DORNK3VMGUVGQP76CGKWFNAIRU/action/storage_attestation","attest_author":"https://pith.science/pith/DORNK3VMGUVGQP76CGKWFNAIRU/action/author_attestation","sign_citation":"https://pith.science/pith/DORNK3VMGUVGQP76CGKWFNAIRU/action/citation_signature","submit_replication":"https://pith.science/pith/DORNK3VMGUVGQP76CGKWFNAIRU/action/replication_record"}},"created_at":"2026-05-18T01:16:33.342935+00:00","updated_at":"2026-05-18T01:16:33.342935+00:00"}