.png){kind=icon}
返回
Optimal Qubit Assignment and Routing via Integer Programming
.png){kind=icon}
OA
AI
DOI：10.1145/3544563.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of mapping a logical quantum circuit onto a given hardware with limited 2-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables that includes the initial allocation of qubits and their routing. We consider several cost functions: an approximation of the fidelity of the circuit, its total depth, and a measure of cross-talk, all of which can be incorporated in the model. Numerical experiments on synthetic data and different hardware topologies indicate that the error rate and depth can be optimized simultaneously without significant loss. We test our algorithm on a large number of quantum volume circuits, optimizing for error rate and depth; our algorithm significantly reduces the number of CNOTs compared to Qiskit's default transpiler SABRE [19] and produces circuits that, when executed on hardware, exhibit higher fidelity.
Keyword:
Quantum compiler
qubit routing
discrete optimization
integer programming
期刊
A
IF:
6.8
论文数:
540
被引数:
508
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容