Mathematical formulation of quantum circuit design problems in networks of quantum computers

R. van Houte, J. Mulderij, T. Attema, I. Chiscop, F. Phillipson

Research output: Contribution to journalArticleScientificpeer-review

Abstract

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.

Original languageEnglish
Article number141
Number of pages22
JournalQuantum Information Processing
Volume19
Issue number5
DOIs
Publication statusPublished - 2020

Keywords

  • Distributed quantum computing
  • Nearest neighbour compliant
  • Quantum computation architectures and implementations

Fingerprint

Dive into the research topics of 'Mathematical formulation of quantum circuit design problems in networks of quantum computers'. Together they form a unique fingerprint.

Cite this