Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Secure simultaneous dense coding using $$\chi $$ χ -type entangled state

Xue Yang, Ming-Qiang Bai, Zhi-cui Zuo, Zhi-wen Mo

Published Aug 23, 2018• 9 citations
Publisher
DOI
10.1007/s11128-018-2022-7

Related papers

Scheme for Implementing Quantum Dense Coding with χ-Type Entangled States in Optical Systems

Yu‐Guang Yang, Juan Xia, Xin Jia +1 more

International Journal of Theoretical Physics•Jan 3, 2012•3 citations

Secure four-site distribution and quantum communication of χ−type entangled states

Xiao‐Ming Xiu, Li Dong, Yajun Gao

Optics Communications•Dec 14, 2010•26 citations

Quantum Secure Direct Communication with Four-Particle Genuine Entangled State and Dense Coding

Xiu Xiu, Xiaoming, Dong +5 more

理论物理通讯：英文版•Jan 1, 2009•6 citations

Controlled Dense Coding with Four-Qubit Entangled State

Rong Li

International Journal of Theoretical Physics•May 21, 2012•2 citations

Optimal dense coding with mixed state entanglement

Tohya Hiroshima

I investigate dense coding with a general mixed state on the Hilbert space C d ⊗ C d shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by mutually orthogonal unitary transformations with equal a priori probabilities, the capacity of dense coding is maximized. It is also proved that the optimal capacity of dense coding χ* satisfies E R (ρ) ≤ χ* ≤ E R (ρ) + log 2 d , where E R (ρ) is the relative entropy of entanglement of the shared entangled state.

arXiv:quant-ph/0009048•Journal of Physics A Mathematical and General•Aug 24, 2001•138 citations

Dense coding using entangled input states

Garry Bowen

Physics Letters A•Jul 1, 2001•1 citation
Secure simultaneous dense coding using χ\chi χ χ -type entangled state
I investigate dense coding with a general mixed state on the Hilbert space C d ⊗ C d shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by mutually orthogonal unitary transformations with equal a priori probabilities, the capacity of dense coding is maximized. It is also proved that the optimal capacity of dense coding χ* satisfies E R (ρ) ≤ χ* ≤ E R (ρ) + log 2 d , where E R (ρ) is the relative entropy of entanglement of the shared entangled state.