Separation of gates in quantum parallel programming

TL;DR

This paper investigates the theoretical conditions for separating quantum gates in multipartite systems and demonstrates experimental separation of n-qubit gates on IBM quantum computers to enable scalable quantum parallel programming.

Contribution

It provides the first comprehensive analysis of separability conditions for quantum gates and applies this to practical experiments on existing quantum hardware.

Findings

Derived necessary and sufficient conditions for gate separability.

Successfully separated n-qubit gates on IBM quantum computers.

Enhanced understanding of quantum gate decomposition for parallel computing.

Abstract

The number of qubits in current quantum computers is a major restriction on their wider application. To address this issue, Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming ([M. S. Ying, Morgan-Kaufmann, 2016]). In doing so, the main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates. In this study, we theoretically analyse the (sufficient and necessary) separability conditions of multipartite quantum gates in finite or infinite dimensional systems. We then conduct separation experiments with n-qubit quantum gates on IBM quantum computers using QSI software.