English
Related papers

Related papers: Two-way communication with a single quantum partic…

200 papers

Communication complexity is the amount of communication needed to compute a function when the function inputs are distributed over multiple parties. In its simplest form, one-way communication complexity, Alice and Bob compute a function…

Computational Complexity · Computer Science 2023-05-24 Naresh Goud Boddu , Rahul Jain , Han-Hsuan Lin

The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized. Two main results are proved in detail. The…

Quantum Physics · Physics 2007-05-23 Jon Yard

This paper unifies the concepts of evolutionary games and quantum strategies. First, we state the formulation and properties of classical evolutionary strategies, with focus on the destinations of evolution in 2-player 2-strategy games. We…

Quantum Physics · Physics 2011-04-21 Ming Lam Leung

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

We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum…

Quantum Physics · Physics 2019-03-19 Anurag Anshu , Rahul Jain , Naqueeb Ahmad Warsi

Finding exponential separation between quantum and classical information tasks is like striking gold in quantum information research. Such an advantage is believed to hold for quantum computing but is proven for quantum communication…

A classical one-time pad allows two parties to send private messages over a public classical channel -- an eavesdropper who intercepts the communication learns nothing about the message. A quantum one-time pad is a shared quantum state…

Quantum Physics · Physics 2012-01-31 Fernando G. S. L. Brandão , Jonathan Oppenheim

Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits --- unless the two…

Quantum Physics · Physics 2007-05-23 Gilles Brassard

Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement:…

Quantum Physics · Physics 2015-09-23 L. Czekaj , M. Pawlowski , T. Vertesi , A. Grudka , M. Horodecki , R. Horodecki

Quantum resources can be more powerful than classical resources - a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two people's inputs can be done with exponentially…

Quantum Physics · Physics 2015-10-05 Christopher Perry , Rahul Jain , Jonathan Oppenheim

We apply several quantization schemes to simple versions of the Chinos game. Classically, for two players with one coin each, there is a symmetric stable strategy that allows each player to win half of the times on average. A partial…

Quantum Physics · Physics 2009-11-07 F. Guinea , M. A. Martin-Delgado

John Bell taught us that quantum mechanics can not be reproduced by non-contextual and local Hidden variable theory. The impossibility of replacing quantum mechanics by non-contextual Hidden Variable Theory can be turned to a impossible…

Quantum Physics · Physics 2007-05-23 Guruprasad Kar

Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is…

Quantum Physics · Physics 2009-10-06 Kay-Yut Chen , Tad Hogg , Raymond Beausoleil

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…

A set of $n$ pure quantum states is called antidististinguishable if there exists an $n$-outcome measurement that never outputs the outcome `$k$' on the $k$-th quantum state. We describe sets of quantum states for which any subset of three…

Quantum Physics · Physics 2020-03-25 Vojtěch Havlíček , Jonathan Barrett

When a noisy communication channel is used multiple times, the errors occurring at different times generally exhibit correlations. Classically, these correlations do not affect the evolution of individual particles: a single classical…

Quantum Physics · Physics 2021-12-07 Hlér Kristjánsson , Wenxu Mao , Giulio Chiribella

Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of…

Quantum Physics · Physics 2010-07-20 Ivan Fialík

A crucial step towards the 6th generation (6G) of networks would be a shift in communication paradigm beyond the limits of Shannon's theory. In both classical and quantum Shannon's information theory, communication channels are generally…

Quantum Physics · Physics 2023-10-24 Marcello Caleffi , Kyrylo Simonov , Angela Sara Cacciapuoti

Quantum communication systems support unique applications in the form of distributed quantum computing, distributed quantum sensing, and several cryptographic protocols. The main enabler in these communication systems is an efficient…

Quantum Physics · Physics 2024-07-15 Seid Koudia , Leonardo Oleynik , Mert Bayraktar , Junaid ur Rehman , Symeon Chatzinotas

We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing settings. For every k, we demonstrate a relational communication…

Quantum Physics · Physics 2022-03-29 Dmytro Gavinsky , Pavel Pudlák
‹ Prev 1 3 4 5 6 7 10 Next ›