Optimizing teleportation cost in distributed quantum circuits
From MaRDI portal
Publication:726009
DOI10.1007/S10773-017-3618-XzbMATH Open1394.81091arXiv1605.07935OpenAlexW2407786468MaRDI QIDQ726009FDOQ726009
Authors: Mariam Zomorodi-Moghadam, Mahboobeh Houshmand, Monireh Houshmand 
Publication date: 2 August 2018
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1605.07935
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
Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Analytic circuit theory (94C05)
Cites Work
- An Efficient Heuristic Procedure for Partitioning Graphs
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A single quantum cannot be cloned
- Quantum computation and quantum information. 10th anniversary edition
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Experimental quantum teleportation
- Security aspects of practical quantum cryptography
- Improving the fidelity of teleportation through noisy channels using weak measurement
- An Algebraic Language for Distributed Quantum Computing
- Minimal-Memory Requirements for Pearl-Necklace Encoders of Quantum Convolutional Codes
- Efficient distributed quantum computing
Cited In (13)
- A general protocol for distributed quantum gates
- Improving the teleportation cost in distributed quantum circuits based on commuting of gates
- Optimized quantum circuit partitioning
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- Two forms schemes of deterministic remote state preparation for four-qubit cluster-type state
- An evolutionary approach to optimizing teleportation cost in distributed quantum computation
- Quantum cost optimization algorithm for entanglement-based asymmetric quantum error correction
- Routing strategy for distributed quantum circuit based on optimized gate transmission direction
- A low complexity scheme for entanglement distributor buses
- Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization
- Controlled joint remote preparation of an arbitrary \(N\)-qubit state
- The cost reduction of distributed quantum factorization circuits
- Optimization of the transmission cost of distributed quantum circuits based on merged transfer
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)
