4.7 Article

A hierarchical approach for building distributed quantum systems

Journal

SCIENTIFIC REPORTS
Volume 12, Issue 1, Pages -

Publisher

NATURE PORTFOLIO
DOI: 10.1038/s41598-022-18989-w

Keywords

-

Ask authors/readers for more resources

This paper proposed a multi-layer hierarchical architecture for distributing quantum computation in a distributed quantum computing (DQC) system using teleportation. The two-level hierarchical optimization method aims to minimize the number of communications among subsystems by distributing qubits among different parts effectively. Experimental results demonstrated that the proposed approach outperforms previous methods in terms of efficiency.
In this paper, a multi-layer hierarchical architecture is proposed for distributing quantum computation. In a distributed quantum computing (DQC), different units or subsystems communicate by teleportation in order to transfer quantum information. Quantum teleportation requires classical and quantum resources and hence, it is essential to minimize the number of communications among these subsystems. To this end, a two-level hierarchical optimization method is proposed to distribute the qubits among different parts. In Level I, an integer linear programming model is presented to distribute a monolithic quantum system into K balanced partitions which results in the minimum number of non-local gates. When a qubit is teleported to a destination part, it can be used optimally by other gates without being teleported back to the destination part. In Level II, a data structure is proposed for quantum circuit and a recursive function is applied to minimize the number of teleportations. Experimental results show that the proposed approach outperforms the previous ones.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available