EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations

Quantum computing is an information processing paradigm that uses quantum-mechanical properties to speedup computationally hard problems. Gate-based quantum computers and Quantum Annealers (QAs) are two commercially available hardware platforms that are accessible to users today. Although promising, existing gate-based quantum computers consist of only a few dozen qubits and are not large enough for most applications. On the other hand, existing QAs with few thousand of qubits have the potential to solve some domainspecific optimization problems. QAs are single instruction machines and to execute a program, the problem is cast to a Hamiltonian, embedded on the hardware, and a single quantum machine instruction (QMI) is run. Unfortunately, noise and imperfections in hardware result in sub-optimal solutions on QAs even if the QMI is run for thousands of trials. The limited programmability of QAs mean that the user executes the same QMI for all trials. This subjects all trials to a similar noise profile throughout the execution, resulting in a systematic bias. We observe that systematic bias leads to sub-optimal solutions and cannot be alleviated by executing more trials or using existing error-mitigation schemes. To address this challenge, we propose EQUAL (Ensemble QUantum AnneaLing). EQUAL generates an ensemble of QMIs by adding controlled perturbations to the program QMI. When executed on the QA, the ensemble of QMIs steers the program away from encountering the same bias during all trials and thus, improves the quality of solutions. Our evaluations using the 2041-qubit D-Wave QA show that EQUAL bridges the difference between the baseline and the ideal by an average of 14% (and up to 26%), without requiring any additional trials. EQUAL can be combined with existing error mitigation schemes to further bridge the difference between the baseline and ideal by an average of 55% (and up to 68%).

[1]  Margaret Martonosi,et al.  Architecting Noisy Intermediate-Scale Quantum Computers: A Real-System Study , 2020, IEEE Micro.

[2]  Brian D. Weitzner,et al.  Designing Peptides on a Quantum Computer , 2019, bioRxiv.

[3]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[4]  Wei Tang,et al.  CutQC: using small Quantum computers for large Quantum circuit evaluations , 2020, ASPLOS.

[5]  Joonwoo Bae,et al.  A hybrid quantum-classical approach to mitigating measurement errors , 2020 .

[6]  J. Straub,et al.  Global energy minimum searches using an approximate solution of the imaginary time Schroedinger equation , 1993 .

[7]  Xi Chen,et al.  Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer. , 2020 .

[8]  Tim Finin,et al.  An Ensemble Approach for Compressive Sensing with Quantum Annealers , 2020, IGARSS 2020 - 2020 IEEE International Geoscience and Remote Sensing Symposium.

[9]  Aidan Roy,et al.  Fast clique minor generation in Chimera qubit connectivity graphs , 2015, Quantum Inf. Process..

[10]  Rupak Biswas,et al.  A NASA perspective on quantum computing: Opportunities and challenges , 2017, Parallel Comput..

[11]  K. Tsuda,et al.  Designing metamaterials with quantum annealing and factorization machines , 2020 .

[12]  Swaroop Ghosh,et al.  Large-Scale Quantum Approximate Optimization via Divide-and-Conquer , 2021, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Travis S. Humble,et al.  Quantum supremacy using a programmable superconducting processor , 2019, Nature.

[14]  Travis S. Humble,et al.  Optimizing adiabatic quantum program compilation using a graph-theoretic framework , 2017, Quantum Information Processing.

[15]  R. Feynman Simulating physics with computers , 1999 .

[16]  John E. Dorband,et al.  Extending the D-Wave with support for Higher Precision Coefficients , 2018, ArXiv.

[17]  Daniel A. Lidar,et al.  Quantum annealing correction for random Ising problems , 2014, 1408.4382.

[18]  Margaret Martonosi,et al.  Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers , 2019, ASPLOS.

[19]  Ajinkya Borle,et al.  On Post-Processing the Results of Quantum Optimizers , 2019, TPNC.

[20]  D. Bacon,et al.  Quantum approximate optimization of non-planar graph problems on a planar superconducting processor , 2020, Nature Physics.

