Design and experimental realization of an optimal scheme for teleportion of an nn-qubit quantum state

An explicit scheme (quantum circuit) is designed for the teleportation of an $n$-qubit quantum state. It is established that the proposed scheme requires an optimal amount of quantum resources, whereas larger amount of quantum resources has been used in a large number of recently reported teleportation schemes for the quantum states which can be viewed as special cases of the general $n$-qubit state considered here. A trade off between our knowledge about the quantum state to be teleported and the amount of quantum resources required for the same is observed. A proof of principle experimental realization of the proposed scheme (for a 2-qubit state) is also performed using 5-qubit superconductivity-based IBM quantum computer. Experimental results show that the state has been teleported with high fidelity. Relevance of the proposed teleportation scheme has also been discussed in the context of controlled, bidirectional, and bidirectional-controlled state teleportation.Comment: 11 pages 4 figure

Generalized Remote Preparation of Arbitrary mm-qubit Entangled States via Genuine Entanglements

Herein, we present a feasible, general protocol for quantum communication within a network via generalized remote preparation of an arbitrary $m$-qubit entangled state designed with genuine tripartite Greenberger--Horne--Zeilinger-type entangled resources. During the implementations, we construct novel collective unitary operations; these operations are tasked with performing the necessary phase transfers during remote state preparations. We have distilled our implementation methods into a five-step procedure, which can be used to faithfully recover the desired state during transfer. Compared to previous existing schemes, our methodology features a greatly increased success probability. After the consumption of auxiliary qubits and the performance of collective unitary operations, the probability of successful state transfer is increased four-fold and eight-fold for arbitrary two- and three-qubit entanglements when compared to other methods within the literature, respectively. We conclude this paper with a discussion of the presented scheme for state preparation, including: success probabilities, reducibility and generalizability.Comment: 16 pages, 3 figures, 3 tables, Accepted to Entrop

Hierarchical Joint Remote State Preparation in Noisy Environment

A novel scheme for quantum communication having substantial applications in practical life is designed and analyzed. Specifically, we have proposed a hierarchical counterpart of the joint remote state preparation (JRSP) protocol, where two senders can jointly and remotely prepare a quantum state. One sender has the information regarding amplitude, while the other one has the phase information of a quantum state to be jointly prepared at the receiver's port. However, there exists a hierarchy among the receivers, as far as powers to reconstruct the quantum state is concerned. A 5-qubit cluster state has been used here to perform the task. Further, it is established that the proposed scheme for hierarchical JRSP (HJRSP) is of enormous practical importance in critical situations involving defense and other sectors, where it is essential to ensure that an important decision/order that can severely affect a society or an organization is not taken by a single person, and once the order is issued all the receivers don't possess an equal right to implement it. Further, the effect of different noise models (e.g., amplitude damping (AD), phase damping (PD), collective noise and Pauli noise models) on the HJRSP protocol proposed here is investigated. It is found that in AD and PD noise models a higher power agent can reconstruct the quantum state to be remotely prepared with higher fidelity than that done by the lower power agent(s). In contrast, the opposite may happen in the presence of collective noise models. We have also proposed a scheme for probabilistic HJRSP using a non-maximally entangled 5-qubit cluster state.Comment: 24 pages, 6 figure

A General Method for Selecting Quantum Channel for Bidirectional Controlled State Teleportation and Other Schemes of Controlled Quantum Communication

Recently, a large number of protocols for bidirectional controlled state teleportation (BCST) have been proposed using $n$-qubit entangled states ($n\in\{5,6,7\}$) as quantum channel. Here, we propose a general method of selecting multi-qubit $(n>4)$ quantum channels suitable for BCST and show that all the channels used in the existing protocols of BCST can be obtained using the proposed method. Further, it is shown that the quantum channels used in the existing protocols of BCST forms only a negligibly small subset of the set of all the quantum channels that can be constructed using the proposed method to implement BCST. It is also noted that all these quantum channels are also suitable for controlled bidirectional remote state preparation (CBRSP). Following the same logic, methods for selecting quantum channels for other controlled quantum communication tasks, such as controlled bidirectional joint remote state preparation (CJBRSP) and controlled quantum dialogue, are also provided.Comment: 8 pages, no figur

Implementation vulnerabilities in general quantum cryptography

Quantum cryptography is information-theoretically secure owing to its solid basis in quantum mechanics. However, generally, initial implementations with practical imperfections might open loopholes, allowing an eavesdropper to compromise the security of a quantum cryptographic system. This has been shown to happen for quantum key distribution (QKD). Here we apply experience from implementation security of QKD to several other quantum cryptographic primitives. We survey quantum digital signatures, quantum secret sharing, source-independent quantum random number generation, quantum secure direct communication, and blind quantum computing. We propose how the eavesdropper could in principle exploit the loopholes to violate assumptions in these protocols, breaking their security properties. Applicable countermeasures are also discussed. It is important to consider potential implementation security issues early in protocol design, to shorten the path to future applications.Comment: 13 pages, 8 figure