.png){kind=icon}
返回
Boolean satisfiability in quantum compilation
.png){kind=icon}
OA
AI
DOI：10.1098/rsta.2019.0161.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program and the low-level instructions, quantum compilation is split into a multi-stage flow consisting of several layers of abstraction. Several different individual tasks have been proposed for the layers in the flow, many of them are NP-hard. In this article, we will describe the flow and we will propose algorithms based on Boolean satisfiability, which is a good match to tackle such computationally complex problems. This article is part of the theme issue 'Harmonizing energy-autonomous computing and intelligence'.
Keyword:
quantum computing
quantum programming languages
quantum compilation
Boolean satisfiability
logic synthesis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
P
IF:
3.7
论文数:
7.8K
被引数:
2.8W
机构
引用论文
.png){kind=icon}
Application of high-performance liquid chromatography for the estimation of peroxidized phospholipids in spray-dried egg and muscle foods应用高效液相色谱法对喷雾干燥蛋制品和肌肉食品中过氧化物化磷脂的估计
PREAI
分享收藏
查看更多内容