• Corpus ID: 237941110

Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders

  title={Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders},
  author={Masahito Hayashi and Kun Wang},
Masahito Hayashi1, 2, 3, ∗ and Kun Wang4, † Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China Guangdong Provincial Key Laboratory of Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China Graduate School of Mathematics, Nagoya University, Nagoya, 464-8602, Japan Institute for Quantum Computing, Baidu Research, Beijing 100193, China 
1 Citations

Figures and Tables from this paper

Quantum secure direct communication with private dense coding using general preshared quantum state
using general preshared quantum state Jiawei Wu, 2 Gui-Lu Long, 3, 4, 5, ∗ and Masahito Hayashi 6, 7, 8, † State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics, Tsinghua


Distributed quantum dense coding.
It is shown that global operations of the senders do not increase the information transfer capacity, in the case of a single receiver, and a nontrivial upper bound for the capacity is derived.
Classical information capacity of superdense coding
Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a
On quantum advantage in dense coding
The quantum advantage of dense coding—the increase in the rate of classical information transmission due to shared entanglement—is studied. General encoding quantum operations are considered.
Optimal verification of general bipartite pure states
This work considers the task of verifying entangled states using one-way and two-way classical communication and completely characterize the optimal strategies via convex optimization, and finds that they can be constructed for any bipartite pure state.
Dense coding capacity of a quantum channel
Exploiting techniques of channel simulation and protocol stretching, it is able to establish the dense coding capacity of Pauli channels in arbitrary finite dimension, with simple formulas for depolarizing and dephasing qubit channels.
Optimal dense coding with mixed state entanglement
I investigate dense coding with a general mixed state on the Hilbert space Cd ⊗ Cd shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by
Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
We consider two apparently separated problems: in the first part of the article we study the concept of a scalable (approximate) programmable quantum gate (SPQG). These are special (approximate)
On environment-assisted capacities of quantum channels
Following initial work by Gregoratti and Werner [J. Mod. Optics 50, 913-933, 2003 and quant-ph/0403092] and Hayden and King [quant-ph/0409026], we study the problem of the capacity of a quantum
A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
The derivation establishes a hierarchy of information quantities that can be used to investigate information theoretic tasks in the quantum domain: the one-shot entropies most accurately describe an operational quantity, yet they tend to be difficult to calculate for large systems.
Channel correction via quantum erasure.
  • F. Buscemi
  • Physics, Medicine
    Physical review letters
  • 2007
The present analysis also applies to channels for which perfect quantum erasure is impossible, thus extending the original quantum eraser arrangement, and naturally embodies a general information-disturbance trade-off.