Improving the teleportation cost in distributed quantum circuits based on commuting of gates
From MaRDI portal
Publication:2239764
Recommendations
- Optimizing teleportation cost in distributed quantum circuits
- Optimization of the transmission cost of distributed quantum circuits based on merged transfer
- An evolutionary approach to optimizing teleportation cost in distributed quantum computation
- Expected Communication Cost of Distributed Quantum Tasks
- A general protocol for distributed quantum gates
- scientific article; zbMATH DE number 7774292
- The cost reduction of distributed quantum factorization circuits
- Communication Links for Distributed Quantum Computation
- QUANTUM CIRCUITS FOR PROBABILISTIC ENTANGLEMENT TELEPORTATION VIA A PARTIALLY ENTANGLED PAIR
Cites work
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- A single quantum cannot be cloned
- An Algebraic Language for Distributed Quantum Computing
- An evolutionary approach to optimizing teleportation cost in distributed quantum computation
- Efficient distributed quantum computing
- Experimental quantum teleportation
- Minimal-Memory Requirements for Pearl-Necklace Encoders of Quantum Convolutional Codes
- Modern cryptography. Applied mathematics for encryption and information security
- Optimized quantum circuit partitioning
- Optimizing teleportation cost in distributed quantum circuits
- Quantum physics and geometry
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Cited in
(2)
This page was built for publication: Improving the teleportation cost in distributed quantum circuits based on commuting of gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239764)