[21]  Bryan O'Gorman,et al.  A case study in programming a quantum annealer for hard operational planning problems , 2014, Quantum Information Processing.

[22]  Helmut G. Katzgraber,et al.  Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods , 2017, Physical review. E.

[23]  Lei He,et al.  A quantum annealing approach for Boolean Satisfiability problem , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[24]  Jay M. Gambetta,et al.  Mitigating measurement errors in multiqubit experiments , 2020, 2006.14044.

[25]  Tirthak Patel,et al.  Qraft: reverse your Quantum circuit and know the correct program output , 2021, ASPLOS.

[26]  Tirthak Patel,et al.  DisQ: A Novel Quantum Output State Classification Method on IBM Quantum Computers using OpenPulse , 2020, 2020 IEEE/ACM International Conference On Computer Aided Design (ICCAD).

[27]  Margaret Martonosi,et al.  Full-Stack, Real-System Quantum Computer Studies: Architectural Comparisons and Design Insights , 2019, 2019 ACM/IEEE 46th Annual International Symposium on Computer Architecture (ISCA).

[28]  Moinuddin K. Qureshi,et al.  Mitigating Measurement Errors in Quantum Computers by Exploiting State-Dependent Bias , 2019, MICRO.

[29]  Hidetoshi Nishimori,et al.  Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stoquastic Hamiltonians , 2016, Frontiers ICT.

[30]  J. Doll,et al.  Quantum annealing: A new method for minimizing multidimensional functions , 1994, chem-ph/9404003.

[31]  Aidan Roy,et al.  A practical heuristic for finding graph minors , 2014, ArXiv.

[32]  Tim Finin,et al.  Multi-qubit correction for quantum annealers , 2021, Scientific reports.

[33]  The D-Wave Advantage System : An Overview , 2020 .

[34]  Gushu Li,et al.  Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices , 2018, ASPLOS.

[35]  Robert Wille,et al.  An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures , 2017, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[36]  Shinichiro Taguchi,et al.  Improving solutions by embedding larger subproblems in a D-Wave quantum annealer , 2019, Scientific Reports.

[37]  K. Aihara,et al.  Traffic signal optimization on a square lattice with quantum annealing , 2021, Scientific Reports.

[38]  Ravindra K. Ahuja,et al.  Network Models in Railroad Planning and Scheduling , 2005 .

[39]  Velimir V. Vesselinov,et al.  Nonnegative/Binary matrix factorization with a D-Wave quantum annealer , 2017, PloS one.

[40]  Haibin Zhang,et al.  Strong Quantum Computational Advantage Using a Superconducting Quantum Processor. , 2021, Physical review letters.

[41]  Catherine C. McGeoch,et al.  Theory versus practice in annealing-based quantum computing , 2020, Theor. Comput. Sci..

[42]  Tirthak Patel,et al.  UREQA: Leveraging Operation-Aware Error Rates for Effective Quantum Circuit Mapping on NISQ-Era Quantum Computers , 2020, USENIX Annual Technical Conference.

[43]  Feng Hu,et al.  Factoring larger integers with fewer qubits via quantum annealing with optimized parameters , 2019, Science China Physics, Mechanics & Astronomy.

[44]  Timothy W. Finin,et al.  Quantum Annealing Based Binary Compressive Sensing with Matrix Uncertainty , 2019, ArXiv.

[45]  Tim Finin,et al.  Quantum-Assisted Greedy Algorithms , 2019 .

[46]  WanJie,et al.  MISO Unlocks Billions in Savings Through the Application of Operations Research for Energy and Ancillary Services Markets , 2012 .

[47]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[48]  J. Christopher Beck,et al.  A Hybrid Quantum-Classical Approach to Solving Scheduling Problems , 2016, SOCS.

[49]  John Preskill,et al.  Quantum Computing in the NISQ era and beyond , 2018, Quantum.

[50]  Frederic T. Chong,et al.  Optimized Quantum Compilation for Near-Term Algorithms with OpenPulse , 2020, 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO).

[51]  J. Gambetta,et al.  Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets , 2017, Nature.

