Sciweavers

ASPDAC
2015
ACM

Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits

8 years 8 months ago
Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits
Motivated by the promises of signicant speed-ups for certain problems, quantum computing received signicant attention in the past. While much progress has been made in the development of synthesis methods for quantum circuits, new physical developments constantly lead to new constraints to be addressed. The limited interaction distance between the respective qubits (i.e. nearest neighbor optimization) has already been considered intensely. But with the emerge of multi-dimensional quantum architectures, new physical requirements came up for which only a few automatic synthesis solutions exist yet  all of them of heuristic nature. In this work, we propose an exact scheme for nearest neighbor optimization in multidimensional quantum circuits. Although the complexity of the problem is a serious obstacle, our experimental evaluation shows that the proposed solution is sucient to allow for a qualitative evaluation of the respective optimization steps. Besides that, this enabled an exact...
Aaron Lye, Robert Wille, Rolf Drechsler
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where ASPDAC
Authors Aaron Lye, Robert Wille, Rolf Drechsler
Comments (0)