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

arXiv:0711.3520

Perfect Quantum Teleportation and Superdense coding with $P_{max} = 1/2$ states

Eylee Jung, Mi-Ra Hwang, DaeKil Park, Jin-Woo Son, Sayatnova Tamaryan

Published Nov 22, 2007• 5 citations
arXivHTMLPDF

Abstract

We conjecture that criterion for perfect quantum teleportation is that the Groverian entanglement of the entanglement resource is $1/\sqrt{2}$. In order to examine the validity of our conjecture we analyze the quantum teleportation and superdense coding with $|Φ> = (1/\sqrt{2}) (|00q_1> + |11q_2>)$, where $|q_1>$ and $|q_2>$ are arbitrary normalized single qubit states. It is shown explicitly that $|Φ>$ allows perfect two-party quantum teleportation and superdense coding scenario. Next we compute the Groverian measures for $|ψ>=\sqrt{1/2 - b^2}|100>+b |010>+a|001> +\sqrt{1/2-a^2}|111>$ and $|\tildeψ>=a|000>+b|010>+\sqrt{1/2 - (a^2+b^2)}|100> + (1/\sqrt{2}) |111>$, which also allow the perfect quantum teleportation. It is shown that both states have $1/\sqrt{2}$ Groverian entanglement measure, which strongly supports that our conjecture is valid.

DOI
10.48550/arxiv.0711.3520

Related papers

Perfect teleportation, quantum-state sharing, and superdense coding through a genuinely entangled five-qubit state

Sreraman Muralidharan, Prasanta Kumar Panigrahi

We investigate the usefulness of a recently introduced five-qubit state by Brown et al. [I. D. K. Brown, S. Stepney, A. Sudbery, and S. L. Braunstein, J. Phys. A 38, 1119 (2005)] for quantum teleportation, quantum-state sharing, and superdense coding. It is shown that this state can be utilized for perfect teleportation of arbitrary single and two-qubit systems. We devise various schemes for quantum-state sharing of an arbitrary single- and two-particle state via cooperative teleportation. We later show that this state can be used for superdense coding as well. It is found that five classical bits can be sent by sending only three quantum bits.

arXiv:0708.3785•Physical Review A•Mar 13, 2008•303 citations

Perfect teleportation and superdense coding with W states

Pankaj Agrawal, Arun Kumar Pati

True tripartite entanglement of the state of a system of three qubits can be classified on the basis of stochastic local operations and classical communications. Such states can be classified into two categories: GHZ states and $W$ states. It is known that GHZ states can be used for teleportation and superdense coding, but the prototype $W$ state cannot be. However, we show that there is a class of $W$ states that can be used for perfect teleportation and superdense coding.

arXiv:quant-ph/0610001•Physical Review A•Dec 26, 2006•488 citations

The necessary and sufficient condition for perfect teleportation and superdense coding and all the suitable states for teleportation and superdense coding

Dafa Li

It is known that two local unitaries (LU) equivalent states possess the same amount of entanglement and can be used to perform the same tasks in quantum information theory (QIT). For a protocol for a task in QIT, we call a protocol LU invariant if two LU-equivalent states are either both suitable for the protocol or neither is. So far, no one has discussed whether a protocol for a task in QIT is LU invariant. In [Phys. Rev. A, 74, 062320 (2006)], Agrawal and Pati proposed the perfect teleportation protocol (PTP) and the protocol for superdense coding to transmit 2-bit classical information by sending one qubit (PSDC-2) and 3-bit classical information by sending two qubits (PSDC-3). In this paper, we show that PTP and PSDC-2 are LU invariant. That is, two LU equivalent states are suitable for PTP and PSDC-2 or neither of them is. We show that PSDC-3 is not LU invariant. We also indicate that the teleportation proposed in <cite>Nielsen</cite> is not LU invariant. We give a necessary and sufficient condition for a state to be suitable for PTP, PSDC-2, and PSDC-3, respectively. Via the LU invariance of PTP and PSDC-2, we prove that a state is suitable for PTP and PSDC-2 if and only if it has 1 ebit of shared entanglement, respectively and find all genuine entangled states and separable states which are suitable for PTP and PSDC-2, respectively. So far, no one has indicated that PTP and PSDC-2 do not require genuine entanglement. Agrawal and Pati suggested to study if there are subclasses of W SLOCC class which are suitable for PSDC-3. So far, it still remains an unsolved question. We show that any state of the SLOCC class W is not suitable for PSDC-3.