[52]  Tim Finin,et al.  Reinforcement Quantum Annealing: A Hybrid Quantum Learning Automata , 2020, Scientific Reports.

[53]  Gili Rosenberg,et al.  Boosting quantum annealer performance via sample persistence , 2016, Quantum Inf. Process..

[54]  D. McMahon Adiabatic Quantum Computation , 2008 .

[55]  Franz Ross International Business Machines Corporation , 2019, The Grants Register 2021.

[56]  Christopher J. Wood,et al.  Measurement Error Mitigation for Variational Quantum Algorithms , 2020, 2010.08520.

[57]  B. Chakrabarti,et al.  Colloquium : Quantum annealing and analog quantum computation , 2008, 0801.2193.

[58]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.

[59]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[60]  Masayuki Ohzeki,et al.  Quantum annealing: An introduction and new developments , 2010, 1006.1696.

[61]  Hristo Djidjev,et al.  Optimizing the Spin Reversal Transform on the D-Wave 2000Q , 2019, 2019 IEEE International Conference on Rebooting Computing (ICRC).

[62]  Henry Hoffmann,et al.  Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines , 2019, MICRO.

[63]  Aidan Roy,et al.  Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis , 2016, Front. ICT.

[64]  Daniel O'Malley,et al.  Pre- and post-processing in quantum-computational hydrologic inverse analysis , 2019, ArXiv.

[65]  Margaret Martonosi,et al.  Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers , 2019, ASPLOS.

[66]  H. Nishimori,et al.  Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.

[67]  Swaroop Ghosh,et al.  Circuit Compilation Methodologies for Quantum Approximate Optimization Algorithm , 2020, 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO).

[68]  Swaroop Ghosh,et al.  An Efficient Circuit Compilation Flow for Quantum Approximate Optimization Algorithm , 2020, 2020 57th ACM/IEEE Design Automation Conference (DAC).

[69]  Xingwang Ma,et al.  MISO Unlocks Billions in Savings Through the Application of Operations Research for Energy and Ancillary Services Markets , 2012, Interfaces.

[70]  Catherine D. Schuman,et al.  Efficiently embedding QUBO problems on adiabatic quantum computers , 2019, Quantum Information Processing.

[71]  D. Venturelli,et al.  Quantum Annealing Implementation of Job-Shop Scheduling , 2015, 1506.08479.

[72]  Daniel A. Lidar,et al.  Nested quantum annealing correction , 2015, npj Quantum Information.

[73]  Seth Lloyd,et al.  Universal Quantum Simulators , 1996, Science.

[74]  Travis S. Humble,et al.  Establishing the quantum supremacy frontier with a 281 Pflop/s simulation , 2019, Quantum Science and Technology.

[75]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[76]  Henry Hoffmann,et al.  Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers , 2019, ASPLOS.

[77]  Travis S. Humble,et al.  Financial Portfolio Management using D-Wave’s Quantum Optimizer: The Case of Abu Dhabi Securities Exchange , 2017 .

[78]  Tirthak Patel,et al.  VERITAS: Accurately Estimating the Correct Output on Noisy Intermediate-Scale Quantum Computers , 2020, SC20: International Conference for High Performance Computing, Networking, Storage and Analysis.

[79]  R. Biswas,et al.  A quantum annealing approach for fault detection and diagnosis of graph-based systems , 2014, The European Physical Journal Special Topics.

[80]  Alán Aspuru-Guzik,et al.  A variational eigenvalue solver on a photonic quantum processor , 2013, Nature Communications.

[81]  Moinuddin K. Qureshi,et al.  Ensemble of Diverse Mappings: Improving Reliability of Quantum Computers by Orchestrating Dissimilar Mistakes , 2019, MICRO.

[82]  Error suppression in adiabatic quantum computing with qubit ensembles , 2019, 1909.09947.

[83]  Moinuddin K. Qureshi,et al.  Not All Qubits Are Created Equal: A Case for Variability-Aware Policies for NISQ-Era Quantum Computers , 2018, ASPLOS.