Automated window-based partitioning of quantum circuits

Nikahd, Eesa; Mohammadzadeh, Naser; Sedighi, Mehdi; Zamani, Morteza Saheb

doi:10.1088/1402-4896/abd57c

Cited by 11 publications

(10 citation statements)

References 54 publications

(61 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We implemented our method in MATLAB on a Core i7 CPU operating at 1.8 GHz with 8 GB of memory. We used many circuits to compare the performance of the proposed method with previous approaches: that of 39 , the dynamic programming approach of 38 , the evolutionary algorithm of 40 , the automated approach of 20 and the windows-based method of 46 . The benchmark circuits are given from 48 (the circuits from 1 to10), Revlib 47 (the circuits from 11 to 15 and 26 to 31), some quantum error-correction encoding circuits 49 (the circuits from 16 to 25) and n-qubit Quantum Fourier Transform circuits (QFT) 50 where .…”

Section: Resultsmentioning

confidence: 99%

“…First, Table 3 shows the number of teleportations in comparison with the windows-based approach of 46 . In this table, the number of qubits, gates and partitions are given in Columns 3, 4 and 5.…”

Section: Resultsmentioning

confidence: 99%

“…An automated Windows-Based method was proposed in 46 . In that study, the gate and qubit teleportation concept were combined with each other to minimize communication cost efficiently.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A hierarchical approach for building distributed quantum systems

Davarzani

Zomorodi‐Moghadam

Houshmand

2022

Sci Rep

View full text Add to dashboard Cite

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.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A hierarchical approach for building distributed quantum systems

Davarzani

Zomorodi‐Moghadam

Houshmand

2022

Sci Rep

View full text Add to dashboard Cite

show abstract

“…In another work [33], the authors presented an efficient partitioning approach to minimize the communication cost. They combined both gate and qubit teleportation concepts to minimize the number of teleportations.…”

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

“…Here, we consider the compilation problem [9], which is generally tough to solve, even on single processor, where an NP-hardness proof is available [10]. An ever growing literature is available, with a variety of proposals for local computing [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24] and for distributed computing [25], [26], [27], [9], [28], [29], [30], [31], [32], [33], [34].…”

Section: Introductionmentioning

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

Automated window-based partitioning of quantum circuits

Cited by 11 publications

References 54 publications

A hierarchical approach for building distributed quantum systems

A hierarchical approach for building distributed quantum systems

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

Optimized compiler for Distributed Quantum Computing

Contact Info

Product

Resources

About