skip to main content
10.1145/3400302.3415745acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
invited-talk
Public Access

Noise resilient compilation policies for quantum approximate optimization algorithm

Published: 17 December 2020 Publication History

Abstract

Quantum approximate optimization algorithm (QAOA) is a promising quantum-classical hybrid algorithm to solve hard combinatorial optimization problems using noisy quantum devices. The multiqubit CPHASE gates used in the quantum circuit for QAOA are commutative i.e., the order of the gates can be altered without changing the output state. This re-ordering leads to the execution of more gates in parallel and a smaller number of additional SWAP gates to compile the QAOA circuit resulting in lower circuit-depth and gate-count. A less number of gates generally indicates a lower accumulation of gate-errors, and a reduced circuit-depth means less decoherence time for the qubits. However, near-term quantum devices exhibit significant variations in the gate success probabilities. Variation-aware compilation policies (i.e. putting most gate operations on qubits with higher gate success probabilities) can enhance the probability of successful program execution on the hardware. The greater flexibility of QAOA-circuits offer better scope of optimization with QAOA-tailored compilation policies. This paper presents an argument for compilation policies to exploit the unique characteristics of QAOA-circuits alongside the variation-awareness of the noisy devices. We present two procedures - variation-aware qubit placement (VQP) and variation-aware iterative mapping (VIM) that can improve the circuit success probability quite significantly (≈8.408X on average) for a set of QAOA-MaxCut problems on ibmq_16_melbourne.

References

[1]
Mahabubul Alam, Abdullah Ash-Saki, and Swaroop Ghosh. 2019. Addressing Temporal Variations in Qubit Quality Metrics for Parameterized Quantum Circuits. In 2019 IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED). IEEE, 1--6.
[2]
M. Alam, A. Ash-Saki, and S. Ghosh. 2020. Accelerating Quantum Approximate Optimization Algorithm using Machine Learning. In 2020 Design, Automation Test in Europe Conference Exhibition (DATE). 686--689.
[3]
Mahabubul Alam, Abdullah Ash-Saki, and Swaroop Ghosh. 2020. Circuit Compilation Methodologies for Quantum Approximate Optimization Algorithm. IEEE/ACM International Symposium on Microarchitecture (2020).
[4]
M. Alam, A. Ash-Saki, and S. Ghosh. 2020. Design-Space Exploration of Quantum Approximate Optimization Algorithm under Noise. In 2020 IEEE Custom Integrated Circuits Conference (CICC). 1--4.
[5]
Mahabubul Alam, Abdullah Ash-Saki, and Swaroop Ghosh. 2020. An Efficient Circuit Compilation Flow for Quantum Approximate Optimization Algorithm. IEEE/ACM Design Automation Conference (2020).
[6]
Frank Arute, Kunal Arya, Ryan Babbush, Bacon, et al. 2019. Quantum supremacy using a programmable superconducting processor. Nature 574, 7779 (2019), 505--510.
[7]
Abdullah Ash-Saki, Mahabubul Alam, and Swaroop Ghosh. 2019. QURE: Qubit Re-allocation in Noisy Intermediate-Scale Quantum Computers. In Proceedings of the 56th Annual Design Automation Conference 2019. ACM, 141.
[8]
George S Barron, FA Calderon-Vargas, Junling Long, David P Pappas, and Sophia E Economou. 2020. Microwave-based arbitrary cphase gates for transmon qubits. Physical Review B 101, 5 (2020), 054508.
[9]
Debjyoti Bhattacharjee and Anupam Chattopadhyay. 2017. Depth-optimal quantum circuit placement for arbitrary topologies. arXiv preprint arXiv:1703.08540 (2017).
[10]
Debjyoti Bhattacharjee, Abdullah Ash Saki, Mahabubul Alam, Anupam Chattopadhyay, and Swaroop Ghosh. 2019. MUQUT: Multi-constraint quantum circuit mapping on NISQ computers. In 38th IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2019. Institute of Electrical and Electronics Engineers Inc., 8942132.
[11]
Gavin E Crooks. 2018. Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419 (2018).
[12]
Andrew Cross. 2018. The IBM Q experience and QISKit open-source quantum computing software. In APS Meeting Abstracts.
[13]
György Dósa. 2007. The tight bound of first fit decreasing bin-packing algorithm is FFD (I) 11/9OPT (I)+ 6/9. In International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. Springer, 1--11.
[14]
György Dósa and Jirí Sgall. 2013. First Fit bin packing: A tight analysis. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[15]
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014).
[16]
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Hartmut Neven. 2017. Quantum algorithms for fixed qubit architectures. arXiv preprint arXiv:1703.06199 (2017).
[17]
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Leo Zhou. 2019. The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size. arXiv preprint arXiv:1910.08187 (2019).
[18]
Edward Farhi and Aram W Harrow. [n.d.]. Quantum supremacy through the quantum approximate optimization algorithm. arXiv preprint arXiv:1602.07674 ([n. d.]).
[19]
Harper R Grimsley, Daniel Claudino, Sophia E Economou, Edwin Barnes, and Nicholas J Mayhall. 2019. Is the Trotterized UCCSD Ansatz Chemically Well-Defined? Journal of Chemical Theory and Computation (2019).
[20]
Jeremy Hsu. 2018. CES 2018: Intel's 49-qubit chip shoots for quantum supremacy. IEEE Spectrum Tech Talk (2018).
[21]
Julian Kelly. 2018. A preview of Bristlecone, Google's new quantum processor. Google Research Blog 5 (2018).
[22]
Will Knight. 2018. IBM Raises the Bar with a 50-Qubit Quantum Computer, News.
[23]
Eugene L Lawler and David E Wood. 1966. Branch-and-bound methods: A survey. Operations research 14, 4 (1966), 699--719.
[24]
Gushu Li, Yufei Ding, and Yuan Xie. 2019. Tackling the qubit mapping problem for NISQ-era quantum devices. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. 1001--1014.
[25]
Prakash Murali, Jonathan M Baker, Ali Javadi-Abhari, Frederic T Chong, and Margaret Martonosi. 2019. Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. 1015--1029.
[26]
Prakash Murali, Norbert Matthias Linke, Margaret Martonosi, Ali Javadi Abhari, Nhung Hong Nguyen, and Cinthia Huerta Alderete. 2019. Full-stack, real-system quantum computer studies: architectural comparisons and design insights. In Proceedings of the 46th International Symposium on Computer Architecture. 527--540.
[27]
Prakash Murali, David C McKay, Margaret Martonosi, and Ali Javadi-Abhari. 2020. Software mitigation of crosstalk on noisy intermediate-scale quantum computers. In Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems. 1001--1016.
[28]
John Preskill. 2018. Quantum Computing in the NISQ era and beyond. Quantum 2 (2018), 79.
[29]
Chad Rigetti. 2018. The Rigetti 128-qubit chip and what it means for quantum. Medium (2018).
[30]
Jonathan Romero, Ryan Babbush, Jarrod R McClean, Cornelius Hempel, Peter J Love, and Alán Aspuru-Guzik. 2018. Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz. Quantum Science and Technology 4, 1 (2018), 014008.
[31]
Vivek V Shende, Stephen S Bullock, and Igor L Markov. 2006. Synthesis of quantum-logic circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25, 6 (2006), 1000--1010.
[32]
Swamit S Tannu and Moinuddin K Qureshi. 2019. Not all qubits are created equal: a case for variability-aware policies for NISQ-era quantum computers. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. 987--999.
[33]
Peter JM Van Laarhoven and Emile HL Aarts. 1987. Simulated annealing. In Simulated annealing: Theory and applications. Springer, 7--15.
[34]
Davide Venturelli, Minh Do, Eleanor Rieffel, and Jeremy Frank. 2018. Compiling quantum circuits to realistic hardware architectures using temporal planners. Quantum Science and Technology 3, 2 (2018), 025004.
[35]
Robert Wille, Lukas Burgholzer, and Alwin Zulehner. 2019. Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations. In Proceedings of the 56th Annual Design Automation Conference 2019. ACM, 142.
[36]
Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D Lukin. 2020. Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices. Physical Review X 10, 2 (2020), 021067.
[37]
Alwin Zulehner, Alexandru Paler, and Robert Wille. 2018. An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2018).

