Exploiting Quantum Teleportation in Quantum Circuit Mapping
Quantum computers are constantly growing in their number of qubits, but
continue to suffer from restrictions such as the limited pairs of qubits that
may interact with each other. Thus far, this problem is addressed by mapping
and moving qubits to suitable positions for the interaction (known as quantum
circuit mapping). However, this movement requires additional gates to be
incorporated into the circuit, whose number should be kept as small as possible
since each gate increases the likelihood of errors and decoherence.
State-of-the-art mapping methods utilize swapping and bridging to move the
qubits along the static paths of the coupling map---solving this problem
without exploiting all means the quantum domain has to offer. In this paper, we
propose to additionally exploit quantum teleportation as a possible
complementary method. Quantum teleportation conceptually allows to move the
state of a qubit over arbitrary long distances with constant
overhead---providing the potential of determining cheaper mappings. The
potential is demonstrated by a case study on the IBM Q Tokyo architecture which
already shows promising improvements. With the emergence of larger quantum
computing architectures, quantum teleportation will become more effective in
generating cheaper mappings.
Stefan Hillmich Alwin Zulehner Robert Wille