More Web Proxy on the site http://driver.im/

Article

Qubit allocation

Authors:

Marcos Yukio Siraichi,

Vinícius Fernandes dos Santos,

Caroline Collange,

Fernando Magno Quintao PereiraAuthors Info & Claims

CGO '18: Proceedings of the 2018 International Symposium on Code Generation and Optimization

Pages 113 - 125

https://doi.org/10.1145/3168822

Published: 24 February 2018 Publication History

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.

References

[1]

Steven Balensiefer, Lucas Kregor-Stickles, and Mark Oskin. 2005. An Evaluation Framework and Instruction Set Architecture for Ion-Trap Based Quantum Micro-Architectures. In ISCA. IEEE, Washington, DC, USA, 186-196.

Digital Library

[2]

Adriano Barenco, Charles H Bennett, Richard Cleve, David P DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A Smolin, and Harald Weinfurter. 1995. Elementary gates for quantum computation. Physical review A 52, 5 (1995), 3457.

[3]

Richard Bellman. 1958. On a Routing Problem. Quart. Appl. Math. 16 (1958), 87-90.

[4]

Paul Benioff. 1980. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. Journal of Statistical Physics 22, 5 (1980), 563-591.

[5]

Édouard Bonnet, Tillmann Miltzow, and Pawel Rzazewski. 2016. Complexity of Token Swapping and its Variants. CoRR arXiv:1607.07676, Article 2 (2016), 23 pages.

[6]

Gregory J. Chaitin, Mark A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, and Peter W. Markstein. 1981. Register allocation via coloring. Computer Languages 6 (1981), 47-57.

Digital Library

[7]

Josep M Codina, Jesús Sánchez, and Antonio González. 2001. A unified modulo scheduling and register allocation technique for clustered processors. In Parallel Architectures and Compilation Techniques. IEEE, Los Alamitos, CA, USA, 175-184.

Digital Library

[8]

Stephen A. Cook. 1971. The Complexity of Theorem-proving Procedures. In STOC. ACM, New York, NY, USA, 151-158.

Digital Library

[9]

Andrew W. Cross, Lev S. Bishop, John A. Smolin, and Jay M. Gambetta. 2017. Open Quantum Assembly Language. IBM, Armonk, NY, USA.

[10]

D. Deutsch. 1985. Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer. Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences 400, 1818 (1985), 97-117.

[11]

Simon J. Devitt. 2016. Performing quantum computing experiments in the cloud. Phys. Rev. A 94, 3 (2016), 032329.

[12]

Michel H Devoret, Andreas Wallraff, and John M Martinis. 2004. Superconducting qubits: A short review. arXiv cond-mat/0411174 (2004), 1-41.

[13]

Martin Farach and Vincenzo Liberatore. 1998. On local register allocation. In SODA. ACM, New York, NY, USA, 564-573.

Digital Library

[14]

Jay M Gambetta, Jerry M Chow, and Matthias Steffen. 2017. Building logical qubits in a superconducting quantum computing system. NPJ Quantum Mechanics 3, Article 2 (2017), 7 pages.

[15]

Simon J Gay. 2006. Quantum programming languages: Survey and bibliography. Mathematical Structures in Computer Science 16, 4 (2006), 581-600.

Digital Library

[16]

Dario Gil. 2017. The Future of Computing: AI and Quantum. Online video.

[17]

Alexander S Green, Peter LeFanu Lumsdaine, Neil J Ross, Peter Selinger, and Benoît Valiron. 2013. Quipper: a scalable quantum programming language. In SIGPLAN Notices, Vol. 48. ACM, New York, NY, USA, 333-342.

Digital Library

[18]

Lov K. Grover. 1996. A Fast Quantum Mechanical Algorithm for Database Search. In STOC. ACM, New York, NY, USA, 212-219.

Digital Library

[19]

Thomas Häner, Damian S. Steiger, Krysta M. Svore, and Matthias Troyer. 2016. A Software Methodology for Compiling Quantum Programs. CoRR abs/1604.01401 (2016), 1-14.

[20]

Ali Javadi-Abhari, Pranav Gokhale, Adam Holmes, Diana Franklin, Kenneth R. Brown, Margaret Martonosi, and Frederic T. Chong. 2017. Optimized Surface Code Communication in Superconducting Quantum Computers. In MICRO. ACM, New York, NY, USA, 692-705.

Digital Library

[21]

Ali Javadi-Abhari, Shruti Patil, Daniel Kudrow, Jeff Heckey, Alexey Lvov, Frederic T Chong, and Margaret Martonosi. 2014. ScaffCC: a framework for compilation and analysis of quantum computing programs. In Computing Frontiers. ACM, New York, NY, USA, 1.

Digital Library

[22]

Jun Kawahara, Toshiki Saitoh, and Ryo Yoshinaka. 2017. The Time Complexity of the Token Swapping Problem and Its Parallel Variants. In WALCOM. Springer, Heidelberg, Germany, 448-459.

