×

Fidelity for states of two \(\mathrm{spin-}\frac{1}{2}\) particles in moving frames. (English) Zbl 1171.81342

Summary: Fidelity for the spin part of states of two spin-\(\frac{1}{2}\) particles is investigated from the viewpoint of moving observers. Using a numerical approach, the behavior of the fidelity in terms of the boost parameter is described for different amounts of spin entanglement and momentum entanglement. It is shown that for the spin entangled states the fidelity decreases less than that of the case of spin product states and there are special cases for which the fidelity remains perfect regardless of moving observers’ velocity. Generally, in the limit of boosts with speeds close to the speed of light, the fidelity saturates, i.e., it reaches to a constant value that depends on the amount of momentum entanglement and the width of the momentum distribution function.

MSC:

81P68 Quantum computation
70H40 Relativistic dynamics for problems in Hamiltonian and Lagrangian mechanics
83A05 Special relativity
94A40 Channel models (including quantum) in information and communication theory
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Peres, A., Scudo, P.F., Terno, D.R.: Phys. Rev. Lett. 88, 230402 (2002)
[2] Gingrich, R.M., Adami, C.: Phys. Rev. Lett. 89, 270402 (2002)
[3] Li, H., Du, J.: Phys. Rev. A 68, 022108 (2003)
[4] Czachor, M.: Phys. Rev. A 55, 77 (1997)
[5] Ahn, D., Lee, H.J., Moon, Y.H., Hwang, S.W.: Phys. Rev. A 67, 012103 (2003)
[6] Lee, D., Ee, C.Y.: New J. Phys. 6, 67 (2004)
[7] Moom, Y.H., Ahn, D., Hwang, S.W.: arXiv:quant-ph/0304116
[8] Kim, W.T., Son, E.J.: Phys. Rev. A 71, 0141107 (2005)
[9] Ahn, D., Lee, H., Hwang, S.W., Kim, M.S.: arXiv:quant-ph/0304119
[10] Hubner, M.: Phys. Lett. A 179, 226–230 (1993)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.