English
Related papers

Related papers: Quantum Hyperdense Coding for Distributed Communic…

200 papers

A key goal of quantum communication is to determine the maximum number of bits shared between two quantum systems. An important example of this is in entanglement based quantum key distribution (QKD) schemes. A realistic treatment of this…

Quantum Physics · Physics 2015-06-04 Thomas Brougham , Stephen M. Barnett

Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure…

Quantum Physics · Physics 2015-06-26 Antonio Acin , J. Ignacio Cirac , Maciej Lewenstein

The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary…

Quantum Physics · Physics 2023-07-27 Ashwin Nayak , Henry Yuen

We introduce a general odd qubit entangled system composed of GHZ and Bell pairs and explicate its usefulness for quantum teleportation, information splitting and superdense coding. After demonstrating the superdense coding protocol on the…

Quantum Physics · Physics 2015-05-07 Debashis Saha , Prasanta K. Panigrahi

Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished.…

Quantum Physics · Physics 2023-12-12 Nicholas Skjellum , Mohamed Shaban , Muhammad Ismail

We investigate the dense coding in the case of non-symmetric Hilbert spaces of the sender and receiver's particles sharing the quantum maximally entangled state. The efficiency of classical information gain is also considered. We conclude…

Quantum Physics · Physics 2009-11-10 Fengli Yan , Meiyu Wang

We show that communication without a shared reference frame is possible using entangled states. Both classical and quantum information can be communicated with perfect fidelity without a shared reference frame at a rate that asymptotically…

Quantum Physics · Physics 2007-05-23 Stephen D. Bartlett , Terry Rudolph , R. W. Spekkens

Quantum communication represents a revolutionary advancement over classical information theory, which leverages unique quantum mechanics properties like entanglement to achieve unprecedented capabilities in secure and efficient information…

Emerging Technologies · Computer Science 2024-06-14 Amit Kumar Bhuyan , Hrishikesh Dutta

Quantum machine learning is emerging as a promising application of quantum computing due to its distinct way of encoding and processing data. It is believed that large-scale quantum machine learning demonstrates substantial advantages over…

Quantum Physics · Physics 2025-01-15 Kiwmann Hwang , Hyang-Tag Lim , Yong-Su Kim , Daniel K. Park , Yosep Kim

Multiple photonic degrees of freedom can be explored to generate high-dimensional quantum states; commonly referred to as `qudits'. Qudits offer several advantages for quantum communications, including higher information capacity, noise…

Quantum Physics · Physics 2023-03-21 Indrakshi Dey , Nicola Marchetti

We propose a distributed quantum dense coding protocol that uses a control system to superpose two dense coding processes, allowing us to simultaneously and coherently encode and non-classically route the sender's single-qubit system to two…

Quantum Physics · Physics 2025-03-21 Pratham Hullamballi , Aparajita Bhattacharyya , Ujjwal Sen

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

We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to…

Quantum Physics · Physics 2012-04-18 A. K. Pati , P. Parashar , P. Agrawal

This paper shows how network coding and superdense coding can be combined to increase the classical data throughput by a factor $2-\epsilon$ (for arbitrarily small $\epsilon > 0$) compared to the maximum that could be achieved using either…

Quantum Physics · Physics 2020-07-01 Steven Herbert

Efficient entanglement distribution is the foundational challenge in realizing large-scale Quantum Networks. However, state-of-the-art solutions are frequently limited by restrictive operational assumptions, prohibitive computational…

We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the…

Quantum Physics · Physics 2026-03-20 Satyaki Manna , Ankush Pandit , Debashis Saha

Quantum superdense coding enables a sender to encode a two-bit classical message in one qubit using the preshared entanglement. In this paper, we develop a superdense coding protocol using a dual quantum Zeno (DQZ) gate to take the full…

Quantum Physics · Physics 2019-12-17 Fakhar Zaman , Youngmin Jeong , Hyundong Shin

Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing inter-server communication -- an issue central to the study of communication complexity. Quantum resources…

Entanglement-assisted classical communication (EACC) aims to enhance communication systems using entanglement as an additional resource. However, there is a scarcity of explicit protocols designed for finite transmission scenarios, which…

Quantum Physics · Physics 2025-02-04 Tushita Prasad , Markus Grassl

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…