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:1812.00355

Help | Advanced Search

Quantum Physics

arXiv:1812.00355 (quant-ph)
[Submitted on 2 Dec 2018 (v1) , last revised 20 Jun 2019 (this version, v2)]

Title: Continuous-variable entanglement distillation over a pure loss channel with multiple quantum scissors

Title: 纯损耗信道上具有多个量子剪刀的连续变量纠缠浓缩

Authors:Kaushik P. Seshadreesan, Hari Krovi, Saikat Guha
Abstract: Entanglement distillation is a key primitive for distributing high-quality entanglement between remote locations. Probabilistic noiseless linear amplification based on the quantum scissors is a candidate for entanglement distillation from noisy continuous-variable (CV) entangled states. Being a non-Gaussian operation, quantum scissors is challenging to analyze. We present a derivation of the non-Gaussian state heralded by multiple quantum scissors in a pure loss channel with two-mode squeezed vacuum input. We choose the reverse coherent information (RCI)---a proven lower bound on the distillable entanglement of a quantum state under one-way local operations and classical communication (LOCC), as our figure of merit. We evaluate a Gaussian lower bound on the RCI of the heralded state. We show that it can exceed the unlimited two-way LOCCassisted direct transmission entanglement distillation capacity of the pure loss channel. The optimal heralded Gaussian RCI with two quantum scissors is found to be significantly more than that with a single quantum scissors, albeit at the cost of decreased success probability. Our results fortify the possibility of a quantum repeater scheme for CV quantum states using the quantum scissors.
Abstract: 纠缠浓缩是将高质量纠缠在远程位置之间分发的关键原语。 基于量子剪刀的概率无噪声线性放大是来自噪声连续变量(CV)纠缠态的纠缠浓缩的候选方案。 作为一种非高斯操作,量子剪刀难以分析。 我们推导了在具有双模压缩真空输入的纯损耗信道中,由多个量子剪刀所预告的非高斯态。 我们选择反向相干信息(RCI)——一种在单向局部操作和经典通信(LOCC)下量子态可浓缩纠缠的已证明下限——作为我们的性能指标。 我们评估了所预告态的RCI的高斯下限。 我们表明,它能够超过纯损耗信道中无限双向LOCC辅助直接传输纠缠浓缩容量。 发现使用两个量子剪刀的最优预告高斯RCI显著高于使用单个量子剪刀的情况,尽管成功概率有所降低。 我们的结果加强了使用量子剪刀对CV量子态进行量子中继方案的可能性。
Comments: accepted for publication in Physical Review A
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:1812.00355 [quant-ph]
  (or arXiv:1812.00355v2 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.1812.00355
arXiv-issued DOI via DataCite
Journal reference: Phys. Rev. A 100, 022315 (2019)
Related DOI: https://doi.org/10.1103/PhysRevA.100.022315
DOI(s) linking to related resources

Submission history

From: Kaushik Seshadreesan [view email]
[v1] Sun, 2 Dec 2018 08:39:12 UTC (2,362 KB)
[v2] Thu, 20 Jun 2019 14:50:11 UTC (2,597 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 | 2018-12

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号