Qubit allocation

Siraichi, Marcos Yukio; Collange, Sylvain; Pereira, Fernando Magno Quintão

doi:10.1145/3179541.3168822

Cited by 24 publications

(38 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Earlier works would either solve qubit allocation manually, or present allocators only for specific quantum algorithms [Blais 2001;Copsey et al 2003;Oskin et al 2002;Saito et al 2000]. Qubit allocation has several variations, all of which are NP-complete [Siraichi et al 2018]. Such diversity has led to an equally varied number of solutions.…”

Section: Related Workmentioning

confidence: 99%

“…This problem: the mapping of quantum circuits into arbitrary quantum machines has been referred as quantum circuit placement [Maslov et al 2008]; mapping problem [Zulehner et al 2018]; circuit compilation [Itoko et al 2019] and qubit allocation [Siraichi et al 2018;Tannu and Qureshi 2019]. Henceforth, we shall adopt the latter terminology.…”

Section: Introductionmentioning

confidence: 99%

“…Henceforth, we shall adopt the latter terminology. There exist different solutions to qubit allocation [Itoko et al 2019;Lin et al 2015;Maslov et al 2008;Pedram and Shafaei 2016;Shafaei et al 2014;Siraichi et al 2018;Zulehner et al 2018]; however, contrary to classic register allocation, a problem elegantly modeled via graph coloring [Chaitin et al 1981;Pereira and Palsberg 2005], qubit allocation still lacks principled solutions. Subgraph isomorphism emerges as a candidate to provide a fundamental metaphor to it.…”

Section: Introductionmentioning

confidence: 99%

“…Subgraph isomorphism emerges as a candidate to provide a fundamental metaphor to it. Nevertheless, subgraph isomorphism can only model small instances of qubit allocation, which do not require transformations in the quantum circuit [Siraichi et al 2018]. In this paper, we show how to extend this model to general circuits.…”

Section: Introductionmentioning

confidence: 99%

“…This evaluation is another contribution of this paper, which compares our technique against five state-of-the-art qubit allocators. In this comparison, we include the algorithm currently used in the IBM Quantum Experience Toolkit; the exhaustive search of Zulehner et al [2018], the hill-climbing algorithm of Li et al [2018], the dedicated compiler of Zulehner and Wille, which won IBM's QISKit Developer Challenge [Zulehner and Wille 2019] in 2018, and the best-effort heuristic of Siraichi et al [2018]. Experiments on quantum programs publicly available show that our algorithm is able to generate more efficient quantum circuits than other approaches.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Qubit allocation as a combination of subgraph isomorphism and token swapping

Siraichi

Santos

Collange

et al. 2019

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

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. CCS Concepts: • Computer systems organization → Quantum computing; • Software and its engineering → Compilers; • Theory of computation → Parameterized complexity and exact algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Qubit allocation as a combination of subgraph isomorphism and token swapping

Siraichi

Santos

Collange

et al. 2019

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

show abstract

Evaluating the Flexibility of A* for Mapping Quantum Circuits

Zulehner

Bauer

Wille

2019

Reversible Computation

View full text Add to dashboard Cite

Simulation and Design of Quantum Circuits

Zulehner

Wille

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Currently, there is an ongoing “race” to build the first practically useful quantum computer that provides substantial speed-ups for certain problems compared to conventional computers. In addition to the development of such devices, this also requires the development of automated tools and methods that provide assistance in the simulation and design of corresponding applications. Otherwise, a situation might be reached where we have powerful quantum computers but hardly any proper means to actually use them. This work provides an overview of corresponding solutions for the task of quantum circuit simulation, the task of quantum circuit design, as well as corresponding mapping tasks. The covered solutions utilise expertise on efficient data structures and algorithms gained in the design of conventional circuits and systems over the last decades. While the respective descriptions are kept brief and mainly convey the general ideas, references to further readings are provided for a more detailed treatment.

show abstract

Qubit allocation

Cited by 24 publications

References 0 publications

Qubit allocation as a combination of subgraph isomorphism and token swapping

Qubit allocation as a combination of subgraph isomorphism and token swapping

Evaluating the Flexibility of A* for Mapping Quantum Circuits

Simulation and Design of Quantum Circuits

Contact Info

Product

Resources

About