Optimized Quantum Circuit Partitioning

Daei, Omid; Navi, Keivan; Zomorodi‐Moghadam, Mariam

doi:10.1007/s10773-020-04633-8

Cited by 29 publications

(19 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then by applying a dynamic programming approach, this graph was partitioned into K parts with the aim to minimize the number of global gates. The authors in [32] also have discussed the issue of reducing the communication cost in a distributed quantum circuit composed of up to three-qubit gates and have presented a new heuristic method to solve it.…”

Section: Related Workmentioning

confidence: 99%

Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

Ghodsollahee

Davarzani

Zomorodi‐Moghadam

et al. 2021

Quantum Inf Process

View full text Add to dashboard Cite

As quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.

show abstract

Section: Related Workmentioning

confidence: 99%

Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

Ghodsollahee

Davarzani

Zomorodi‐Moghadam

et al. 2021

Quantum Inf Process

View full text Add to dashboard Cite

show abstract

“…In [42], we presented a general method to obtain DQCs from QCs, based on reducing the number of quantum teleportations. In this work, we used graph theory to provide a way to distribute properly qubits across different partitions that reduce the communications between them.…”

Section: Related Workmentioning

confidence: 99%

“…By using graph theory to convert the monolithic quantum circuit to the corresponding graph model which was explained in our previous work [42] in detail, and by implementing the method introduced to convert QCs to the optimized and arbitrary partitions, DQC with the desired number of partitions (K) and optimal communications is achieved. The partitions of DQC are shown by P i , and we define them as follow:…”

Section: Proposed Approachmentioning

confidence: 99%

Improving the Teleportation Cost in Distributed Quantum Circuits Based on Commuting of Gates

2021

Self Cite

View full text Add to dashboard Cite

Distributed quantum system is a well-known method to overcome the problems of designing and manufacturing large quantum systems to achieve higher processing power in the world of quantum processing. In distributed quantum computing, a number of limited-capacity quantum circuits communicating with each other through communication channels operate as a large quantum circuit. The most essential step in designing a distributed quantum system is to optimize the communication between the components to reduce the overhead cost of communications. In this study, based on the commuting of quantum gates, an efficient method is proposed to reduce the number of teleportations required to perform distributed quantum circuits (DQCs). The results obtained from the evaluation of our method on benchmark circuits indicate an impressive decrease in the number of teleportations and a significant reduction in the execution time compared to the present methods.

show abstract

“…All possible configurations that could result in such communication reductions were considered. Optimizing the number of teleportation using heuristic methods, dynamic programming approach, and evolutionary algorithm have also been considered in [27][28][29], respectively. An alternative approach is called telegate that executes gates remotely and directly using the quantum entanglement when nodes are in a long distance.…”

Section: Introductionmentioning

confidence: 99%

A general protocol for distributed quantum gates

Sarvaghad-Moghaddam

Zomorodi‐Moghadam

2021

Quantum Inf Process

View full text Add to dashboard Cite

In distributed quantum computation, quantum remote-controlled gates are used frequently and applied on separate nodes or subsystems of a network. One of the universal and well-known controlled gates is the n-qubit controlled-NOT gate, especially Toffoli gate for the case of three qubits, which are frequently used to synthesize quantum circuits. In this paper, we considered a more general case, an n-qubit controlled-U gate, and present a general protocol for implementing these gates remotely with minimum required resources. Then, the proposed method is applied to implement a Toffoli gate in bipartite and tripartite systems. In this method, we considered cases in which a group of qubits belongs to one subsystem of the network. Then, we improved its consumption resources.

show abstract

Optimized Quantum Circuit Partitioning

Cited by 29 publications

References 32 publications

Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

Improving the Teleportation Cost in Distributed Quantum Circuits Based on Commuting of Gates

A general protocol for distributed quantum gates

Contact Info

Product

Resources

About