English
Related papers

Related papers: Information and communication in polygon theories

200 papers

Entanglement appears in two different ways in quantum mechanics, namely as a property of states and as a property of measurement outcomes in joint measurements. By combining these two aspects of entanglement, it is possible to generate…

Quantum Physics · Physics 2012-09-26 Nicolas Brunner , Cyril Branciard , Nicolas Gisin , Denis Rosset

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 study the communication complexity of a number of graph properties where the edges of the graph $G$ are distributed between Alice and Bob (i.e., each receives some of the edges as input). Our main results are: * An Omega(n) lower bound…

Quantum Physics · Physics 2012-04-23 Gabor Ivanyos , Hartmut Klauck , Troy Lee , Miklos Santha , Ronald de Wolf

Generalized Probabilistic Theories (GPTs) provide a unified framework for describing probabilistic physical theories, encompassing classical and quantum theories as well as hypothetical theories beyond quantum mechanics. Since most GPTs are…

Quantum Physics · Physics 2026-05-14 Koki Ono , Shun Umekawa , Hiroyasu Tajima

This article will examine states that superpose different amounts of entanglement and protocols that run in superposition but generate or consume different amounts of entanglement. In both cases we find a uniquely quantum difficulty:…

Quantum Physics · Physics 2019-06-06 Aram W. Harrow

John Bell has shown that the correlations entailed by quantum mechanics cannot be reproduced by a classical process involving non-communicating parties. But can they be simulated with the help of bounded communication? This problem has been…

Information Theory · Computer Science 2022-01-04 Gilles Brassard , Luc Devroye , Claude Gravel

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

The communication cost of a classical protocol is typically measured in terms of the number of bits communicated for this determines the time required for communication during the protocol. Similarly, for quantum communication protocols,…

Quantum Physics · Physics 2021-01-04 Ashutosh Marwah , Dave Touchette

Inspired by its fundamental importance in quantum mechanics, we define and study the notion of entanglement for abstract physical theories, investigating its profound connection with the concept of superposition. We adopt the formalism of…

Quantum Physics · Physics 2019-10-11 Guillaume Aubrun , Ludovico Lami , Carlos Palazuelos

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

The mathematical framework of quantum theory, though fundamentally distinct from classical physics, raises the question of whether quantum processes can be efficiently simulated using classical resources. For instance, a sender (Alice)…

Quantum Physics · Physics 2025-07-17 Sahil Gopalkrishna Naik , Mani Zartab , Nicolas Gisin , Manik Banik

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…

Quantum Physics · Physics 2018-03-22 Ashwin Nayak , Julia Salzman

Recent studies have shown that quantum information may be effectively transmitted by a finite collection of completely depolarizing channels in a coherent superposition of different orders, via an operation known as the quantum $\tt…

Quantum Physics · Physics 2024-07-04 Zhen Wu , James Fullwood , Zhihao Ma , Siqi Zhou , Qi Zhao , Giulio Chiribella

We establish a universal complementarity relation between the capacity of classical information transmission by employing a multiparty quantum state as a multiport quantum channel, and the genuine multipartite entanglement of the quantum…

Quantum Physics · Physics 2013-10-30 R. Prabhu , Aditi Sen De , Ujjwal Sen

Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another. Remote state preparation (RSP) is a similar distributed task in which the sender knows the entire…

Quantum Physics · Physics 2018-05-15 Shima Bab Hadiashar , Ashwin Nayak , Renato Renner

A protocol of quantum communication is proposed in terms of the multi-qubit quantum teleportation through cluster states (Phys. Rev. Lett. \textbf{86}, 910 (2001)). Extending the cluster state based quantum teleportation on the basic unit…

Quantum Physics · Physics 2007-05-23 B. Zeng , D. L. Zhou , Z. Xu , C. P. Sun

Transmission of classical information using quantum objects such as polarized photons is studied. The classical (Shannon) channel capacity and its relation to quantum (von Neumann) channel capacity is investigated for various receiver…

Quantum Physics · Physics 2007-05-23 Göran Einarsson

It is quite common to use the generalized probabilistic theories (GPTs) as generic models to reconstruct quantum theory from a few basic principles and to gain a better understanding of the probabilistic or information theoretic foundations…

Quantum Physics · Physics 2026-03-12 Gerd Niestegge

We analyse the problem of transmitting a number of unknown quantum states or one composite system in one go. We derive a lower bound on the performance of such process, measured in the entanglement fidelity. The obtained bound is…

Quantum Physics · Physics 2021-11-12 Piotr Kopszak , Marek Mozrzymas , Michał Studziński , Michał Horodecki

Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound $2n$ on the communication…

Computational Complexity · Computer Science 2007-10-16 Dima Grigoriev