English
Related papers

Related papers: Complexity of causal order structure in distribute…

200 papers

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…

Quantum Physics · Physics 2018-10-30 Eyuri Wakakuwa , Akihito Soeda , Mio Murao

In this thesis, we investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC). In the first part, we analyze implementable computation over a given quantum network resource by…

Quantum Physics · Physics 2022-02-15 Seiseki Akibue

We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic…

Quantum Physics · Physics 2018-03-26 Eyuri Wakakuwa , Akihito Soeda , Mio Murao

We investigate the minimum entanglement cost of the deterministic implementation of two-qubit controlled-unitary operations using local operations and classical communication (LOCC). We show that any such operation can be implemented by a…

Quantum Physics · Physics 2011-10-28 Akihito Soeda , Peter S. Turner , Mio Murao

Quantum mechanics allows operations to be in indefinite causal order. Recently there have been active discussions on enhanced communication strategies through exotic causal structures. In light of this, through the process matrix formalism,…

Quantum Physics · Physics 2021-04-21 Kaumudibikash Goswami , Fabio Costa

We consider a quantum and classical version multi-party function computation problem with $n$ players, where players $2, \dots, n$ need to communicate appropriate information to player 1, so that a "generalized" inner product function with…

Quantum Physics · Physics 2024-02-06 Ruoyu Meng , Aditya Ramamoorthy

Two dual questions in quantum information theory are to determine the communication cost of simulating a bipartite unitary gate, and to determine their communication capacities. We present a bipartite unitary gate with two surprising…

Quantum Physics · Physics 2011-08-04 Aram W. Harrow , Debbie W. Leung

We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used…

Quantum Physics · Physics 2007-05-23 Harry Buhrman , Richard Cleve , Wim van Dam

We study the advantages of quantum communication models over classical communication models that are equipped with a limited number of qubits of entanglement. In this direction, we give explicit partial functions on $n$ bits for which…

Quantum Physics · Physics 2025-12-02 Srinivasan Arunachalam , Uma Girish

A nonlocal bipartite unitary gate can sometimes be implemented using prior entanglement and only one round of classical communication in which the two parties send messages to each other simultaneously. This cuts the classical communication…

Quantum Physics · Physics 2013-03-13 Li Yu

A unitary interaction coupling two parties enables quantum communication in both the forward and backward directions. Each communication capacity can be thought of as a tradeoff between the achievable rates of specific types of forward and…

Quantum Physics · Physics 2007-05-23 Aram W. Harrow , Debbie W. Leung

We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical…

Quantum Physics · Physics 2014-07-21 Eyuri Wakakuwa , Mio Murao

Encoding and decoding quantum information in a multipartite quantum system are indispensable for quantum error correction and also play crucial roles in multiparty tasks in distributed quantum information processing such as quantum secret…

Quantum Physics · Physics 2019-04-03 Hayata Yamasaki , Mio Murao

A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how…

Quantum Physics · Physics 2023-09-13 Guangkuo Liu , Ian George , Eric Chitambar

We show that the ability to create entanglement is necessary for execution of bipartite quantum gates even when they are applied to unentangled states and create no entanglement. Starting with a simple example we demonstrate that to execute…

Quantum Physics · Physics 2011-01-12 Aharon Brodutch , Daniel R. Terno

Recently, several similar protocols[J. Opt. B 4 (2002) 380; Phys. Lett. A 316 (2003) 159; Phys. Lett. A 355 (2006) 285; Phys. Lett. A 336 (2005) 317] for remotely preparing a class of multi-qubit states (i.e, $\alpha|0 ... 0>+\beta|1...…

Quantum Physics · Physics 2007-08-21 Zhan-jun Zhang

Entanglement bits or ``ebits'' have been proposed as a quantitative measure of a fundamental resource in quantum information processing. For such an interpretation to be valid, it is important to show that the same number of ebits in…

Quantum Physics · Physics 2009-10-31 Hoi-Kwong Lo , Sandu Popescu

A natural operational paradigm for distributed quantum and classical information processing involves local operations coordinated by multiple rounds of public communication. In this paper we consider the minimum number of communication…

Quantum Physics · Physics 2018-02-07 Eric Chitambar , Min-Hsiu Hsieh

It is known that any bipartite unitary operator of Schmidt rank three is equivalent to a controlled unitary under local unitaries. We propose a standard form of such operators. Using the form we improve the upper bound for the entanglement…

Quantum Physics · Physics 2016-04-22 Lin Chen , Li Yu

In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by…

‹ Prev 1 2 3 10 Next ›