.png){kind=icon}
返回
Best Approximate Quantum Compiling Problems
.png){kind=icon}
OA
AI
DOI：10.1145/3505181.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the problem of finding the best approximate circuit that is the closest (in some pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like gate alphabet and connectivity. We look at the problem in the CNOT+rotation gate set from a mathematical programming standpoint, offering contributions both in terms of understanding the mathematics of the problem and its efficient solution. Among the results that we present, we are able to derive a 14-CNOT 4-qubit Toffoli decomposition from scratch, and show that the Quantum Shannon Decomposition can be compressed by a factor of two without practical loss of fidelity.
Keyword:
ELEMENTARY GATES
ALGORITHM
CLIFFORD
CIRCUITS
期刊
A
IF:
6.8
论文数:
539
被引数:
508
机构
引用论文
.png){kind=icon}
Impact and implications of the Afro-Eurasian collision south of Cyprus from reflection seismic data
PREAI
分享收藏分享收藏分享收藏
分享收藏
查看更多内容