The Generation Cost of Bipartite Quantum States under LOCC
Zhaohui Wei, Zhangqi Yin

TL;DR
This paper characterizes the minimal quantum communication cost to generate bipartite states under LOCC, showing it equals the logarithm of the state's Schmidt number, and compares it with classical-communication-restricted schemes.
Contribution
It provides a complete characterization of the generation cost for bipartite states under LOCC, linking it to the Schmidt number, and analyzes the role of classical communication.
Findings
Generation cost equals the logarithm of the Schmidt number.
Classical communication can sometimes be completely unhelpful.
Comparison between LOCC and classical-only schemes reveals the role of classical communication.
Abstract
We consider a realistic setting of quantum tasks that generate shared bipartite quantum states. Suppose \alice and \bob are located at different places and need to produce a target shared quantum state . In order to save quantum communication, they can choose to share a proper smaller quantum state first, and then turn to by performing only local quantum operations and classical communications (LOCC). We hope is the optimal such that the quantum communication needed is as little as possible, which is called the generation cost of . In this paper, for an arbitrary bipartite , we characterize its generation cost completely by proving that it is exactly equivalent to the logarithm of the Schmidt number of . Similar quantum schemes where classical communication is not allowed have actually been considered. By comparing the two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
