Optimized quantum circuit partitioning
From MaRDI portal
Publication:2024874
Networks and circuits as models of computation; circuit complexity (68Q06) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) LOCC, teleportation, dense coding, remote state operations, distillation (81P48) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Abstract: The main objective of this paper is to improve the communication costs in distributed quantum circuits. To this end, we present a method for generating distributed quantum circuits from monolithic quantum circuits in such a way that communication between partitions of a distributed quantum circuit is minimized. Thus, the communication between distributed components is performed at a lower cost. Compared to existing works, our approach can effectively map a quantum circuit into an appropriate number of distributed components. Since teleportation is usually the protocol used to connect components in a distributed quantum circuit, our approach ultimately reduces the number of teleportations. The results of applying our approach to the benchmark quantum circuits determine its effectiveness and show that partitioning is a necessary step in constructing distributed quantum circuit.
Recommendations
- Parallelizing quantum circuits
- scientific article; zbMATH DE number 7774292
- Efficient scheme for optimizing quantum Fourier circuits
- Improving quantum computation by optimized qubit routing
- Quantum circuit optimization by Hadamard gate reduction
- Optimal Quantum Circuits for Nearest-Neighbor Architectures
- Quantum circuits of \texttt{CNOT} gates: optimization and entanglement
- Cost optimization technique for quantum circuits
- Optimising Clifford circuits with quantomatic
Cites work
- A single quantum cannot be cloned
- An Algebraic Language for Distributed Quantum Computing
- An Efficient Heuristic Procedure for Partitioning Graphs
- An evolutionary approach to optimizing teleportation cost in distributed quantum computation
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Balanced graph partitioning
- Balanced partitions of trees and applications
- Efficient distributed quantum computing
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 799789 (Why is no real title available?)
- Optimizing teleportation cost in distributed quantum circuits
- Quantum computational networks
- Quantum physics and geometry
- Security aspects of practical quantum cryptography
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Cited in
(11)- The cost reduction of distributed quantum factorization circuits
- Improving the teleportation cost in distributed quantum circuits based on commuting of gates
- An evolutionary approach to optimizing teleportation cost in distributed quantum computation
- Mathematical formulation of quantum circuit design problems in networks of quantum computers
- A general protocol for distributed quantum gates
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization
- Circuits for Distributing Quantum Measurement
- QuanPath: achieving one-step communication for distributed quantum circuit simulation
- Improving quantum computation by optimized qubit routing
- Optimizing teleportation cost in distributed quantum circuits
This page was built for publication: Optimized quantum circuit partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2024874)
