排序方式: 共有13条查询结果,搜索用时 31 毫秒
1.
We study the performances of quantum channel adaptive [4,1] code transmitting in a joint amplitude damping and dephasing channel, the [6,2] code transmitting in an amplitude damping channel by combining the encoding, noise process, and decoding as one effective channel. We explicitly obtain the entanglement fidelities. The recovery operators of the [6,2] code are given. The performance is nearly optimal compared with that of the optimal method of semidefinite programming. 相似文献
2.
The performances of a two-mode Gaussian state under parametric
amplification, symmetric amplitude damping and thermal noise are
studied. The time-dependent complex correlation matrix of the state
in evolution is given. The separability of the final two-mode
Gaussian state is examined under symmetric amplification and
asymmetric amplification separately. 相似文献
3.
In quantum information theory, von Neumann entropy plays
an important role; it is related to quantum channel capacities.
Only for a few states can one obtain their entropies. In a
continuous variable system, numeric evaluation of entropy is not easy
due to infinite dimensions. We develop the perturbation theory for
systematically calculating von Neumann entropy of a non-degenerate
system as well as a degenerate system. 相似文献
4.
从量子信道的算符求和表象出发,对单模费米系统量子信道进行了参数化.参数化的结果得到另一类费米热噪声量子信道.给出了两类费米热噪声量子信道上相干信息的最大值,以估计信道的量子容量.
关键词:
量子容量
相干信息
费米热噪声信道 相似文献
5.
6.
We strictly prove that some block diagonalizable two-qubit entangled state with six non-zero elements reaches its quantum relative entropy entanglement by a separable state having the same matrix structure. The entangled state comprises local filtering result state as a special case. 相似文献
7.
8.
9.
陈小余 《Frontiers of Physics》2012,7(4):444-448
We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non ??two-colorable?? graphs. to non ??two-colorable?? graphs. The upper bound of entanglement for five vertex ring graph state is improved to 2. is improved to 2.9275, less than the upper bound determined by local operations and classical communication. communication. An upper bound of entanglement is proposed based on the definition of graph state. state. 相似文献
10.