[23]

Jens Koch, Terri M. Yu, Jay Gambetta, A. A. Houck, D. I. Schuster, J. Majer, Alexandre Blais, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf. 2007. Charge-insensitive qubit design derived from the Cooper pair box. Phys. Rev. A 76, 1 (2007), 04319.

[24]

Jonathan K. Lee, Jens Palsberg, and Fernando M. Q. Pereira. 2007. Aliased Register Allocation for Straight-Line Programs Is NP-Complete. In ICALP. Springer, Heidelberg, Germany, 258-273.

Digital Library

[25]

Daniel A Lidar and Todd A Brun. 2013. Quantum error correction. Cambridge University Press, Cambridge, UK.

[26]

C. C. Lin, S. Sur-Kolay, and N. K. Jha. 2015. PAQCS: Physical Design-Aware Fault-Tolerant Quantum Circuit Synthesis. Transactions on Very Large Scale Integration (VLSI) Systems 23, 7 (2015), 1221-1234.

Digital Library

[27]

Chris Lomont. 2003. Quantum Circuit Identities. CoRR arXiv:quantph/0307111 (2003), 1-6.

[28]

Dmitri Maslov. 2017. Basic circuit compilation techniques for an ion-trap quantum machine. New Journal of Physics 19, 2 (2017), 023035.

[29]

D. Maslov, S. M. Falconer, and M. Mosca. 2008. Quantum Circuit Placement. Transactions on Computer-Aided Design of Integrated Circuits and Systems 27, 4 (2008), 752-763.

Digital Library

[30]

M Mohseni, P Read, H Neven, S Boixo, V Denchev, R Babbush, A Fowler, V Smelyanskiy, and J Martinis. 2017. Commercialize early quantum technologies. Nature 543, 7644 (2017), 171.

[31]

Michael A Nielsen and Isaac Chuang. 2000. Quantum computation and quantum information. Cambridge University Press, Cambridge, UK.

Digital Library

[32]

M. Pedram and A. Shafaei. 2016. Layout Optimization for Quantum Circuits with Linear Nearest Neighbor Architectures. Circuits and Systems Magazine 16, 2 (2016), 62-74.

[33]

Simon Perdrix. 2008. Quantum entanglement analysis based on abstract interpretation. In SAS. Springer, Heidelberg, Germany, 270-282.

Digital Library

[34]

Fernando Magno Quintao Pereira and Jens Palsberg. 2006. Register Allocation after Classic SSA elimination is NP-complete. In FOSSACS. Springer, Heidelberg, Germany, 79-93.

Digital Library

[35]

Jordi Petit. 2003. Experiments on the Minimum Linear Arrangement Problem. J. Exp. Algorithmics 8 (2003), 1-33.

Digital Library

[36]

Peter Selinger. 2004. A brief survey of quantum programming languages. In Functional and Logic Programming. Springer, Heidelberg, Germany, 61-69.

[37]

A. Shafaei, M. Saeedi, and M. Pedram. 2014. Qubit placement to minimize communication overhead in 2D quantum architectures. In ASP-DAC. IEEE, Washington, DC, USA, 495-500.

[38]

Peter W. Shor. 1997. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. Journal on Computing 26, 5 (1997), 1484-1509.

Digital Library

[39]

Robert S. Smith, Michael J. Curtis, and William J. Zeng. 2017. A Practical Quantum Instruction Set Architecture. arXiv arXiv:1608.03355 (2017), 1-15.

[40]

Krysta M. Svore, Alfred V. Aho, Andrew W. Cross, Isaac Chuang, and Igor L. Markov. 2006. A Layered Software Architecture for Quantum Computing Design Tools. Computer 39, 1 (2006), 74-83.

Digital Library

[41]

Robert R Tucci. 1999. A Rudimentary Quantum Compiler (2nd Ed.). arXiv quant-ph/9902062 (1999), 1-25.

[42]

Dave Wecker and Krysta M Svore. 2014. LIQUi|¿: A software design architecture and domain-specific language for quantum computing. arXiv quant-ph:1402.4467 (2014), 1-14.

[43]

Laurence A. Wolsey. 2008. Mixed Integer Programming. Encyclopedia of Computer Science and Engineering Online, ecse244 (2008), -.

[44]

Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno. 2014. Swapping Labeled Tokens on Graphs. Springer, Heidelberg, Germany, 364-375.

Cited By

Tan DBluvstein DLukin MCong J(2024)Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array ProcessorsQuantum10.22331/q-2024-03-14-12818(1281)Online publication date: 14-Mar-2024
https://doi.org/10.22331/q-2024-03-14-1281
Quetschlich NBurgholzer LWille R(2024)MQT Predictor: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum ComputingACM Transactions on Quantum Computing10.1145/3673241Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3673241
Dobbs EFriedman JPaler A(2024)Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum ComputersACM Transactions on Quantum Computing10.1145/3670417Online publication date: 8-Jun-2024
https://dl.acm.org/doi/10.1145/3670417
Show More Cited By

