For Bell-diagonal states with a<=1/3, successful recurrence EPP guarantees fidelity at least the average input; optimal purification time is earliest or latest depending on noise and figure of merit.
Hardware-Software Co-design for Distributed Quantum Computing
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Distributed quantum computing (DQC) offers a pathway for scaling up quantum computing architectures beyond the confines of a single chip. Entanglement is a crucial resource for implementing non-local operations in DQC, and it is required to allow teleportation of quantum states and gates. Remote entanglement generation in practical systems is probabilistic, has longer duration than that of local operations, and is nondeterministic. Therefore, optimizing the performance of probabilistic remote entanglement generation is critically important for the performance of DQC architectures. In this paper we propose and study a new DQC architecture that combines (1) buffering of successfully generated entanglement, (2) asynchronously attempted entanglement generation, and (3) adaptive scheduling of remote gates based on the entanglement generation pattern. We show that our hardware-software co-design improves both the runtime and the output fidelity under a realistic model of DQC.
fields
quant-ph 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Entanglement Purification in Quantum Networks: Guaranteed Improvement and Optimal Time
For Bell-diagonal states with a<=1/3, successful recurrence EPP guarantees fidelity at least the average input; optimal purification time is earliest or latest depending on noise and figure of merit.