English
Related papers

Related papers: Unbounded quantum advantage in communication compl…

200 papers

The problem of sampling outputs of quantum circuits has been proposed as a candidate for demonstrating a quantum computational advantage (sometimes referred to as quantum "supremacy"). In this work, we investigate whether quantum advantage…

Quantum Physics · Physics 2021-06-09 Leonardo Novo , Juani Bermejo-Vega , Raúl García-Patrón

Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…

Quantum Physics · Physics 2015-06-29 Gilles Brassard , Anne Broadbent , Alain Tapp

The Quantum Internet is envisioned as the final stage of the quantum revolution, opening fundamentally new communications and computing capabilities, including the distributed quantum computing. But the Quantum Internet is governed by the…

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

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

Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…

Computational Complexity · Computer Science 2024-09-13 Arash Vaezi , Ali Movaghar , Mohammad Ghodsi , Seyed Mohammad Hussein Kazemi , Negin Bagheri Noghrehy , Seyed Mohsen Kazemi

Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of Babai, Frankl, and Simon in the 1980s and culminating in the…

Computational Complexity · Computer Science 2026-03-23 Zach Hunter , Aleksa Milojević , Benny Sudakov , Istvan Tomon

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

Quantum information theory is built upon the realisation that quantum resources like coherence and entanglement can be exploited for novel or enhanced ways of transmitting and manipulating information, such as quantum cryptography,…

Quantum Physics · Physics 2016-11-08 Gerardo Adesso , Thomas R. Bromley , Marco Cianciaruso

Quantum and private communications are affected by a fundamental limitation which severely restricts the optimal rates that are achievable by two distant parties. To overcome this problem, one needs to introduce quantum repeaters and, more…

Quantum Physics · Physics 2019-09-30 Stefano Pirandola

The rate and security of quantum communications between users placed at arbitrary points of a quantum communication network depend on the structure of the network, on its extension and on the nature of the communication channels. In this…

Quantum Physics · Physics 2024-05-20 Lorenzo Cirigliano , Valentina Brosco , Claudio Castellano , Claudio Conti , Laura Pilozzi

Based on an intuitive generalization of the Leibniz principle of `the identity of indiscernibles', we introduce a novel ontological notion of classicality, called bounded ontological distinctness. Formulated as a principle, bounded…

Quantum Physics · Physics 2020-10-21 Anubhav Chaturvedi , Debashis Saha

In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on…

Quantum Physics · Physics 2025-08-14 Sujeet Bhalerao , Felix Leditzky

There are three different types of nondeterminism in quantum communication: i) $\nqp$-communication, ii) $\qma$-communication, and iii) $\qcma$-communication. In this \redout{paper} we show that multiparty $\nqp$-communication can be…

Computational Complexity · Computer Science 2013-08-20 Xiaoming Sun , Marcos Villagra

We reveal key connections between non-locality and advantage in correlation-assisted classical communication. First, using the wire-cutting technique, we provide a Bell inequality tailored to any correlation-assisted bounded classical…

Quantum Physics · Physics 2025-07-16 Sumit Rout , Anubhav Chaturvedi , Some Sankar Bhattacharya , Paweł Horodecki

Unextendibility of quantum states and channels is inextricably linked to the no-cloning theorem of quantum mechanics, it has played an important role in understanding and quantifying entanglement, and more recently it has found applications…

Quantum Physics · Physics 2025-12-01 Vishal Singh , Theshani Nuradha , Mark M. Wilde

In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highlighted recently. Currently, most of efficient quantum…

Quantum Physics · Physics 2015-06-24 Theodoros Kapourniotis , Vedran Dunjko , Elham Kashefi

Quantum channels are known to provide qualitatively better information transfer capacities over their classical counterparts. Examples include quantum cryptography, quantum dense coding, and quantum teleportation. This is a short review on…

Quantum Physics · Physics 2015-03-19 Aditi Sen De , Ujjwal Sen

One of the best signatures of nonclassicality in a quantum system is the existence of correlations that have no classical counterpart. Different methods for quantifying the quantum and classical parts of correlations are amongst the more…

Quantum Physics · Physics 2012-11-29 Kavan Modi , Aharon Brodutch , Hugo Cable , Tomasz Paterek , Vlatko Vedral

Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be…

‹ Prev 1 8 9 10 Next ›