A dynamic programming approach for distributing quantum circuits by bipartite graphs
From MaRDI portal
Publication:2684320
DOI10.1007/s11128-020-02871-7OpenAlexW3088557189MaRDI QIDQ2684320
Zohreh Davarzani, Mahboobeh Houshmand, Mariam Zomorodi-Moghadam, Mostafa Nouri-Baygi
Publication date: 16 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.01052
Related Items (6)
A general protocol for distributed quantum gates ⋮ Optimization of the transmission cost of distributed quantum circuits based on merged transfer ⋮ XIRAC-Q: a near-real-time quantum operating system scheduling structure based on Shannon information theorem ⋮ Routing strategy for distributed quantum circuit based on optimized gate transmission direction ⋮ 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
Cites Work
- Unnamed Item
- Optimizing teleportation cost in distributed quantum circuits
- Balanced graph partitioning
- Parallelizing quantum circuits
- Spectral clustering based on local linear approximations
- An evolutionary approach to optimizing teleportation cost in distributed quantum computation
- Steane code single qubit Clifford gates
- Quantum computational networks
- Quantum Computation and Quantum Information
- Exponential algorithmic speedup by a quantum walk
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- An Algebraic Language for Distributed Quantum Computing
- A single quantum cannot be cloned
- Efficient distributed quantum computing
This page was built for publication: A dynamic programming approach for distributing quantum circuits by bipartite graphs
