Motivated by the promises of significant speed-ups for certain problems, quantum computing received significant attention in the past. While much progress has been made in the development of synthesis methods for quantum cir cuits, new physical developments constantly lead to new constraints to be addressed. The limited interaction dis tance between the respective qubits (i.e. nearest neigh bor optimization) has already been considered intensely. But with the emerge of multi-dimensional quantum ar chitectures, 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 multi dimensional quantum circuits. Although the complexity of the problem is a serious obstacle, our experimental eval uation shows that the proposed solution is sufficient to allow for a qualitative evaluation of the respective opti mization steps. Besides that, this enabled an exact com parison to heuristical results for the first time.978-1-4799-7792-5/15/$31.00 ©2015 IEEE

No abstract

No abstract

No abstract

No abstract