Although this decade is witnessing tremendous advancements in fabrication technologies for quantum circuits, this industry is facing several design challenges and technological constraints. Nearest Neighbor (NN) enforcement is one such design constraint that demands the physical qubits to be adjacent. In the last couple of years, this domain has made progress starting from designing advanced algorithms to improved synthesis methodologies, even though developing efficient design solutions remains an active area of research.

Here, we propose such a synthesis technique that efficiently transforms quantum circuits to NN designs. To find the NN solution, we have taken help of an ant colony algorithm which completes the circuit conversion in two phases: in the first phase, it finds the global qubit ordering for the input circuit and, in the second phase, a heuristic driven look-ahead scheme is executed for local reordering of gates. The proposed algorithm is first fitted into a 1D design and, later, mapped to 2D and 3D configurations. The combination of such heuristic and the meta-heuristic schemes has resulted promising solutions in the transformation of quantum circuits to NN-compliant architectures. We have tested our algorithm over a wide spectrum of benchmarks and comparisons with state-of-the-art design approaches showed considerable improvements.

尽管这十年见证了量子电路制造技术的巨大进步，但该行业仍面临着一些设计挑战和技术约束。最近邻居（NN）强制是一种这样的设计约束，它要求物理量子位相邻。在过去的几年中，尽管开发有效的设计解决方案仍然是研究的活跃领域，但从设计高级算法到改进的综合方法学，该领域已经取得了进展。

在这里，我们提出了一种有效地将量子电路转换为NN设计的合成技术。为了找到神经网络解决方案，我们采用了蚁群算法，该算法可以分两个阶段完成电路转换：在第一阶段，它找到输入电路的全局量子位排序，在第二阶段，找到启发式驱动外观执行预先计划以对门进行本地重新排序。所提出的算法首先适合1D设计，然后映射到2D和3D配置。这种启发式和元启发式方案的结合已经产生了将量子电路转换为符合NN的体系结构的有前途的解决方案。我们已经在广泛的基准测试中测试了我们的算法，并且与最新设计方法进行的比较显示出了可观的改进。