Open AccessQubit Allocation
Author(s) -
Marcos Yukio Siraichi,
Fernando Magno Quintão Pereira,
Vinicius dos Santos,
Caroline Collange
Publication year - 2020
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5753/ctd.2020.11368
Subject(s) - qubit , computer science , quantum computer , theoretical computer science , cloud computing , one way quantum computer , distributed computing , quantum , parallel computing , quantum mechanics , quantum error correction , physics , operating system
The availability of the first prototypes of quantum computers, in 2016, with free access through the cloud, brought much enthusiasm to the research community. Yet, programming said computers is difficult. One core challenge is the so called qubit allocation problem. This problem consists in mapping the virtual qubits that make up a logical quantum program onto the physical qubits that exist in the target quantum architecture. To deal with this challenge, we have proposed one of the first algorithms to solve qubit allocation. This algorithm, together with its ensuing formulations, is today available in the Enfield compilera concrete product of this work. Our first paper in this field, titled Qubit Allocation, has inspired much research, and our latest qubit allocation design, called Bounded Mapping Tree, stands out today as one of the most effective qubit allocators in the world.