### 抄録

We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and the network topology. The tradeoff of choosing between gates executed remotely, through "teleported gates" on entangled pairs of qubits (telegate), versus exchanging the relevant qubits via quantum teleportation, then executing the algorithm using local gates (teledata), is examined. We show that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized. A node size of only a few logical qubits performs adequately provided that the nodes have two transceiver qubits. A linear network topology performs acceptably for a broad range of system sizes and performance parameters. We therefore recommend pursuing small, high-I/O bandwidth nodes and a simple network. Such a machine will run Shor's algorithm for factoring large numbers efficiently.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Proceedings - International Symposium on Computer Architecture |

ページ | 354-365 |

ページ数 | 12 |

巻 | 2006 |

DOI | |

出版物ステータス | Published - 2006 |

イベント | 33rd International Symposium on Computer Architecture, ISCA 2006 - Boston, MA, United States 継続期間: 2006 6 17 → 2006 6 21 |

### Other

Other | 33rd International Symposium on Computer Architecture, ISCA 2006 |
---|---|

国 | United States |

市 | Boston, MA |

期間 | 06/6/17 → 06/6/21 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### これを引用

*Proceedings - International Symposium on Computer Architecture*(巻 2006, pp. 354-365). [1635966] https://doi.org/10.1109/ISCA.2006.19

**Distributed arithmetic on a quantum multicomputer.** / Van Meter, Rodney D; Munro, W. J.; Nemoto, Kae; Itoh, Kohei M.

研究成果: Conference contribution

*Proceedings - International Symposium on Computer Architecture.*巻. 2006, 1635966, pp. 354-365, 33rd International Symposium on Computer Architecture, ISCA 2006, Boston, MA, United States, 06/6/17. https://doi.org/10.1109/ISCA.2006.19

}

TY - GEN

T1 - Distributed arithmetic on a quantum multicomputer

AU - Van Meter, Rodney D

AU - Munro, W. J.

AU - Nemoto, Kae

AU - Itoh, Kohei M

PY - 2006

Y1 - 2006

N2 - We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and the network topology. The tradeoff of choosing between gates executed remotely, through "teleported gates" on entangled pairs of qubits (telegate), versus exchanging the relevant qubits via quantum teleportation, then executing the algorithm using local gates (teledata), is examined. We show that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized. A node size of only a few logical qubits performs adequately provided that the nodes have two transceiver qubits. A linear network topology performs acceptably for a broad range of system sizes and performance parameters. We therefore recommend pursuing small, high-I/O bandwidth nodes and a simple network. Such a machine will run Shor's algorithm for factoring large numbers efficiently.

AB - We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and the network topology. The tradeoff of choosing between gates executed remotely, through "teleported gates" on entangled pairs of qubits (telegate), versus exchanging the relevant qubits via quantum teleportation, then executing the algorithm using local gates (teledata), is examined. We show that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized. A node size of only a few logical qubits performs adequately provided that the nodes have two transceiver qubits. A linear network topology performs acceptably for a broad range of system sizes and performance parameters. We therefore recommend pursuing small, high-I/O bandwidth nodes and a simple network. Such a machine will run Shor's algorithm for factoring large numbers efficiently.

UR - http://www.scopus.com/inward/record.url?scp=33845911703&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33845911703&partnerID=8YFLogxK

U2 - 10.1109/ISCA.2006.19

DO - 10.1109/ISCA.2006.19

M3 - Conference contribution

AN - SCOPUS:33845911703

SN - 076952608X

SN - 9780769526089

VL - 2006

SP - 354

EP - 365

BT - Proceedings - International Symposium on Computer Architecture

ER -