Qubit allocation as a combination of subgraph isomorphism and token swapping

Abstract : In 2016, the first quantum processors have been made available to the general public. The possibility of programming an actual quantum device has elicited much enthusiasm. Yet, such possibility also brought challenges. One challenge is the so called Qubit Allocation problem: the mapping of a virtual quantum circuit into an actual quantum architecture. There exist solutions to this problem; however, in our opinion, they fail to capitalize on decades of improvements on graph theory. In contrast, this paper shows how to model qubit allocation as the combination of Subgraph Isomorphism and Token Swapping. This idea has been made possible by the publication of an approximative solution to the latter problem in 2016. We have compared our algorithm against five other qubit allocators, all independently designed in the last two years, including the winner of the IBM Challenge. When evaluated in "Tokyo", a quantum architecture with 20 qubits, our technique outperforms these state-of-the-art approaches in terms of the quality of the solutions that it finds and the amount of memory that it uses, while showing practical runtime.
Document type :
Journal articles
Complete list of metadatas

Cited literature [55 references]  Display  Hide  Download

https://hal.inria.fr/hal-02316820
Contributor : Caroline Collange <>
Submitted on : Tuesday, October 15, 2019 - 3:45:47 PM
Last modification on : Thursday, October 17, 2019 - 1:15:15 AM

File

Siraichi_QubitAlloc_OOPSLA19.p...
Files produced by the author(s)

Identifiers

Citation

Marcos Siraichi, Vinicius Fernandes Dos Santos, Caroline Collange, Fernando Magno Quintão Pereira. Qubit allocation as a combination of subgraph isomorphism and token swapping. Proceedings of the ACM on Programming Languages, ACM, 2019, 3 (OOPSLA), pp.1-29. ⟨10.1145/3360546⟩. ⟨hal-02316820⟩

Share

Metrics

Record views

17

Files downloads

121