Index Terms

Qubit allocation

Recommendations

An exact qubit allocation approach for NISQ architectures
Abstract
The noisy intermediate-scale quantum (NISQ) devices that have just emerged in recent years provide an opportunity for the physical realization of quantum circuits. As the first step of mapping quantum circuits to these devices, qubit allocation ...
Exact canonical decomposition of two-qubit operators in terms of CNOT

The canonical decomposition for two-qubit operators has proven very useful for applications in quantum computing. This decomposition generates equivalence classes up to local quantum gates. We provide a variety of complete, explicit decompositions of ...
Graph Neural Network Assisted Quantum Compilation for Qubit Allocation
GLSVLSI '23: Proceedings of the Great Lakes Symposium on VLSI 2023

Quantum computers in the current noisy intermediate-scale quantum (NISQ) era face two major limitations - size and error vulnerability. Although quantum error correction (QEC) methods exist, they are not applicable at the current size of computers, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

CGO '18: Proceedings of the 2018 International Symposium on Code Generation and Optimization

February 2018

377 pages

ISBN:9781450356176

DOI:10.1145/3179541

General Chairs:
Jens Knoop
Vienna University of Technology, Austria
,
Markus Schordan
Lawrence Livermore National Laboratory, USA
,
Program Chairs:
Teresa Johnson
Google, USA
,
Michael O'Boyle
University of Edinburgh, UK

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
IEEE-CS: Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication Notes

Badge change: Article originally badged under Version 1.0 guidelines https://www.acm.org/publications/policies/artifact-review-badging

Publication History

Published: 24 February 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Badges

Author Tags

Qualifiers

Article

Funding Sources

INRIA
FAPEMIG

Conference

CGO '18

Sponsor:

CGO '18: 16th Annual IEEE/ACM International Symposium on Code Generation and Optimization

February 24 - 28, 2018

Vienna, Austria

Acceptance Rates

Overall Acceptance Rate 312 of 1,061 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

121
Total Citations
View Citations
1,390
Total Downloads

Downloads (Last 12 months)228
Downloads (Last 6 weeks)20

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tan DBluvstein DLukin MCong J(2024)Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array ProcessorsQuantum10.22331/q-2024-03-14-12818(1281)Online publication date: 14-Mar-2024
https://doi.org/10.22331/q-2024-03-14-1281
Quetschlich NBurgholzer LWille R(2024)MQT Predictor: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum ComputingACM Transactions on Quantum Computing10.1145/3673241Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3673241
Dobbs EFriedman JPaler A(2024)Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum ComputersACM Transactions on Quantum Computing10.1145/3670417Online publication date: 8-Jun-2024
https://dl.acm.org/doi/10.1145/3670417
Gokhale PTomesh TSuchara MChong F(2024)Faster and More Reliable Quantum SWAPs via Native GatesProceedings of the 2024 International Conference on Parallel Architectures and Compilation Techniques10.1145/3656019.3689818(351-362)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1145/3656019.3689818
Elsayed Amer NGomaa WKimura KUeda KEl-Mahdy A(2024)On the optimality of quantum circuit initial mapping using reinforcement learningEPJ Quantum Technology10.1140/epjqt/s40507-024-00225-111:1Online publication date: 13-Mar-2024
https://doi.org/10.1140/epjqt/s40507-024-00225-1
Metwalli SVan Meter R(2024)Testing and Debugging Quantum CircuitsIEEE Transactions on Quantum Engineering10.1109/TQE.2024.33748795(1-15)Online publication date: 2024
https://doi.org/10.1109/TQE.2024.3374879
Jin YGao XGuo MChen HHua FZhang CZhang E(2024)Optimizing Quantum Fourier Transformation (QFT) Kernels for Modern NISQ and FT ArchitecturesProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC41406.2024.00074(1-15)Online publication date: 17-Nov-2024
https://dl.acm.org/doi/10.1109/SC41406.2024.00074
Pascoal GFernandes JAbreu R(2024)Deep Reinforcement Learning Strategies for Noise-Adaptive Qubit Routing2024 IEEE International Conference on Quantum Software (QSW)10.1109/QSW62656.2024.00030(146-156)Online publication date: 7-Jul-2024
https://doi.org/10.1109/QSW62656.2024.00030
Schmidbauer LWintersperger KLobe EMauerer W(2024)Polynomial Reduction Methods and their Impact on QAOA Circuits2024 IEEE International Conference on Quantum Software (QSW)10.1109/QSW62656.2024.00018(35-45)Online publication date: 7-Jul-2024
https://doi.org/10.1109/QSW62656.2024.00018
Li TLiu WWang F(2024)Optimization of Qubit Mapping Model Based on Deep Q Network2024 5th International Conference on Computer Engineering and Application (ICCEA)10.1109/ICCEA62105.2024.10603880(538-543)Online publication date: 12-Apr-2024
https://doi.org/10.1109/ICCEA62105.2024.10603880
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents