.png){kind=icon}
.png){kind=icon}
Return
DQC-QR: Distributing and Routing Quantum Circuits with Minimum Execution Time
.png){kind=icon}
PRE
AI
R
H
C
DOI：10.1145/3757069.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is a promising way to circumvent these challenges and facilitate large quantum computations. However, distributed quantum computations require entanglements (to execute remote gates) which can incur significant generation latency and, thus, lead to decoherence of qubits. In this work, we consider the problem of distributing quantum circuits across a quantum network to minimize the execution time. The problem entails mapping the circuit qubits to network memories, including within each computer since limited connectivity within computers can affect the circuit execution time.
Journal
A
IF:
6.8
Papers:
539
Citations:
508
Organization
No organization information available
Cited Papers