An evolutionary approach to optimizing teleportation cost in distributed quantum computation
From MaRDI portal
Abstract: Distributed quantum computing has been well-known for many years as a system composed of a number of small-capacity quantum circuits. Limitations in the capacity of monolithic quantum computing systems can be overcome by using distributed quantum systems which communicate with each other through known communication links. In our previous study, an algorithm with an exponential complexity was proposed to optimize the number of qubit teleportations required for the communications between two partitions of a distributed quantum circuit. In this work, a genetic algorithm is used to solve the optimization problem in a more efficient way. The results are compared with the previous study and we show that our approach works almost the same with a remarkable speed-up. Moreover, the comparison of the proposed approach based on GA with a random search over the search space verifies the effectiveness of GA.
Recommendations
- Optimizing teleportation cost in distributed quantum circuits
- Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization
- Optimized quantum circuit partitioning
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- The cost reduction of distributed quantum factorization circuits
Cites work
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- A large population size can be unhelpful in evolutionary algorithms
- An Algebraic Language for Distributed Quantum Computing
- An Efficient Heuristic Procedure for Partitioning Graphs
- Communication Links for Distributed Quantum Computation
- Efficient distributed quantum computing
- Experimental quantum teleportation
- Exploration and exploitation in evolutionary algorithms: a survey
- Optimizing teleportation cost in distributed quantum circuits
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computing: a short course from theory to experiment
- Quantum cryptography based on Bell’s theorem
Cited in
(10)- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- Routing strategy for distributed quantum circuit based on optimized gate transmission direction
- The cost reduction of distributed quantum factorization circuits
- Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization
- A general protocol for distributed quantum gates
- Optimized quantum circuit partitioning
- Optimization of the transmission cost of distributed quantum circuits based on merged transfer
- Teleportation of an arbitrary two-qubit state via four-qubit cluster state in noisy environment
- Optimizing teleportation cost in distributed quantum circuits
- Improving the teleportation cost in distributed quantum circuits based on commuting of gates
This page was built for publication: An evolutionary approach to optimizing teleportation cost in distributed quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2308427)
