Optimized quantum circuit partitioning

DOI10.1007/S10773-020-04633-8zbMath1462.81042arXiv2005.11614OpenAlexW3096120761MaRDI QIDQ2024874

Mariam Zomorodi-Moghadam, Keivan Navi, Omid Daei

Publication date: 4 May 2021

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.11614

zbMATH Keywords

teleportationdistributedquantum circuitscommunication cost

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Networks and circuits as models of computation; circuit complexity (68Q06) LOCC, teleportation, dense coding, remote state operations, distillation (81P48)

Related Items (3)

A general protocol for distributed quantum gates ⋮ Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization ⋮ Improving the teleportation cost in distributed quantum circuits based on commuting of gates

Uses Software

• RevLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing teleportation cost in distributed quantum circuits
• Balanced graph partitioning
• Quantum physics and geometry
• An evolutionary approach to optimizing teleportation cost in distributed quantum computation
• Quantum computational networks
• An Efficient Heuristic Procedure for Partitioning Graphs
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• An Algebraic Language for Distributed Quantum Computing
• A single quantum cannot be cloned
• Efficient distributed quantum computing

This page was built for publication: Optimized quantum circuit partitioning