TY - GEN
T1 - Distributing Quantum Circuits using Pre-Distributed Entanglement Pairs over Quantum Networks
AU - Yang, Yukun
AU - Sundaram, Ranjani G.
AU - Gupta, Himanshu
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - 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 circuit execution may lead to decoherence of logical qubits. Instead, it may be beneficial to proactively distribute certain entanglement pairs a priori (before execution begins). Thus, we consider the problem of distributing a quantum circuit over a quantum network with pre-distributed entanglement pairs, and seek to minimize the circuit's execution time. We develop algorithms for (i) allocating a limited predistribution budget across memory pairs (optionally guided by a training-circuit distribution) and (ii) computing a static qubit-to-memory allocation that exploits the resulting pre-distributed resources to reduce execution time. We evaluate the proposed methods in NetSquid under a telegate-based execution model on standard benchmark circuit families.
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 circuit execution may lead to decoherence of logical qubits. Instead, it may be beneficial to proactively distribute certain entanglement pairs a priori (before execution begins). Thus, we consider the problem of distributing a quantum circuit over a quantum network with pre-distributed entanglement pairs, and seek to minimize the circuit's execution time. We develop algorithms for (i) allocating a limited predistribution budget across memory pairs (optionally guided by a training-circuit distribution) and (ii) computing a static qubit-to-memory allocation that exploits the resulting pre-distributed resources to reduce execution time. We evaluate the proposed methods in NetSquid under a telegate-based execution model on standard benchmark circuit families.
KW - distributed quantum circuits
KW - entanglement pre-distribution
KW - quantum networks
UR - https://www.scopus.com/pages/publications/105040792604
U2 - 10.1109/QCNC69040.2026.00043
DO - 10.1109/QCNC69040.2026.00043
M3 - Conference contribution
AN - SCOPUS:105040792604
T3 - Proceedings - 2026 International Conference on Quantum Communications, Networking, and Computing, QCNC 2026
SP - 252
EP - 258
BT - Proceedings - 2026 International Conference on Quantum Communications, Networking, and Computing, QCNC 2026
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd International Conference on Quantum Communications, Networking, and Computing, QCNC 2026
Y2 - 6 April 2026 through 8 April 2026
ER -