In quantum circuit design, the question arises how to distribute qubits, used in algorithms, over the various quantum computers, and how to order them within a quantum computer. In order to evaluate these problems, we define the global and local reordering problems for distributed quantum computing. We formalise the mathematical problems and model them as integer linear programming problems, to minimise the number of SWAP gates or the number of interactions between different quantum computers. For global reordering, we analyse the problem for various geometries of networks: completely connected networks, general networks, linear arrays and grid-structured networks. For local reordering, in networks of quantum computers, we also define the mathematical optimisation problem.

Additional Metadata
Keywords Distributed quantum computing, Nearest neighbour compliant, Quantum computation architectures and implementations
Persistent URL dx.doi.org/10.1007/s11128-020-02630-8
Journal Quantum Information Processing
Citation
van Houte, R, Mulderij, J, Attema, T, Chiscop, I, & Phillipson, F. (2020). Mathematical formulation of quantum circuit design problems in networks of quantum computers. Quantum Information Processing, 19(5). doi:10.1007/s11128-020-02630-8