analiza aiqbench
This paper tackles a practical bottleneck in distributed quantum computing: remote gates between network nodes need entangled qubit pairs, and generating them mid-execution adds latency and risks decoherence. Its approach is to pre-distribute some entanglement before the circuit runs, using a budget and optional training-circuit statistics to choose which pairs to create, then allocating qubits to memory and generating any remaining pairs on demand. The results are benchmark-based simulations, so readers should look for how the gains hold up on real hardware with realistic noise and network parameters.
Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks
arXiv:2610.26099v1 Announce Type: cross 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.
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.
9 pages, 4 figures. Full author version revised after acceptance; includes the cost-aware entanglement consumption section omitted from the QCNC 2026 version to meet the conference page limit
Emerging Technologies (cs.ET); Quantum Physics (quant-ph)
arXiv:2610.26099 [cs.ET]
(or arXiv:2610.26099v1 [cs.ET] for this version)
Proceedings - 2026 International Conference on Quantum Communications, Networking, and Computing (QCNC), pp. 252-258 (2026)
https://doi.org/10.1109/QCNC69040.2026.00043 DOI(s) linking to related resources
Text integral sub licența deschisă a publicației · 246 cuvinte