quant-pharXiv:2602.11293•Annals of Physics•Feb 13, 2026•1 citation

Teleportation and Superdense coding with Genuine quadripartite entangled states

Pradhan, B., Pankaj Agrawal, Arun Kumar Pati

We investigate the usefulness of different classes of genuine quadripartite entangled states as quantum resources for teleportation and superdense coding. We examine the possibility of teleporting unknown one, two and three qubit states. We show that one can use the teleportation protocol to send any general one and two qubit states. A restricted class of three qubit states can also be faithfully teleported. We also explore superdense coding protocol in single-receiver and multi-receiver scenarios. We show that there exist genuine quadripartite entangled states that can be used to transmit four cbits by sending two qubits. We also discuss some interesting features of multi-receiver scenario under LOCC paradigm.

arXiv:0705.1917•May 14, 2007•11 citations

Perfect Quantum Teleportation via Bell States

Xiaoqing Tan, Xiaochun Li and Pei Yang

Quantum mechanics shows superiority than classical mechanics in many aspects and quantum entanglement plays an essential role in information processing and some computational tasks such as quantum teleportation (QT). QT was proposed to transmit the unknown states, in which EPR pairs, the entangled states, can be used as quantum channels. In this paper, we present two simple schemes for teleporting a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state respectively. Alice and Bob have shared an entangle state. Two Bell states are used as quantum channels. Then after Alice measuring her qubits and informing Bob her measurement results, Bob can perfectly reconstruct the original state by performing corresponding unitary operators on his qubits. It shown that a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state can be teleported perfectly, i.e. the success probabilities of our schemes are both 1.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2018•21 citations

Perfect teleportation and superdense coding through an asymmetric five qubit state

Sreraman Muralidharan, Prasanta Kumar Panigrahi

We explicate an example of the so called Task oriented Maximally Entangled states (TMES) in the context of teleportation and superdense coding. In physical situation, this state can emerge from decoherence of more entangled state or may be prepared for the purpose at hand, with less entanglement resource. We find that a variant of the Brown state can be utilized for perfect teleportation of single and two qubit states. In case of superdense coding, it is observed that five cbits can be transmitted by sending only three qubits.

