English
Related papers

Related papers: Quantum Broadcast Channel Simulation via Multipart…

200 papers

The private simultaneous messages model is a non-interactive version of the multiparty secure computation, which has been intensively studied to examine the communication cost of the secure computation. We consider its quantum counterpart,…

Quantum Physics · Physics 2021-05-18 Akinori Kawachi , Harumichi Nishimura

We investigate two senders and one receiver multiparty communication scenario. Following Phys.Rev.A83, 062112 and arXiv : 2506.07699, we study multiparty communication bounded by dimension and distinguishability. We provide an explicit…

Quantum Physics · Physics 2025-12-08 Ankush Pandit

Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error…

Quantum Physics · Physics 2024-11-07 Matthias Christandl , Alexander Müller-Hermes

We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…

Environmental effects on the transmission of a state result, in general, in a change in the information carried by it. To mitigate this, many techniques such as quantum error--correcting codes, decoherence--free--subspaces [Rev Mod Phys,…

Quantum Physics · Physics 2021-11-29 Rajni Bala , V. Ravishankar

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 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 prove a direct sum theorem for bounded round entanglement-assisted quantum communication complexity. To do so, we use the fully quantum definition for information cost and complexity that we recently introduced, and use both the fact…

Quantum Physics · Physics 2021-01-01 Dave Touchette

Quantum communication employs the counter-intuitive features of quantum physics to perform tasks that are im- possible in the classical world. It is crucial for testing the foundations of quantum theory and promises to rev- olutionize our…

The concept of entanglement splitting is introduced by asking whether it is possible for a party possessing half of a pure bipartite quantum state to transfer some of his entanglement with the other party to a third party. We describe the…

Quantum Physics · Physics 2009-10-31 Dagmar Bruss

We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can…

Information Theory · Computer Science 2020-10-02 Farzin Salek , Anurag Anshu , Min-Hsiu Hsieh , Rahul Jain , Javier R. Fonollosa

The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have…

Quantum Physics · Physics 2007-05-23 Charles H. Bennett , Peter W. Shor , John A. Smolin , Ashish V. Thapliyal

The way a new type of state called a hybrid state, which contains more than one degree of freedom, is used in many practical applications of quantum communication tasks with lesser amount of resources. Similarly, our aim is here to perform…

Quantum Physics · Physics 2024-02-23 Mitali Sisodia , Manoj Kumar Mandal , Binayak S. Choudhury

We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a…

Quantum Physics · Physics 2024-09-25 Touheed Anwar Atif , S. Sandeep Pradhan , Andreas Winter

Distributed quantum computing supports combining the computational power of multiple quantum devices to overcome the limitations of individual devices. Circuit cutting techniques enable the distribution of quantum computations via classical…

Quantum Physics · Physics 2024-08-06 Marvin Bechtold , Johanna Barzen , Frank Leymann , Alexander Mandl

The distribution of entanglement between macroscopically separated parties represents a crucial protocol for future quantum information networks. Surprisingly, it has been theoretically shown that two distant systems can be entangled by…

Fundamental limits on communication rates over quantum channels are given by mathematical expressions involving entropic formulas. Often, it is unclear if these expressions are computable. This thesis describes contributions to the study of…

Quantum Physics · Physics 2023-04-28 Mohammad A. Alhejji

Given the limitations on the number of qubits in current noisy intermediate-scale quantum (NISQ) devices, the implementation of large-scale quantum algorithms on such devices is challenging, prompting research into distributed quantum…

Quantum Physics · Physics 2025-03-04 Xinyu Chen , Zilu Chen , Pengcheng Zhu , Xueyun Cheng , Zhijin Guan

Covert communication offers a method to transmit messages in such a way that it is not possible to detect that the communication is happening at all. In this work, we report an experimental demonstration of covert communication that is…

We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way…

Quantum Physics · Physics 2017-11-30 Riccardo Laurenza , Stefano Pirandola
‹ Prev 1 4 5 6 7 8 10 Next ›