The Cost Reduction of Distributed Quantum Factorization Circuits

Abstract

The number of qubits involved in a quantum system increases as the quantum computation is being progressed. Restrictions in monolithic quantum computing systems capacity can be overcome by utilizing the distributed circuits. For the implementation of global gates (two-quibt gates whose control and target qubits belong to different partitions), it is required that one qubit be teleported to the other partition. Teleportation is a costly protocol (it requires sharing entanglement between two partitions), and the number of teleportations required for implement a given distributed circuit is called teleportation cost. It is desirable to distribute a quantum computation in such a way that the teleportation cost is reduced. A previous work has presented a way to optimize distributed quantum circuits in terms of teleportation cost for a predetermined partitioning. In this research, Shore circuit to factor number 15 synthesized in the single-qubit and CNOT gates is provided. After that, the circuit partitioning with the minimal cost of communication is presented.