arXiv:0802.3484•Feb 24, 2008•3 citations
Perfect Quantum Teleportation and Superdense coding with Pmax=1/2P_{max} = 1/2Pmax​=1/2 states
We conjecture that criterion for perfect quantum teleportation is that the Groverian entanglement of the entanglement resource is 1/21/\sqrt{2}1/2​. In order to examine the validity of our conjecture we analyze the quantum teleportation and superdense coding with ∣Φ>=(1/2)(∣00q1>+∣11q2>)|Φ> = (1/\sqrt{2}) (|00q_1> + |11q_2>)∣Φ>=(1/2​)(∣00q1​>+∣11q2​>), where ∣q1>|q_1>∣q1​> and ∣q2>|q_2>∣q2​> are arbitrary normalized single qubit states. It is shown explicitly that ∣Φ>|Φ>∣Φ> allows perfect two-party quantum teleportation and superdense coding scenario. Next we compute the Groverian measures for ∣ψ>=1/2−b2∣100>+b∣010>+a∣001>+1/2−a2∣111>|ψ>=\sqrt{1/2 - b^2}|100>+b |010>+a|001> +\sqrt{1/2-a^2}|111>∣ψ>=1/2−b2​∣100>+b∣010>+a∣001>+1/2−a2​∣111> and ∣ψ~>=a∣000>+b∣010>+1/2−(a2+b2)∣100>+(1/2)∣111>|\tildeψ>=a|000>+b|010>+\sqrt{1/2 - (a^2+b^2)}|100> + (1/\sqrt{2}) |111>∣ψ~​>=a∣000>+b∣010>+1/2−(a2+b2)​∣100>+(1/2​)∣111>, which also allow the perfect quantum teleportation. It is shown that both states have 1/21/\sqrt{2}1/2​ Groverian entanglement measure, which strongly supports that our conjecture is valid.
We investigate the usefulness of a recently introduced five-qubit state by Brown et al. [I. D. K. Brown, S. Stepney, A. Sudbery, and S. L. Braunstein, J. Phys. A 38, 1119 (2005)] for quantum teleportation, quantum-state sharing, and superdense coding. It is shown that this state can be utilized for perfect teleportation of arbitrary single and two-qubit systems. We devise various schemes for quantum-state sharing of an arbitrary single- and two-particle state via cooperative teleportation. We later show that this state can be used for superdense coding as well. It is found that five classical bits can be sent by sending only three quantum bits.
True tripartite entanglement of the state of a system of three qubits can be classified on the basis of stochastic local operations and classical communications. Such states can be classified into two categories: GHZ states and WWW states. It is known that GHZ states can be used for teleportation and superdense coding, but the prototype WWW state cannot be. However, we show that there is a class of WWW states that can be used for perfect teleportation and superdense coding.
It is known that two local unitaries (LU) equivalent states possess the same amount of entanglement and can be used to perform the same tasks in quantum information theory (QIT). For a protocol for a task in QIT, we call a protocol LU invariant if two LU-equivalent states are either both suitable for the protocol or neither is. So far, no one has discussed whether a protocol for a task in QIT is LU invariant. In [Phys. Rev. A, 74, 062320 (2006)], Agrawal and Pati proposed the perfect teleportation protocol (PTP) and the protocol for superdense coding to transmit 2-bit classical information by sending one qubit (PSDC-2) and 3-bit classical information by sending two qubits (PSDC-3). In this paper, we show that PTP and PSDC-2 are LU invariant. That is, two LU equivalent states are suitable for PTP and PSDC-2 or neither of them is. We show that PSDC-3 is not LU invariant. We also indicate that the teleportation proposed in <cite>Nielsen</cite> is not LU invariant. We give a necessary and sufficient condition for a state to be suitable for PTP, PSDC-2, and PSDC-3, respectively. Via the LU invariance of PTP and PSDC-2, we prove that a state is suitable for PTP and PSDC-2 if and only if it has 1 ebit of shared entanglement, respectively and find all genuine entangled states and separable states which are suitable for PTP and PSDC-2, respectively. So far, no one has indicated that PTP and PSDC-2 do not require genuine entanglement. Agrawal and Pati suggested to study if there are subclasses of W SLOCC class which are suitable for PSDC-3. So far, it still remains an unsolved question. We show that any state of the SLOCC class W is not suitable for PSDC-3.
We investigate the usefulness of different classes of genuine quadripartite entangled states as quantum resources for teleportation and superdense coding. We examine the possibility of teleporting unknown one, two and three qubit states. We show that one can use the teleportation protocol to send any general one and two qubit states. A restricted class of three qubit states can also be faithfully teleported. We also explore superdense coding protocol in single-receiver and multi-receiver scenarios. We show that there exist genuine quadripartite entangled states that can be used to transmit four cbits by sending two qubits. We also discuss some interesting features of multi-receiver scenario under LOCC paradigm.
Quantum mechanics shows superiority than classical mechanics in many aspects and quantum entanglement plays an essential role in information processing and some computational tasks such as quantum teleportation (QT). QT was proposed to transmit the unknown states, in which EPR pairs, the entangled states, can be used as quantum channels. In this paper, we present two simple schemes for teleporting a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state respectively. Alice and Bob have shared an entangle state. Two Bell states are used as quantum channels. Then after Alice measuring her qubits and informing Bob her measurement results, Bob can perfectly reconstruct the original state by performing corresponding unitary operators on his qubits. It shown that a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state can be teleported perfectly, i.e. the success probabilities of our schemes are both 1.
We explicate an example of the so called Task oriented Maximally Entangled states (TMES) in the context of teleportation and superdense coding. In physical situation, this state can emerge from decoherence of more entangled state or may be prepared for the purpose at hand, with less entanglement resource. We find that a variant of the Brown state can be utilized for perfect teleportation of single and two qubit states. In case of superdense coding, it is observed that five cbits can be transmitted by sending only three qubits.