Abstract-The presented work provides a procedure for optimizing the communication cost of a distributed quantum circuit (DQC) in terms of the number of qubit teleportations. Because of technology limitations which do not allow large quantum computers to work as a single processing element, distributed quantum computation is an appropriate solution to overcome this difficulty. Previous studies have applied ad-hoc solutions to distribute a quantum system for special cases and applications. In this study, a general approach is proposed to optimize the number of teleportations for a DQC consisting of two spatially separated and long-distance quantum subsystems. To this end, different configurations of locations for executing gates whose qubits are in distinct subsystems are considered and for each of these configurations, the proposed algorithm is run to find the minimum number of required teleportations. Finally, the configuration which leads to the minimum number of teleportations is reported. The proposed method can be used as an automated procedure to find the configuration with the optimal communication cost for the DQC.
In the present paper, a novel bidirectional quantum teleportation protocol is proposed. By using entanglement swapping technique, two GHZ states are shared as a quantum channel between Alice and Bob as legitimate users. In this scheme, based on control-not operation, single-qubit measurement and appropriate unitary operations, two users can simultaneously transmit a pure EPR state to each other. While, in the previous protocols, the users can just teleport a single-qubit state to each other via more than four-qubit state. Therefore, the proposed scheme is economical compared with previous protocols.
Distributed quantum computing has been well-known for many years as a system composed of a number of small-capacity quantum circuits. Limitations in the capacity of monolithic quantum computing systems can be overcome by using distributed quantum systems which communicate with each other through known communication links. In our previous study, an algorithm with an exponential complexity was proposed to optimize the number of qubit teleportations required for the communications between two partitions of a distributed quantum circuit. In this work, a genetic algorithm is used to solve the optimization problem in a more efficient way. The results are compared with the previous study and we show that our approach works almost the same with a remarkable speed-up. Moreover, the comparison of the proposed approach based on GA with a random search over the search space verifies the effectiveness of GA.
Recently, Hassanpour and Houshmand have proposed a protocol of controlled deterministic secure quantum communication (Quant. Info. Process, DOI 10.1007/s11128-014-0866-z (2014). The authors compared the efficiency of their protocol with that of two other existing protocols and claimed that their protocol is efficient. Here, we have shown that the efficiency of Hassanpour Houshmand (HH) protocol is not high, and there exist several approaches through which more efficient protocols for the same task can be designed. To establish this point, we have proposed an efficient protocol of controlled deterministic secure quantum communication which is based on permutation of particles (PoP) technique and is considerably efficient compared to HH protocol. We have also generalized this protocol into its bidirectional counterpart. Interestingly, bipartite entanglement (Bell state) is sufficient for the realization of the proposed protocols, but HH protocol and other existing protocols require at least tripartite entanglement. Further, we have shown that it is possible to construct a large number of efficient protocols of unidirectional and bidirectional controlled deterministic secure quantum communication by using various alternative approaches and different quantum states. These alternative protocols can be realized by modifying the existing protocols of quantum secure direct communication and deterministic secure quantum communication. We have also shown that it is possible to design completely orthogonal-state-based protocols for unidirectional and bidirectional controlled deterministic secure quantum communication. IntroductionIn 1984, Bennett and Brassard proposed a protocol of quantum key distribution (QKD) [1]. The protocol, which is popularly known as BB84 protocol, drew considerable attention of the cryptographic community as the protocol is unconditionally secure. As a consequence, several other protocols of secure quantum communication have been proposed. Interestingly, in the early years of secure quantum communication, only protocols of QKD were proposed [1, 2, 3, 4]. However, it was realized soon that quantum states can be employed to design the protocols for secure direct quantum communication where we can circumvent the prior generation of keys (i.e., QKD), and thus, directly communicate a message by using quantum resources. In the last few years, many such protocols of secure direct quantum communication have been proposed. Such protocols can be classified into two broad classes: (a) protocols for quantum secure direct communication (QSDC) [5,6,7,8] and (b) protocols for deterministic secure quantum communication (DSQC) [9,10,11,12,13,14,15,16]. The difference between DSQC and QSDC is very small. Specifically, in a DSQC protocol Bob (receiver) can decode the secret message sent by Alice (sender) only after the receipt of the additional classical information of at least one bit for each qubit transmitted by Alice. In contrast, no such additional classical information is required in QSDC ([17] and references t...
Abstract-Quantum convolutional coding is a technique for encoding a stream of quantum information before transmitting it over a noisy quantum channel. Two important goals in the design of quantum convolutional encoders are to minimize the memory required by them and to avoid the catastrophic propagation of errors. In a previous paper, we determined minimal-memory, non-catastrophic, polynomial-depth encoders for a few exemplary quantum convolutional codes. In this paper, we elucidate a general technique for finding an encoder of an arbitrary quantum convolutional code such that the encoder possesses these desirable properties. We also provide an elementary proof that these encoders are non-recursive. Finally, we apply our technique to many quantum convolutional codes from the literature.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.