English
Related papers

Related papers: Communication cost of classically simulating a qua…

200 papers

The process of state preparation, its transmission and subsequent measurement can be classically simulated through the communication of some amount of classical information. Recently, we proved that the minimal communication cost is the…

Quantum Physics · Physics 2014-01-17 Alberto Montina , Stefan Wolf

The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating a process of state preparation, transmission through the channel and subsequent measurement. It…

Quantum Physics · Physics 2012-09-14 Alberto Montina

We study the prepare-and-measure scenario in which Alice transmits a quantum system to Bob, who then performs a quantum measurement. The quantum state of the system is unknown to Bob, and the measurement is unknown to Alice. It has recently…

Quantum Physics · Physics 2026-03-03 Sebastian Schlösser , Matthias Kleinmann

We analyze the amount of classical communication required to reproduce the statistics of local projective measurements on a general pair of entangled qubits, $|\Psi_{AB}>=\sqrt{p}\ |00>+\sqrt{1-p}\ |11>$ (with $1/2\leq p \leq 1$). We…

Quantum Physics · Physics 2023-10-25 Martin J. Renner , Marco Túlio Quintino

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 consider the process consisting of preparation, transmission through a quantum channel, and subsequent measurement of quantum states. The communication complexity of the channel is the minimal amount of classical communication required…

Quantum Physics · Physics 2014-11-21 Alberto Montina , Stefan Wolf

A two-party quantum communication process with classical inputs and outcomes can be simulated by replacing the quantum channel with a classical one. The minimal amount of classical communication required to reproduce the statistics of the…

Quantum Physics · Physics 2016-04-20 A. Hansen , A. Montina , S. Wolf

We study the amount of classical communication needed for distributed quantum information processing. In particular, we introduce the concept of "remote preparation" of a quantum state. Given an ensemble of states, Alice's task is to help…

Quantum Physics · Physics 2009-10-31 Hoi-Kwong Lo

We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…

Quantum Physics · Physics 2019-07-03 Ashley Montanaro

A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired…

Quantum Physics · Physics 2020-10-27 Yuxiang Yang , Giulio Chiribella , Masahito Hayashi

The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum…

Quantum Physics · Physics 2013-12-24 A. Montina , M. Pfaffhauser , S. Wolf

A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the…

Quantum Physics · Physics 2022-03-29 Brian Doolittle , Eric Chitambar

The most trivial way to simulate classically the communication of a quantum state is to transmit the classical description of the quantum state itself. However, this requires an infinite amount of classical communication if the simulation…

Quantum Physics · Physics 2014-01-07 Alberto Montina

We consider the problem of the classical simulation of quantum measurements in the scenario of communication complexity. Regev and Toner (2007) have presented a 2-bit protocol which simulates one particular correlation function arising from…

Quantum Physics · Physics 2013-10-09 Adrian Kosowski , Marcin Markiewicz

Suppose Alice and Bob share a maximally entangled state of any finite dimension and each perform two-outcome measurements on the respective part of the state. It is known, due to the recent result of Regev and Toner, that if a classical…

Quantum Physics · Physics 2015-05-13 T. Vértesi , E. Bene

We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result of our simulation, we show that if the quantum k-party communication complexity of a…

Quantum Physics · Physics 2007-05-23 Iordanis Kerenidis

We investigate the amount of communication that must augment classical local hidden variable models in order to simulate the behaviour of entangled quantum systems. We consider the scenario where a bipartite measurement is given from a set…

Quantum Physics · Physics 2009-10-31 Gilles Brassard , Richard Cleve , Alain Tapp

We study quantum communication protocols, in which the players' storage starts out in a state where one qubit is in a pure state, and all other qubits are totally mixed (i.e. in a random state), and no other storage is available (for…

Quantum Physics · Physics 2020-01-01 Hartmut Klauck , Debbie Lim

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 classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over…

Computational Complexity · Computer Science 2023-12-29 Aleksandrs Belovs , Arturo Castellanos , François Le Gall , Guillaume Malod , Alexander A. Sherstov
‹ Prev 1 2 3 10 Next ›