TY - JOUR
T1 - Mathematical formulation of quantum circuit design problems in networks of quantum computers
AU - Houte, Roy van
AU - Mulderij, Jesse
AU - Attema, Thomas
AU - Chiscop, Irina
AU - Phillipson, Frank
N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2020/3/17
Y1 - 2020/3/17
N2 - 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.
AB - 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.
KW - Distributed quantum computing
KW - Nearest neighbour compliant
KW - Quantum computation architectures and implementations
U2 - 10.1007/S11128-020-02630-8
DO - 10.1007/S11128-020-02630-8
M3 - Article
SN - 1570-0755
VL - 19
JO - Quantum Information Processing
JF - Quantum Information Processing
IS - 5
M1 - 141
ER -