.png){kind=icon}
返回
Optimality Study of Existing Quantum Computing Layout Synthesis Tools
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2020.3009140.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Layout synthesis, an important step in quantum computing, processes quantum circuits to satisfy device layout constraints. In this paper, we construct QUEKO benchmarks for this problem, which have known optimal depths and gate counts. We use QUEKO to evaluate the optimality of current layout synthesis tools, including Cirq from Google, Qiskit from IBM, tjketi from Cambridge Quantum Computing, and a recent academic work. To our surprise, despite over a decade of research and development by academia and industry on compilation and synthesis for quantum circuits, we are still able to demonstrate large optimality gaps: 1.5-12x on average on a smaller device and 5-45x on average on a larger device. This suggests substantial room for improvement of the efficiency of quantum computer by better layout synthesis tools. Finally, we also prove the NP-completeness of the layout synthesis problem for quantum computing. We have made the QUEKO benchmarks open-source.
Keyword:
Quantum computing
layout
placement and routing
scheduling
allocation
optimality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
引用论文
Seed and agronomic QTL in low linolenic acid, lipoxygenase-free soybean (Glycine max(L.) Merrill) germplasm.png)
Genome
GenomeIF0
PREAI
分享收藏K-edge XANES analysis of sulfur compounds: an investigation of the relative intensities using internal calibrationK-硫化合物的边缘XANES分析: 使用内部校准对相对强度的研究OAAI
OAAI分享收藏
查看更多内容