Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 71 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 467 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

The Generation Cost of Bipartite Quantum States under LOCC (1412.0449v2)

Published 1 Dec 2014 in quant-ph, cs.CC, cs.IT, and math.IT

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 $\rho$. In order to save quantum communication, they can choose to share a proper smaller quantum state $\sigma$ first, and then turn $\sigma$ to $\rho$ by performing only local quantum operations and classical communications (LOCC). We hope $\sigma$ is the optimal such that the quantum communication needed is as little as possible, which is called the generation cost of $\rho$. In this paper, for an arbitrary bipartite $\rho$, we characterize its generation cost completely by proving that it is exactly equivalent to the logarithm of the Schmidt number of $\rho$. Similar quantum schemes where classical communication is not allowed have actually been considered. By comparing the two settings, we are able to look into the role that classical communication plays in these fundamental tasks, where we exhibit some instances in which classical communication is not helpful completely.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Authors (2)