Distributed quantum computing: A survey

Caleffi, Marcello; Amoretti, Michele; Ferrari, Davide; Illiano, Jessica; Manzalini, Antonio; Cacciapuoti, Angela Sara

doi:10.1016/j.comnet.2024.110672

Cited by 10 publications

References 85 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Multi-objective simulated annealing-based quantum circuit cutting for distributed quantum computation

Hou,

Zhu,

Sun

2024

Phys. Scr.

View full text Add to dashboard Cite

In the current noisy intermediate-scale quantum (NISQ) era, the number of qubits and the depth of quantum circuits in a quantum computer are limited because of complex operation among increasing number of qubits, low-fidelity quantum gates under noise, and short coherence time of physical qubits. However, with distributed quantum computation (DQC) in which multiple small-scale quantum computers cooperate, large-scale quantum circuits can be implemented. In DQC, it is a key step to decompose large-scale quantum circuits into several small-scale subcircuits equivalently. In this paper, we propose a quantum circuit cutting scheme for the circuits consisting of only single-qubit gates and two-qubit gates. In the scheme, the minimum number of non-local gates and the minimum rounds of subcircuits operation are obtained by using the multi-objective simulated annealing (MOSA) algorithm to cluster the gates and to choose the cutting positions whilst using non-local gates. A reconstruction process is also proposed to calculate the probability distribution of output states of the original circuit. As an example, the 7-qubit circuit of Shor algorithm factoring 15 is used to verify the algorithm. Five cutting schemes are recommended, which can be selected according to practical requirements. Compared with the results of the mixing integer programming (MIP) algorithm, the number of execution rounds is efficiently reduced by slightly increasing the number of nonlocal gates.

show abstract

Multi-objective simulated annealing-based quantum circuit cutting for distributed quantum computation

Hou,

Zhu,

Sun

2024

Phys. Scr.

View full text Add to dashboard Cite

show abstract

Entanglement distribution through separable states via a zero-added-loss photon multiplexing inspired protocol

Campbell,

Hawkins,

Zicari

et al. 2024

Phys. Rev. Research

View full text Add to dashboard Cite

The recently proposed zero-added-loss multiplexing (ZALM) source of entangled photons enables higher efficiency in entanglement distribution than spontaneous parametric down-conversion sources and can be carried out using both space-to-ground and ground-to-ground links. We demonstrate the flexibility of ZALM architectures to be adapted to alternative entanglement distribution protocols. Focusing on the counterintuitive result that entanglement can be generated between distant parties without using any entanglement as a resource, we analyze two protocols for entanglement distribution to memories via separable states. Modeling them in a ZALM setup, we consider the effects of noise both in the communication channels and in the memories. We thereby identify the optimal protocol to use with respect to the highest entanglement generated, given the noise conditions of the network. Published by the American Physical Society 2024

show abstract