A dynamic programming approach for distributing quantum circuits by bipartite graphs

Davarzani, Zohreh; Zomorodi‐Moghadam, Mariam; Houshmand, Mahboobeh; Nouri-Baygi, Mostafa

doi:10.1007/s11128-020-02871-7

Cited by 24 publications

(16 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zomorodi-Moghadam et al [10] proposed a general approach, based on the Kernighan-Lin algorithm for graph partitioning, to optimize the number of teleportations for a distributed quantum computing architecture consisting of two spatially separated and long-distance quantum subsystems. The same authors also proposed an approach based on dynamic programming [41].…”

Section: Engineering Uantummentioning

confidence: 99%

Compiler Design for Distributed Quantum Computing

Ferrari

Cacciapuoti

Amoretti

et al. 2021

IEEE Trans. Quantum Eng.

View full text Add to dashboard Cite

In distributed quantum computing architectures, with the network and communications functionalities provided by the Quantum Internet, remote quantum processing units can communicate and cooperate for executing computational tasks that single, noisy, intermediate-scale quantum devices cannot handle by themselves. To this aim, distributed quantum computing requires a new generation of quantum compilers, for mapping any quantum algorithm to any distributed quantum computing architecture. With this perspective, in this article, we first discuss the main challenges arising with compiler design for distributed quantum computing. Then, we analytically derive an upper bound of the overhead induced by quantum compilation for distributed quantum computing. The derived bound accounts for the overhead induced by the underlying computing architecture as well as the additional overhead induced by the suboptimal quantum compiler-expressly designed in this article to achieve three key features, namely, general-purpose, efficient, and effective. Finally, we validate the analytical results, and we confirm the validity of the compiler design through an extensive performance analysis. INDEX TERMSDistributed quantum computing, distributed quantum systems, quantum compiling, quantum Internet, quantum networks. Engineering uantum Transactions on IEEE Ferrari et al.: COMPILER DESIGN FOR DISTRIBUTED QUANTUM COMPUTING

show abstract

Section: Engineering Uantummentioning

confidence: 99%

Compiler Design for Distributed Quantum Computing

Ferrari

Cacciapuoti

Amoretti

et al. 2021

IEEE Trans. Quantum Eng.

View full text Add to dashboard Cite

show abstract

“…For this reason we assume that all the possible links generate simultaneously and, as soon as all the states are measured, a new round of simultaneous generations begins. Clearly, after that a measurement M generates a boolean b, there is at least one post-processing 10 Assigning logical qubits to physical ones is another critical step for compilation and it deserves dedicated analysis [56], [57], out of the scope of this work.…”

Section: B Modeling the Time Domainmentioning

confidence: 99%

Optimized compiler for Distributed Quantum Computing

Cuomo¹,

Caleffi²,

Krsulich³

et al. 2021

Preprint

View full text Add to dashboard Cite

Practical distributed quantum computing requires the development of efficient compilers, able to make quantum circuits compatible with some given hardware constraints. This problem is known to be tough, even for local computing. Here, we address it on distributed architectures. As generally assumed in this scenario, telegates represent the fundamental remote (interprocessor) operations. Each telegate consists of several tasks: i) entanglement generation and distribution, ii) local operations, and iii) classical communications. Entanglement generations and distribution is an expensive resource, as it is time-consuming and fault-prone. To mitigate its impact, we model an optimization problem that combines running-time minimization with the usage of that resource. Specifically, we provide a parametric ILP formulation, where the parameter denotes a time horizon (or time availability); the objective function count the number of used resources. To minimize the time, a binary search solves the subject ILP by iterating over the parameter. Ultimately, to enhance the solution space, we extend the formulation, by introducing a predicate that manipulates the circuit given in input and parallelizes telegates' tasks.

show abstract

“…A dynamic programming approach to distribute the quantum circuit into K parts was proposed in [31]. In this approach, first the quantum circuit was converted into a bi-partite graph and then the gates and qubits are placed in each part of the graph.…”

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

Self Cite

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

A dynamic programming approach for distributing quantum circuits by bipartite graphs

Cited by 24 publications

References 34 publications

Compiler Design for Distributed Quantum Computing

Compiler Design for Distributed Quantum Computing

Optimized compiler for Distributed Quantum Computing

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

Contact Info

Product

Resources

About