Using \pi DDs for Nearest Neighbor Optimization of Quantum Circuits
Using \pi DDs for Nearest Neighbor Optimization of Quantum Circuits
复制标题
使用 pi DD 进行量子电路的最近邻优化
DOI：
10.1007/978-3-319-40578-0_14
复制
发表时间：
2016
影响因子：
8.6
通讯作者：
S. Minato
中科院分区：
文献类型：
--
作者：
R. Wille;Nils Quetschlich;Yuma Inoue;Norihito Yasuda;S. Minato
量子电路开发的最新成就推动了量子电路计算机辅助设计的研究。在这里，如何考虑一般的物理约束，特别是所谓的最近邻约束是最近发展的目标。因此，对电路中给定的量子位进行重新排序提供了一种通用策略，以降低相应的成本。但由于这导致了极大的复杂性，现有的解决方案要么仅针对单个订单（因此排除了更好的选项），要么在考虑所有可能的选项时遭受高运行时间的困扰。在这项工作中，我们提供了一种替代方案，利用所谓的 \(\pi \)DD 来实现此目的。它们允许有效地表示和操作排列集，因此为所考虑的问题提供了理想的数据结构。实验评估证实，通过利用 \(\pi \)DD，可以在精确解所需时间的一小部分内生成最佳或几乎最佳的结果。
Recent accomplishments in the development of quantum circuits motivated research in Computer-Aided Design for quantum circuits. Here, how to consider physical constraints in general and so-called nearest neighbor constraints in particular is an objective of recent developments. Re-ordering the given qubits in a circuit provides thereby a common strategy in order to reduce the corresponding costs. But since this leads to a significant complexity, existing solutions either worked towards a single order only (and, hence, exclude better options) or suffer from high runtimes when considering all possible options. In this work, we provide an alternative which utilizes so-called \(\pi \)DDs for this purpose. They allow for the efficient representation and manipulation of sets of permutations and, hence, provide the ideal data-structure for the considered problem. Experimental evaluations confirm that, by utilizing \(\pi \)DDs, optimal or almost optimal results can be generated in a fraction of the time needed by exact solutions.
影响因子：
2.9
作者：
David A. Herrera-Mart'i;A. Fowler;D. Jennings;T. Rudolph
通讯作者：
David A. Herrera-Mart'i;A. Fowler;D. Jennings;T. Rudolph