English
Related papers

Related papers: Fast protocols for local implementation of biparti…

200 papers

Non-local quantum computation (NLQC) replaces a local interaction between two systems with a single round of communication and shared entanglement. Despite many partial results, it is known that a characterization of entanglement cost in at…

Quantum Physics · Physics 2025-06-02 Andreas Bluhm , Simon Höfer , Alex May , Mikka Stasiuk , Philip Verduyn Lunel , Henry Yuen

Entanglement is an useful resource because some global operations cannot be locally implemented using classical communication. We prove a number of results about what is and is not locally possible. We focus on orthogonal states, which can…

Quantum Physics · Physics 2009-11-07 Jonathan Walgate , Lucien Hardy

Entanglement is a central resource in quantum information science; therefore, it is important to design local discrimination protocols that minimize resource consumption. In this paper, we propose three entanglement-allocation schemes for…

Quantum Physics · Physics 2026-02-17 Qiqi Feng , Huaqi Zhou , Limin Gao

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

Sharing logical entangled pairs between distant quantum nodes is a key process to achieve fault tolerant quantum computation and communication. However, there is a gap between current experimental specifications and theoretical requirements…

If we want to transform the quantum state of a system to another using local measurement processes, what is the probability of success? This probability is bounded by quantifying entanglement in both the states. In this paper, we construct…

Quantum Physics · Physics 2026-03-18 Abhijit Gadde , Shraiyance Jain , Harshal Kulkarni

Proving achievability of protocols in quantum Shannon theory usually does not consider the efficiency at which the goal of the protocol can be achieved. Nevertheless it is known that protocols such as coherent state merging are efficiently…

Quantum Physics · Physics 2015-03-17 Christoph Hirche , Ciara Morgan

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

A set of all states of a bi-partite quantum system can be divided into subsets each of which contains states with the same degree of entanglement. In this paper we address a question whether local operations (without classical…

Quantum Physics · Physics 2007-07-31 Mario Ziman , Vladimir Buzek

In 1991, Asher Peres and William Wootters wrote a seminal paper on the nonlocal processing of quantum information [\textit{Phys. Rev. Lett.} \textbf{66} 1119 (1991)]. We return to their classic problem and solve it in various contexts.…

Quantum Physics · Physics 2014-05-14 Eric Chitambar , Min-Hsiu Hsieh

The necessary and sufficient conditions for the equivalence of arbitrary n-qubit pure quantum states under Local Unitary (LU) operations derived in [B. Kraus Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different…

Quantum Physics · Physics 2013-05-29 B. Kraus

We prove that the fidelity of two exemplary communication complexity protocols, allowing for an N-1 bit communication, can be exponentially improved by N-1 (unentangled) qubit communication. Taking into account, for a fair comparison, all…

We studied pure state transformations using local operations assisted by finitely many rounds of classical communication ($LOCC_{\mathbb{N}}$) in C. Spee, J.I. de Vicente, D. Sauerwein, B. Kraus, arXiv:1606.04418 (2016). Here, we first of…

Quantum Physics · Physics 2017-02-01 J. I. de Vicente , C. Spee , D. Sauerwein , B. Kraus

We consider one copy of a quantum system prepared with equal prior probability in one of two non-orthogonal entangled states of multipartite distributed among separated parties. We demonstrate that these two states can be optimally…

Quantum Physics · Physics 2013-05-29 Yi-Xin Chen , Dong Yang

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

In this paper, we investigate a coupled polar code architecture that supports both local and global decoding. This local-global construction is motivated by practical applications in data storage and transmission where reduced-latency…

Information Theory · Computer Science 2023-01-09 Ziyuan Zhu , Wei Wu , Paul H. Siegel

We study how two pieces of localized quantum information can be delocalized across a composite Hilbert space when a global unitary operation is applied. We classify the delocalization power of global unitary operations on quantum…

Quantum Physics · Physics 2010-06-09 Akihito Soeda , Mio Murao

The paper studies unambiguous discrimination of Fermionic states through local operations and classical communication (LOCC). In the task of unambiguous discrimination, no error is tolerated but an inconclusive result is allowed. We show…

Quantum Physics · Physics 2021-01-22 Matteo Lugli , Paolo Perinotti , Alessandro Tosini

We consider the implementation of an arbitrary unitary operation U upon a distant quantum system. This teleportation of U can be viewed as a quantum remote control. We investigate protocols which achieve this using local operations,…

Quantum Physics · Physics 2009-11-06 S. F. Huelga , J. A. Vaccaro , A. Chefles , M. B. Plenio

We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that reify semantic constraints between actions. Constraint types include…

Databases · Computer Science 2007-10-08 Pierre Sutra , Marc Shapiro , João Pedro Barreto