scholarly journals Optimizing Quantum Teleportation and Dense Coding via Mixed Noise Under Non-Markovian Approximation

Author(s):  
Akbar Islam ◽  
An Min Wang ◽  
Ahmad Abliz
2013 ◽  
Vol 12 (11) ◽  
pp. 3369-3381 ◽  
Author(s):  
Taotao Hu ◽  
Kang Xue ◽  
Chunfang Sun ◽  
Gangcheng Wang ◽  
Hang Ren

Author(s):  
Li Gao ◽  
Samuel J Harris ◽  
Marius Junge

Abstract We show for any $d,m\ge 2$ with $(d,m)\neq (2,2)$, the matrix-valued generalization of the (tensor product) quantum correlation set of $d$ inputs and $m$ outputs is not closed. Our argument uses a reformulation of super-dense coding and teleportation in terms of $C^*$-algebra isomorphisms. Namely, we prove that for certain actions of cyclic group ${{\mathbb{Z}}}_d$, \begin{equation*}M_d(C^*({{\mathbb{F}}}_{d^2}))\cong{{\mathcal{B}}}_d\rtimes{{\mathbb{Z}}}_d\rtimes{{\mathbb{Z}}}_d , M_d({{\mathcal{B}}}_d)\cong C^*({{\mathbb{F}}}_{d^2})\rtimes{{\mathbb{Z}}}_d\rtimes{{\mathbb{Z}}}_d,\end{equation*}where ${{\mathcal{B}}}_d$ is the universal unital $C^*$-algebra generated by the elements $u_{jk}, \, 0 \le i, j \le d-1$, satisfying the relations that $[u_{j,k}]$ is a unitary operator, and $C^*({{\mathbb{F}}}_{d^2})$ is the universal $C^*$-algebra of $d^2$ unitaries. These isomorphisms provide a nice connection between the embezzlement of entanglement and the non-closedness of quantum correlation sets.


2002 ◽  
Vol 57 (8) ◽  
pp. 689-691 ◽  
Author(s):  
Willi-Hans Steeb ◽  
Yorick Hardy

CEntangled quantum states are an important component of quantum computing techniques such as quantum error-correction, dense coding and quantum teleportation. We determine the requirements for a state in the Hilbert space ⊗ Cnfor m, n ∈ N to be entangled and a solution to the corresponding “factorization” problem if this is not the case.We consider the implications of these criteria for computer algebra applications.


2000 ◽  
Vol 11 (01) ◽  
pp. 69-77 ◽  
Author(s):  
WILLI-HANS STEEB ◽  
YORICK HARDY

Entangled quantum states are an important component of quantum computing techniques such as quantum error-correction, dense coding and quantum teleportation. We determine the requirements for a state in the Hilbert space C4 to be entangled and a solution to the corresponding "factorization" problem if this is not the case. The factorization of nonentangled states is implemented in C++.


Author(s):  
D. Bouwmeester ◽  
H. Weinfurter ◽  
A. Zeilinger ◽  
N. Gisin ◽  
J. G. Rarity ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document