English
Related papers

Related papers: Inefficiency and classical communication bounds fo…

200 papers

We consider general prepare-and-measure scenarios in which Alice can transmit qubit states to Bob, who can perform general measurements in the form of positive operator-valued measures (POVMs). We show that the statistics obtained in any…

Quantum Physics · Physics 2023-03-29 Martin J. Renner , Armin Tavakoli , Marco Túlio Quintino

We study the activation of entanglement in teleportation protocols. To this end, we a present derivation of the average fidelity of teleportation process with noisy classical channel for qudits. In our work we do not make any assumptions…

Quantum Physics · Physics 2013-10-14 Ryszard Weinar , Wieslaw Laskowski , Marcin Pawlowski

I show that a simple multi-party communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency $\eta$. The task is a communication complexity problem in…

Quantum Physics · Physics 2009-11-07 Ernesto F. Galvao

We study partial coherence and its connections with entanglement. First, we provide a sufficient and necessary condition for bipartite pure state transformation under partial incoherent operations: A bipartite pure state can be transformed…

Quantum Physics · Physics 2023-07-17 Sunho Kim , Chunhe Xiong , Shunlong Luo , Asutosh Kumar , Junde Wu

The maximal amount of information which is reliably transmitted over two uses of general Pauli channels with memory is proven to be achieved by maximally entangled states beyond some memory threshold. In particular, this proves a conjecture…

Quantum Physics · Physics 2011-11-09 D. Daems

We show that any Bell local state, with a hidden nonlocality that can be revealed by local filtering, is more, or equally, entangled than nonlocal states. More precisely, it can be deterministically transformed into a nonlocal state, by…

Quantum Physics · Physics 2017-12-06 S. Camalet

Recent advances have led towards first prototypes of quantum networks in which entanglement is distributed by sources producing bipartite entangled states. This raises the question of which states can be generated in quantum networks based…

Quantum Physics · Physics 2024-03-14 Cornelia Spee , Tristan Kraft

In most communication scenarios, sending a symbol encoded in a quantum state requires spending resources such as energy, which can be quantified by a cost of communication. A standard approach in this context is to quantify the performance…

Quantum Physics · Physics 2017-10-09 Marcin Jarzyna

The efficient and reliable verification of quantum states plays a crucial role in various quantum information processing tasks. We consider the task of verifying entangled states using one-way and two-way classical communication and…

Quantum Physics · Physics 2019-12-09 Xiao-Dong Yu , Jiangwei Shang , Otfried Gühne

In this letter we show that communication when restricted to a single information carrier (i.e. single particle) and finite speed of propagation is fundamentally limited for classical systems. On the other hand, quantum systems can surpass…

Quantum Physics · Physics 2018-02-22 Flavio Del Santo , Borivoje Dakić

We exhibit a two-parameter family of bipartite mixed states $\rho_{bc}$, in a $d\otimes d$ Hilbert space, which are negative under partial transposition (NPT), but for which we conjecture that no maximally entangled pure states in $2\otimes…

Stochastic local operations and classical communication (SLOCC), also called local filtering operations, are a convenient, useful set of quantum operations in grasping essential properties of entanglement. We give a quick overview about the…

Quantum Physics · Physics 2007-05-23 Akimasa Miyake

We study exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we…

Quantum Physics · Physics 2018-08-17 Asger Kjærulff Jensen , Péter Vrana

We establish novel connections between magic in quantum circuits and communication complexity. In particular, we show that functions computable with low magic have low communication cost. Our first result shows that the $\mathsf{D}\|$…

Quantum Physics · Physics 2025-10-09 Uma Girish , Alex May , Natalie Parham , Henry Yuen

We derive an optimal bound for arbitrary entanglement manipulation based on the transmission of a pulse in coherent states over a lossy channel followed by local operations and unlimited classical communication (LOCC). This stands on a…

Quantum Physics · Physics 2015-05-30 Koji Azuma , Go Kato

Many quantum information tasks rely on entanglement, which is used as a resource, for example, to enable efficient and secure communication. Typically, noise, accompanied by loss of entanglement, reduces the efficiency of quantum protocols.…

Multipartite entanglement purification is revisited by using the Local operations and classical communications(LOCCs). We demonstrate our idea by considering the tripartite case, i.e. the purification of tripartite entanglement. We express…

Quantum Physics · Physics 2009-04-16 Ming Yang , Fei Yan , Zhuo-Liang Cao

We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…

Quantum Physics · Physics 2019-08-07 Xin Wang , Kun Fang , Marco Tomamichel

In this paper, we consider the problem of discriminating quantum states by local operations and classical communication (LOCC) when an arbitrarily small amount of error is permitted. This paradigm is known as asymptotic state…

Quantum Physics · Physics 2014-12-02 Eric Chitambar , Min-Hsiu Hsieh

Bell inequality violating entangled states are the working horse for many potential quantum information processing applications, including secret sharing, cryptographic key distribution and communication complexity reduction in distributed…

Quantum Physics · Physics 2012-12-12 Marcin Wiesniak