Abstract
In the present work, a novel approach was proposed to optimize the teleportation cost in Distributed Quantum Circuits (DQCs) by applying a new approach. To overcome the difficulty with keeping a large number of qubits next to each other, DQCs, as a well-known solution, have always been employed. In a distributed quantum system, qubits are transferred from a subsystem to another subsystem by a quantum protocol such as teleportation. First, we proposed a heuristic approach through which we could replace the equivalent circuits in the initial quantum circuit. Then, we used a genetic algorithm to partition the placement of qubits so that the number of teleportations could be optimized for the communications of a DQC. Finally, results showed that the proposed approach could impressively work.
Highlights
In the field of computation, Quantum computing is a novel subject with a high capacity to perform classical computing more efficiently [1]
We implemented a new approach to optimize the number of teleportations in Distributed Quantum Circuits (DQCs)
We found that optimization of DQCs can be applied in different quantum circuits
Summary
In the field of computation, Quantum computing is a novel subject with a high capacity to perform classical computing more efficiently [1]. A distributed quantum circuit is a model in which each subsystem has limited number of qubits. Teleportation is a process for communication between subsystems of a DQC It is known as the basis of quantum information theory. To this end, we proposed a new method in which the equivalent circuits were first replaced in the initial quantum circuit to reduce its gates. We used teleportation, the basis of quantum information theory, for transferring qubits between subsystems in the DQCs. In this work, quantum circuits, as a Benchmark, were selected from RevLib website for optimization process [9].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.