Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:1608.07461

Help | Advanced Search

Quantum Physics

arXiv:1608.07461 (quant-ph)
[Submitted on 26 Aug 2016 (v1) , last revised 29 Oct 2018 (this version, v2)]

Title: A Four-Round LOCC Protocol Outperforms All Two-Round Protocols in Reducing the Entanglement Cost for A Distributed Quantum Information Processing

Title: 一个四轮LOCC协议在减少分布式量子信息处理的纠缠成本方面优于所有两轮协议

Authors:Eyuri Wakakuwa, Akihito Soeda, Mio Murao
Abstract: 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 the unitary by any two-round protocol, whereas the entanglement cost by a four-round protocol is strictly smaller than one ebit per pair.
Abstract: 我们证明了,在两个远程参与方通过局域操作和经典通信(LOCC)完成双向量子信息任务时,纠缠代价与通信轮次数之间存在权衡关系。 我们在渐近无穷多输入对且误差趋于零的信息理论场景下,考虑了一类两比特受控幺正门的LOCC实现,其中借助共享纠缠辅助实现。 我们通过证明以下内容来证明这种权衡关系:对于任意两轮协议,每对输入需要消耗一比特纠缠才能实现该幺正操作;而对于四轮协议,每对输入的纠缠代价严格小于一比特。
Comments: Superseded by improved results in arXiv:1810.08447
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:1608.07461 [quant-ph]
  (or arXiv:1608.07461v2 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.1608.07461
arXiv-issued DOI via DataCite

Submission history

From: Eyuri Wakakuwa [view email]
[v1] Fri, 26 Aug 2016 13:51:44 UTC (13 KB)
[v2] Mon, 29 Oct 2018 06:39:30 UTC (13 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2016-08

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号