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

Communications in Theoretical Physics

Accessible Information for Equally-Distant Partially-Entangled Alphabet State Resource

Hao San-Ru, Hou Bo-Yu, Xiao-Qiang Xi, Rui‐Hong Yue

Published Feb 15, 2002• 0 citations
Publisher

Abstract

We have proposed a quantum system with equally-distant partially-entangled alphabet which has the minimal mutual overlap and the highly distinguishability, these quantum are used as the signal states of the quantum communication. We have also constructed the positive operator-valued measure for these signal states and discussed their entanglement properties and measurement of entanglement. We calculate the accessible information for these alphabet and show that the accessible information is closely related to the entanglement of the signal states: the higher the entanglement of the signal states, the better the accessible information of the quantum system, and the accessible information reaches its maximal value when the alphabet have their maximal entanglement.

DOI
10.1088/0253-6102/37/2/149

Related papers

Equally distant, partially entangled alphabet states for quantum channels

Mário Ziman, Vladimír Bužek

Each Bell state has the property that by performing just local operations on one qubit, the complete Bell basis can be generated. That is, states generated by local operations are totally distinguishable. This remarkable property is due to maximal quantum entanglement between the two particles. We present a set of local unitary transformations that generate out of partially entangled two-qubit state a set of four maximally distinguishable states that are mutually equally distant. We discuss quantum dense coding based on these alphabet states.

arXiv:quant-ph/0009075•Physical Review A•Oct 9, 2000•7 citations

Proof of the orthogonal measurement conjecture for qubit states

Andreas Keil

The accessible information of general signal states is obtained by performing a generalized measurement. In the case that the signal alphabet consists of two states of a qubit system, it is proved that a von Neumann (orthogonal) measurement is sufficient to reach the accessible information.

WORLD SCIENTIFIC eBooks•Aug 1, 2025•1 citation

Proof of the orthogonal measurement conjecture for qubit states

Andreas Keil

The accessible information of general signal states is obtained by performing a generalized measurement. In the case that the signal alphabet consists of two states of a qubit system, it is proved that a von Neumann (orthogonal) measurement is sufficient to reach the accessible information.

arXiv:0809.0232•International Journal of Quantum Information•Apr 30, 2024•10 citations

Entanglement and local information access for graph states

Damian Markham, Akimasa Miyake, S. Virmani

We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d -dimensional cluster states ( d = 1,2,3), the Greenberger–Horne–Zeilinger states, and some related mixed states. The entanglement measures that we consider are continuous, 'distance from separable states' measures, including the relative entropy, the so-called geometric measure, and robustness of entanglement. We also show that for our class of graph states these entanglement values give an operational interpretation as the maximal number of graph states distinguishable by local operations and classical communication (LOCC), as well as supplying a tight bound on the fixed letter classical capacity under LOCC decoding.

arXiv:quant-ph/0609102•New Journal of Physics•Jun 29, 2007•66 citations

Deterministic dense coding with partially entangled states

Shay Mozes, Jonathan Oppenheim, Benni Reznik

The utilization of a $d$-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding schemes for certain classes of nonmaximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the maximal alphabet size of such schemes on the partially entangled state shared by the two parties. Surprisingly, for $d>2$ it is possible to have deterministic dense coding with less than one ebit. In this case the number of alphabet letters that can be communicated by a single particle is between $d$ and $2d$. In general, we numerically find that the maximal alphabet size is any integer in the range $[d,{d}^{2}]$ with the possible exception of ${d}^{2}\ensuremath{-}1$. We also find that states with less entanglement can have a greater deterministic communication capacity than other more entangled states.

arXiv:quant-ph/0403189•Physical Review A•Jan 7, 2005•76 citations

Accessibility between Entangled States

Fumiaki Morikoshi

Entanglement, a weird quantum correlation between separate physical systems, is an indispensable resource for quantum information processing. As with other physical resources, the key to understanding its full potential is to quantify it. In this paper, I review our recent insights into the quantification of entanglement based on the operational notion of accessibility between physical states. In particular, I show that the partially ordered structure of mixed entangled states underlies the non-uniqueness of their entanglement measure.

•Jan 1, 2004•0 citations
We have proposed a quantum system with equally-distant partially-entangled alphabet which has the minimal mutual overlap and the highly distinguishability, these quantum are used as the signal states of the quantum communication. We have also constructed the positive operator-valued measure for these signal states and discussed their entanglement properties and measurement of entanglement. We calculate the accessible information for these alphabet and show that the accessible information is closely related to the entanglement of the signal states: the higher the entanglement of the signal states, the better the accessible information of the quantum system, and the accessible information reaches its maximal value when the alphabet have their maximal entanglement.
Each Bell state has the property that by performing just local operations on one qubit, the complete Bell basis can be generated. That is, states generated by local operations are totally distinguishable. This remarkable property is due to maximal quantum entanglement between the two particles. We present a set of local unitary transformations that generate out of partially entangled two-qubit state a set of four maximally distinguishable states that are mutually equally distant. We discuss quantum dense coding based on these alphabet states.
We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d -dimensional cluster states ( d = 1,2,3), the Greenberger–Horne–Zeilinger states, and some related mixed states. The entanglement measures that we consider are continuous, 'distance from separable states' measures, including the relative entropy, the so-called geometric measure, and robustness of entanglement. We also show that for our class of graph states these entanglement values give an operational interpretation as the maximal number of graph states distinguishable by local operations and classical communication (LOCC), as well as supplying a tight bound on the fixed letter classical capacity under LOCC decoding.
The utilization of a ddd-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding schemes for certain classes of nonmaximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the maximal alphabet size of such schemes on the partially entangled state shared by the two parties. Surprisingly, for d>2d>2d>2 it is possible to have deterministic dense coding with less than one ebit. In this case the number of alphabet letters that can be communicated by a single particle is between ddd and 2d2d2d. In general, we numerically find that the maximal alphabet size is any integer in the range [d,d2][d,{d}^{2}][d,d2] with the possible exception of ${d}^{2}\ensuremath{-}1$. We also find that states with less entanglement can have a greater deterministic communication capacity than other more entangled states.
Entanglement, a weird quantum correlation between separate physical systems, is an indispensable resource for quantum information processing. As with other physical resources, the key to understanding its full potential is to quantify it. In this paper, I review our recent insights into the quantification of entanglement based on the operational notion of accessibility between physical states. In particular, I show that the partially ordered structure of mixed entangled states underlies the non-uniqueness of their entanglement measure.