Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3297858.3304075acmconferencesArticle/Chapter ViewAbstractPublication PagesasplosConference Proceedingsconference-collections
research-article
Public Access

Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers

Published: 04 April 2019 Publication History

Abstract

A massive gap exists between current quantum computing (QC) prototypes, and the size and scale required for many proposed QC algorithms. Current QC implementations are prone to noise and variability which affect their reliability, and yet with less than 80 quantum bits (qubits) total, they are too resource-constrained to implement error correction. The term Noisy Intermediate-Scale Quantum (NISQ) refers to these current and near-term systems of 1000 qubits or less. Given NISQ's severe resource constraints, low reliability, and high variability in physical characteristics such as coherence time or error rates, it is of pressing importance to map computations onto them in ways that use resources efficiently and maximize the likelihood of successful runs. This paper proposes and evaluates backend compiler approaches to map and optimize high-level QC programs to execute with high reliability on NISQ systems with diverse hardware characteristics. Our techniques all start from an LLVM intermediate representation of the quantum program (such as would be generated from high-level QC languages like Scaffold) and generate QC executables runnable on the IBM Q public QC machine. We then use this framework to implement and evaluate several optimal and heuristic mapping methods. These methods vary in how they account for the availability of dynamic machine calibration data, the relative importance of various noise parameters, the different possible routing strategies, and the relative importance of compile-time scalability versus runtime success. Using real-system measurements, we show that fine grained spatial and temporal variations in hardware parameters can be exploited to obtain an average 2.9x (and up to 18x) improvement in program success rate over the industry standard IBM Qiskit compiler. Despite small qubit counts, NISQ systems will soon be large enough to demonstrate "quantum supremacy", i.e., an advantage over classical computing. Tools like ours provide significant improvements in program reliability and execution time, and offer high leverage in accelerating progress towards quantum supremacy.

References

[1]
Ali Javadi Abhari, Arvin Faruque, Mohammad Javad Dousti, Lukas Svec, Oana Catu, Amlan Chakrabati, Chen-Fu Chiang, Seth Vanderwilt, John Black, Fred Chong, Margaret Martonosi, Martin Suchara, Ken Brown, Massoud Pedram, and Todd Brun. 2012. Scaffold: Quantum Programming Language. Report TR-934--12. Princeton University.
[2]
Matthew Amy, Dmitri Maslov, Michele Mosca, and Martin Roetteler. 2013. A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits. Trans. Comp.-Aided Des. Integ. Cir. Sys., Vol. 32, 6 (June 2013), 818--830.
[3]
Ethan Bernstein and Umesh Vazirani. 1993. Quantum Complexity Theory. In Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing (STOC '93). ACM, New York, NY, USA, 11--20.
[4]
Jacob Biamonte, Peter Wittek, Nicola Pancotti, Patrick Rebentrost, Nathan Wiebe, and Seth Lloyd. 2017. Quantum machine learning. Nature, Vol. 549 (13 Sep 2017), 195 EP --.
[5]
Nikolaj Bjørner, Anh-Dung Phan, and Lars Fleckenstein. 2015. νZ - An Optimizing SMT Solver. In Tools and Algorithms for the Construction and Analysis of Systems, Christel Baier and Cesare Tinelli (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 194--199.
[6]
Amlan Chakrabarti, Susmita Sur-Kolay, and Ayan Chaudhury. 2011. Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning.
[7]
Swamit S. Tannu and Moinuddin K. Qureshi. 2018. A Case for Variability-Aware Policies for NISQ-Era Quantum Computers. arXiv:1805.10224
[8]
Davide Venturelli, Minh Do, Eleanor Rieffel, and Jeremy Frank. 2018. Compiling quantum circuits to realistic hardware architectures using temporal planners. Quantum Science and Technology, Vol. 3, 2 (2018), 025004. http://stacks.iop.org/2058--9565/3/i=2/a=025004
[9]
Christophe Vuillot. 2017. Is error detection helpful on IBM 5Q chips? arXiv:1705.08957
[10]
Dave Wecker and Krysta M. Svore. 2014. LIQUi|>: A Software Design Architecture and Domain-Specific Language for Quantum Computing. arXiv:1402.4467
[11]
Mark Whitney, Nemanja Isailovic, Yatish Patel, and John Kubiatowicz. 2007. Automated Generation of Layout and Control for Quantum Circuits. In Proceedings of the 4th International Conference on Computing Frontiers (CF '07). ACM, New York, NY, USA, 83--94.
[12]
Xin Zhang, Hong Xiang, Tao Xiang, Li Fu, and Jun Sang. 2018. An efficient quantum circuits optimizing scheme compared with QISKit. arXiv:1807.01703
[13]
Alwin Zulehner, Alexandru Paler, and Robert Wille. 2017. An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures. arXiv:1712.04722

Cited By

View all
  • (2024)Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum CircuitsACM Transactions on Quantum Computing10.1145/36802915:3(1-26)Online publication date: 19-Sep-2024
  • (2024)QuCloud+: A Holistic Qubit Mapping Scheme for Single/Multi-programming on 2D/3D NISQ Quantum ComputersACM Transactions on Architecture and Code Optimization10.1145/363152521:1(1-27)Online publication date: 18-Jan-2024
  • (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
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ASPLOS '19: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems
April 2019
1126 pages
ISBN:9781450362405
DOI:10.1145/3297858
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

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 April 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. NISQ system
  2. Qubit mapping
  3. benchmarking
  4. noise-adaptive compilation
  5. performance evaluation
  6. quantum computing

Qualifiers

  • Research-article

Funding Sources

Conference

ASPLOS '19

Acceptance Rates

ASPLOS '19 Paper Acceptance Rate 74 of 351 submissions, 21%;
Overall Acceptance Rate 535 of 2,713 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)593
  • Downloads (Last 6 weeks)63
Reflects downloads up to 04 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum CircuitsACM Transactions on Quantum Computing10.1145/36802915:3(1-26)Online publication date: 19-Sep-2024
  • (2024)QuCloud+: A Holistic Qubit Mapping Scheme for Single/Multi-programming on 2D/3D NISQ Quantum ComputersACM Transactions on Architecture and Code Optimization10.1145/363152521:1(1-27)Online publication date: 18-Jan-2024
  • (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
  • (2024)BeSnake: A Routing Algorithm for Scalable Spin-Qubit ArchitecturesIEEE Transactions on Quantum Engineering10.1109/TQE.2024.34294515(1-22)Online publication date: 2024
  • (2024)Quantum Vulnerability Analysis to Guide Robust Quantum Computing System DesignIEEE Transactions on Quantum Engineering10.1109/TQE.2023.33436255(1-11)Online publication date: 2024
  • (2024)Efficient Qubit Routing Using a Dynamically Extract-and-Route FrameworkIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2024.338729043:10(2978-2989)Online publication date: Oct-2024
  • (2024)Noise Adaptive Quantum Circuit Mapping Using Reinforcement Learning and Graph Neural NetworkIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.334060843:5(1374-1386)Online publication date: May-2024
  • (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
  • (2024)Noise Aware Utility Optimization of NISQ Devices2024 22nd IEEE Interregional NEWCAS Conference (NEWCAS)10.1109/NewCAS58973.2024.10666318(168-172)Online publication date: 16-Jun-2024
  • (2024)Atomique: A Quantum Compiler for Reconfigurable Neutral Atom Arrays2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA)10.1109/ISCA59077.2024.00030(293-309)Online publication date: 29-Jun-2024
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media