Cited By

View all
  • (2024)Architectures for Quantum Information ProcessingHandbook of Computer Architecture10.1007/978-981-97-9314-3_64(723-749)Online publication date: 21-Dec-2024
  • (2023)Solving Vehicle Routing Problem Using Quantum Approximate Optimization AlgorithmIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2022.317224124:7(7564-7573)Online publication date: Jul-2023
  • (2023)QPulseLib: Accelerating the Pulse Generation of Quantum Circuit with Reusable Patterns2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD)10.1109/ICCAD57390.2023.10323711(01-09)Online publication date: 28-Oct-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '20: Proceedings of the 39th International Conference on Computer-Aided Design
November 2020
1396 pages
ISBN:9781450380263
DOI:10.1145/3400302
  • General Chair:
  • Yuan Xie
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

  • IEEE CAS
  • IEEE CEDA
  • IEEE CS

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 December 2020

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Invited-talk

Funding Sources

  • Penn State ICDS
  • National Science Foundation

Conference

ICCAD '20
Sponsor:

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)88
  • Downloads (Last 6 weeks)15
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Architectures for Quantum Information ProcessingHandbook of Computer Architecture10.1007/978-981-97-9314-3_64(723-749)Online publication date: 21-Dec-2024
  • (2023)Solving Vehicle Routing Problem Using Quantum Approximate Optimization AlgorithmIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2022.317224124:7(7564-7573)Online publication date: Jul-2023
  • (2023)QPulseLib: Accelerating the Pulse Generation of Quantum Circuit with Reusable Patterns2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD)10.1109/ICCAD57390.2023.10323711(01-09)Online publication date: 28-Oct-2023
  • (2023)Quantum approximate optimization for combinatorial problems with constraintsInformation Sciences10.1016/j.ins.2022.11.020619(98-125)Online publication date: Jan-2023
  • (2023)Architectures for Quantum Information ProcessingHandbook of Computer Architecture10.1007/978-981-15-6401-7_64-1(1-27)Online publication date: 3-Mar-2023
  • (2022)Paulihedral: a generalized block-wise compiler optimization framework for Quantum simulation kernelsProceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3503222.3507715(554-569)Online publication date: 28-Feb-2022
  • (2022)2QANProceedings of the 49th Annual International Symposium on Computer Architecture10.1145/3470496.3527394(351-365)Online publication date: 18-Jun-2022

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media