CITATION.bib

@article{10.1145/3544563,
author = {Nannicini, Giacomo and Bishop, Lev S. and G\"{u}nl\"{u}k, Oktay and Jurcevic, Petar},
title = {Optimal Qubit Assignment and Routing via Integer Programming},
year = {2022},
issue_date = {March 2023},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {4},
number = {1},
issn = {2643-6809},
url = {https://doi.org/10.1145/3544563},
doi = {10.1145/3544563},
abstract = {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.},
journal = {ACM Transactions on Quantum Computing},
month = {oct},
articleno = {7},
numpages = {31},
keywords = {discrete optimization, qubit routing, Quantum compiler, integer programming}
}