{"paper":{"title":"Universal entanglement concentration","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Keiji Matsumoto, Masahito Hayashi","submitted_at":"2005-09-21T07:12:45Z","abstract_excerpt":"We propose a new protocol of \\textit{universal} entanglement concentration, which converts many copies of an \\textit{unknown} pure state to an \\textit{% exact} maximally entangled state. The yield of the protocol, which is outputted as a classical information, is probabilistic, and achives the entropy rate with high probability, just as non-universal entanglement concentration protocols do.\n  Our protocol is optimal among all similar protocols in terms of wide varieties of measures either up to higher orders or non-asymptotically, depending on the choice of the measure. The key of the proof of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509140","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"}