Reordering and Partitioning of Distributed Quantum Circuits
A new approach to reduce the teleportation cost and execution time in Distributed Quantum Circuits (DQCs) was proposed in the present paper. DQCs, a well-known solution, have been applied to solve the problem of maintaining a large number of qubits next to each other. In the distributed quantum syst...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9807294/ |
| _version_ | 1818529810287165440 |
|---|---|
| author | Davood Dadkhah Mariam Zomorodi Seyed Ebrahim Hosseini Pawel Plawiak Xujuan Zhou |
| author_facet | Davood Dadkhah Mariam Zomorodi Seyed Ebrahim Hosseini Pawel Plawiak Xujuan Zhou |
| author_sort | Davood Dadkhah |
| collection | DOAJ |
| description | A new approach to reduce the teleportation cost and execution time in Distributed Quantum Circuits (DQCs) was proposed in the present paper. DQCs, a well-known solution, have been applied to solve the problem of maintaining a large number of qubits next to each other. In the distributed quantum system, the qubits are transferred to another subsystem by a quantum protocol like teleportation. Hence, a novel method was proposed to optimize the number of teleportation and to reduce the execution time for generating DQC. To this end, first, the quantum circuit was reordered according to the qubits placement to improve the computational execution time, and then the quantum circuit was modeled as a graph. Finally, we combined the genetic algorithm (GA) and the modified tabu search algorithm (MTS) to partition the graph model in order to obtain a distributed quantum circuit aimed at reducing the number of teleportation costs. A significant reduction in teleportation cost (TC) and execution time (ET) was obtained in benchmark circuits. In particular, we performed a more accurate optimization than the previous approaches, and the proposed approach yielded the best results for several benchmark circuits. |
| first_indexed | 2024-12-11T17:11:42Z |
| format | Article |
| id | doaj.art-5d6e8113f4db489ba18f02c1fa33e6dc |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-11T17:11:42Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-5d6e8113f4db489ba18f02c1fa33e6dc2022-12-22T00:57:31ZengIEEEIEEE Access2169-35362022-01-0110703297034110.1109/ACCESS.2022.31864859807294Reordering and Partitioning of Distributed Quantum CircuitsDavood Dadkhah0https://orcid.org/0000-0001-6771-9288Mariam Zomorodi1https://orcid.org/0000-0002-1308-3453Seyed Ebrahim Hosseini2Pawel Plawiak3https://orcid.org/0000-0002-4317-2801Xujuan Zhou4https://orcid.org/0000-0002-1736-739XDepartment of Electrical Engineering, Ferdowsi University of Mashhad, Mashhad, IranDepartment of Computer Engineering, Ferdowsi University of Mashhad, Mashhad, IranDepartment of Electrical Engineering, Ferdowsi University of Mashhad, Mashhad, IranDepartment of Computer Science, Faculty of Computer Science and Telecommunications, Cracow University of Technology, Krakow, PolandSchool of Business, University of Southern Queensland, Springfield Campus, Springfield, QLD, AustraliaA new approach to reduce the teleportation cost and execution time in Distributed Quantum Circuits (DQCs) was proposed in the present paper. DQCs, a well-known solution, have been applied to solve the problem of maintaining a large number of qubits next to each other. In the distributed quantum system, the qubits are transferred to another subsystem by a quantum protocol like teleportation. Hence, a novel method was proposed to optimize the number of teleportation and to reduce the execution time for generating DQC. To this end, first, the quantum circuit was reordered according to the qubits placement to improve the computational execution time, and then the quantum circuit was modeled as a graph. Finally, we combined the genetic algorithm (GA) and the modified tabu search algorithm (MTS) to partition the graph model in order to obtain a distributed quantum circuit aimed at reducing the number of teleportation costs. A significant reduction in teleportation cost (TC) and execution time (ET) was obtained in benchmark circuits. In particular, we performed a more accurate optimization than the previous approaches, and the proposed approach yielded the best results for several benchmark circuits.https://ieeexplore.ieee.org/document/9807294/Quantum computingdistributed quantum circuitoptimizationgenetic algorithmteleportation |
| spellingShingle | Davood Dadkhah Mariam Zomorodi Seyed Ebrahim Hosseini Pawel Plawiak Xujuan Zhou Reordering and Partitioning of Distributed Quantum Circuits IEEE Access Quantum computing distributed quantum circuit optimization genetic algorithm teleportation |
| title | Reordering and Partitioning of Distributed Quantum Circuits |
| title_full | Reordering and Partitioning of Distributed Quantum Circuits |
| title_fullStr | Reordering and Partitioning of Distributed Quantum Circuits |
| title_full_unstemmed | Reordering and Partitioning of Distributed Quantum Circuits |
| title_short | Reordering and Partitioning of Distributed Quantum Circuits |
| title_sort | reordering and partitioning of distributed quantum circuits |
| topic | Quantum computing distributed quantum circuit optimization genetic algorithm teleportation |
| url | https://ieeexplore.ieee.org/document/9807294/ |
| work_keys_str_mv | AT davooddadkhah reorderingandpartitioningofdistributedquantumcircuits AT mariamzomorodi reorderingandpartitioningofdistributedquantumcircuits AT seyedebrahimhosseini reorderingandpartitioningofdistributedquantumcircuits AT pawelplawiak reorderingandpartitioningofdistributedquantumcircuits AT xujuanzhou reorderingandpartitioningofdistributedquantumcircuits |