English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Distributed quantum computing is motivated by the difficulty in buildinglarge-scale, individual quantum computers. To solve that problem, a largequantum circuit is partitioned and distributed to small quantum computers forexecution. Partitions running on different quantum computers share quantuminformation using entangled Bell pairs. However, entanglement generation andpurification introduces both a runtime and memory overhead on distributedquantum computing. In this paper we study that trade-off by proposing twotechniques for partitioning large quantum circuits and for distribution tosmall quantum computers. Our techniques map a quantum circuit to a graphrepresentation. We study two approaches: one that considers only gateteleportation, and another that considers both gate and state teleportation toachieve the distributed execution. Then we apply the METIS graph partitioningalgorithm to obtain the partitions and the number of entanglement requestsbetween them. We use the SeQUeNCe quantum communication simulator to measurethe time required for generating all the entanglements required to execute thedistributed circuit. We find that the best partitioning technique will dependon the specific circuit of interest.

Towards Distributed Quantum Computing by Qubit and Gate Graph Partitioning Techniques