Optimizing teleportation cost in distributed quantum circuits
From MaRDI portal
Publication:726009
Abstract: The presented work provides a procedure for optimizing the communication cost of a distributed quantum circuit (DQC) in terms of the number of qubit teleportations. Because of technology limitations which do not allow large quantum computers to work as a single processing element, distributed quantum computation is an appropriate solution to overcome this difficulty. Previous studies have applied ad-hoc solutions to distribute a quantum system for special cases and applications. In this study, a general approach is proposed to optimize the number of teleportations for a DQC consisting of two spatially separated and long-distance quantum subsystems. To this end, different configurations of locations for executing gates whose qubits are in distinct subsystems are considered and for each of these configurations, the proposed algorithm is run to find the minimum number of required teleportations. Finally, the configuration which leads to the minimum number of teleportations is reported. The proposed method can be used as an automated procedure to find the configuration with the optimal communication cost for the DQC.
Recommendations
- An evolutionary approach to optimizing teleportation cost in distributed quantum computation
- Optimized quantum circuit partitioning
- Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization
- The cost reduction of distributed quantum factorization circuits
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
Cites work
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- A single quantum cannot be cloned
- An Algebraic Language for Distributed Quantum Computing
- An Efficient Heuristic Procedure for Partitioning Graphs
- Efficient distributed quantum computing
- Experimental quantum teleportation
- Improving the fidelity of teleportation through noisy channels using weak measurement
- Minimal-Memory Requirements for Pearl-Necklace Encoders of Quantum Convolutional Codes
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum computation and quantum information. 10th anniversary edition
- Security aspects of practical quantum cryptography
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Cited in
(13)- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- Quantum cost optimization algorithm for entanglement-based asymmetric quantum error correction
- Routing strategy for distributed quantum circuit based on optimized gate transmission direction
- The cost reduction of distributed quantum factorization circuits
- Controlled joint remote preparation of an arbitrary \(N\)-qubit state
- 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
- Improving the teleportation cost in distributed quantum circuits based on commuting of gates
- Two forms schemes of deterministic remote state preparation for four-qubit cluster-type state
- A low complexity scheme for entanglement distributor buses
- An evolutionary approach to optimizing teleportation cost in distributed quantum computation
This page was built for publication: Optimizing teleportation cost in distributed quantum circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726009)
