Qubit Allocation

Abstract : In May of 2016, IBM Research has made a quantum processor available in the cloud to the general public. The possibility of programming an actual quantum device has elicited much enthusiasm. Yet, quantum programming still lacks the compiler support that modern programming languages enjoy today. To use universal quantum computers like IBM's, programmers must design low-level circuits. In particular, they must map logical qubits into physical qubits that need to obey connectivity constraints. This task resembles the early days of programming, in which software was built in machine languages. In this paper, we formally introduce the qubit allocation problem and provide an exact solution to it. This optimal algorithm deals with the simple quantum machinery available today; however, it cannot scale up to the more complex architectures scheduled to appear. Thus, we also provide a heuristic solution to qubit allocation, which is faster than the current solutions already implemented to deal with this problem.
Document type :
Conference papers
Complete list of metadatas

Cited literature [42 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01655951
Contributor : Sylvain Collange <>
Submitted on : Tuesday, December 5, 2017 - 12:17:38 PM
Last modification on : Monday, April 1, 2019 - 3:39:47 PM

File

Siraichi_QubitAllocation_CGO18...
Files produced by the author(s)

Identifiers

Citation

Marcos Siraichi, Vinicius Fernandes Dos Santos, Sylvain Collange, Fernando Magno Quintão Pereira. Qubit Allocation. CGO 2018 - International Symposium on Code Generation and Optimization, Feb 2018, Vienna, Austria. pp.1-12, ⟨10.1145/3168822⟩. ⟨hal-01655951⟩

Share

Metrics

Record views

626

Files downloads

1064