Author:
Bala Rajni,Asthana Sooryansh,Ravishankar V.
Abstract
AbstractNear-term quantum communication protocols suffer inevitably from channel noises, whose alleviation has been mostly attempted with resources such as multiparty entanglement or sophisticated experimental techniques. Generation of multiparty higher dimensional entanglement is not easy. This calls for exploring realistic solutions which are implementable with current devices. Motivated particularly by the difficulty in generation of multiparty entangled states, in this paper, we have investigated error-free information transfer with minimal requirements. For this, we have proposed a new information encoding scheme for communication purposes. The encoding scheme is based on the fact that most noisy channels leave some quantities invariant. Armed with this fact, we encode information in these invariants. These invariants are functions of expectation values of operators. This information passes through the noisy channel unchanged. Pertinently, this approach is not in conflict with other existing error correction schemes. In fact, we have shown how standard quantum error-correcting codes emerge if suitable restrictions are imposed on the choices of logical basis states. As applications, for illustration, we propose a quantum key distribution protocol and an error-immune information transfer protocol.
Funder
University Grants Commission
Council for Scientific and Industrial Research, India
Publisher
Springer Science and Business Media LLC
Reference57 articles.
1. Bennett, C. & Brassard, G. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing (ICCSSP) 175 (1984).
2. Bennett, C. H. & Wiesner, S. J. Communication via one- and two-particle operators on Einstein–Podolsky–Rosen states. Phys. Rev. Lett. 69, 2881–2884 (1992).
3. Ekert, A. K. Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 67, 661–663 (1991).
4. Deutsch, D. & Jozsa, R. Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. Ser. A Math. Phys. Sci. 439, 553–558 (1992).
5. Grover, L. K. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 212–219 (1996).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献