Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks
Abstract
Distributing quantum circuits across a network of quantum devices is a recent approach to improve the scalability of quantum computation. Entangled pairs of qubits distributed across network nodes are used as a communication resource for executing inter-node (remote) gates. However, establishing these entanglement pairs incurs significant latency, and doing so during the circuit's execution may lead to the decoherence of logical qubits. Instead, it may be beneficial to distribute certain entanglement pairs before the circuit is executed. Thus, we consider the problem of distributing a quantum circuit across a quantum network containing some pre-distributed entanglement pairs and seek to minimize the execution time of the circuit. We address this problem in three steps. First, given the quantum network and (optionally) a probability distribution over training circuits, we determine a set of pre-distributed entanglement pairs under a specified budget. Second, we compute a qubit-to-memory allocation that minimizes the expected execution time given these pre-distributed resources. Finally, we identify any additional entanglement pairs required during execution, generate them concurrently, and execute the circuit gates. We evaluate our methods on a broad range of benchmark circuits.
Versions
Related
- Taking Advantage of Noise in Distributed Random Quantum Circuits
- Entanglement Cost of Optimal Distributed Quantum State Purification
- Distributed variational quantum computing with deterministic entanglement tuning
- Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead
- Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search
BibTeX
@misc{yang2026distributing,
title = {{Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks}},
author = {Yukun Yang and Ranjani G. Sundaram and Himanshu Gupta},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.26099},
eprint = {2610.26099},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.26099},
}
RIS
TY - UNPB
TI - Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks
AU - Yukun Yang
AU - Ranjani G. Sundaram
AU - Himanshu Gupta
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2610.26099
UR - https://arxiv.org/abs/2610.26099
AB - Distributing quantum circuits across a network of quantum devices is a recent approach to improve the scalability of quantum computation. Entangled pairs of qubits distributed across network nodes are used as a communication resource for executing inter-node (remote) gates. However, establishing these entanglement pairs incurs significant latency, and doing so during the circuit's execution may lead to the decoherence of logical qubits. Instead, it may be beneficial to distribute certain entanglement pairs before the circuit is executed. Thus, we consider the problem of distributing a quantum circuit across a quantum network containing some pre-distributed entanglement pairs and seek to minimize the execution time of the circuit. We address this problem in three steps. First, given the quantum network and (optionally) a probability distribution over training circuits, we determine a set of pre-distributed entanglement pairs under a specified budget. Second, we compute a qubit-to-memory allocation that minimizes the expected execution time given these pre-distributed resources. Finally, we identify any additional entanglement pairs required during execution, generate them concurrently, and execute the circuit gates. We evaluate our methods on a broad range of benchmark circuits.
ER -